论文信息 - An algorithm for discrete linearLp approximation

An algorithm for discrete linearLp approximation

SummaryIn this paper duality theory is used to derive an algorithm for the solution of the discrete linearLp approximation problem (for 1<p<2). This algorithm turns out to be similar to existing iteratively reweighted least squares algorithms, but can be shown to be globally andQ-superlinearly convergent.

J. Fischer

[1] Olvi L. Mangasarian,et al. Nonlinear Programming , 1969 .

[2] James M. Ortega,et al. Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[3] R. Fletcher,et al. The Calculation of Linear Best L_p Approximations , 1971, Comput. J..

[4] Alan B. Forsythe,et al. Robust Estimation of Straight Line Regression Coefficients by Minimizing pth Power Deviations , 1972 .

[5] G. Watson. The calculation of best linear one-sided _{} approximations , 1973 .

[6] J. J. Moré,et al. A Characterization of Superlinear Convergence and its Application to Quasi-Newton Methods , 1973 .

[7] Jerry M Wolfe,et al. On the convergence of an algorithm for discreteLp approximation , 1979 .

[8] J. Dunn. Newton’s Method and the Goldstein Step-Length Rule for Constrained Minimization Problems , 1980 .