univariate lp and ？ p averaging, 0 p 1, in polynomial time by utilization of statistical structure单变量lp和 p平均,0 p 1,在多项式时间内通过利用统计结构.pdfVIP

Algorithms 2012, 5, 421-432; doi:10.3390/a5040421 OPEN ACCESS algorithms ISSN 1999-4893 /journal/algorithms Article Univariate Lp and lp Averaging, 0 p 1, in Polynomial Time by Utilization of Statistical Structure John E. Lavery 1,2 1 Mathematical Sciences Division and Computing Sciences Division, Army Research Office, Army Research Laboratory, P.O. Box 12211, Research Triangle Park, NC 27709-2211, USA; E-Mail: john.e.lavery4.civ@; Tel.: +1-919-549-4253; Fax: +1-919-549-4354 2 Edward P. Fitts Department of Industrial and Systems Engineering, North Carolina State University, Raleigh, NC 27695-7906, USA Received: 28 July 2012; in revised form: 6 September 2012 / Accepted: 17 September 2012 / Published: 5 October 2012 Abstract: We present evidence that one can calculate generically combinatorially p p expensive L and l averages, 0 p 1, in polynomial time by restricting the data to come from a wide class of statistical distributions. Our approach differs from the approaches in the previous literature, which are based on a priori sparsity requirements or on accepting a local minimum as a replacement for a global minimum. The functionals by which Lp averages are calculated are not convex but are radially monotonic and the functionals by p which l averages are calculated are nearly so, which are the keys to solvability in polynomial time. Analytical results f