Quasi-Newton trust region algorithm for non-smooth least squares problems

In this paper we present a quasi-Newton trust region algorithm for non-smooth least squares problems which possess the smooth plus non-smooth decomposition. This method uses a smooth subproblem with second order information to approximate the locally Lipschitzian function, which is important to increase the convergence rate of the algorithm and deal with the large-residual non-smooth least squares problems. The global and superlinear convergence of this algorithm are established.

[1]  Liqun Qi,et al.  Trust Region Algorithms for Solving Nonsmooth Equations , 1995, SIAM J. Optim..

[2]  Jorge J. Moré,et al.  Recent Developments in Algorithms and Software for Trust Region Methods , 1982, ISMP.

[3]  B. Kummer Newton’s Method Based on Generalized Derivatives for Nonsmooth Functions: Convergence Analysis , 1992 .

[4]  Ya-Xiang Yuan,et al.  Conditions for convergence of trust region algorithms for nonsmooth optimization , 1985, Math. Program..

[5]  José Mario Martínez,et al.  Least change update methods for nonlinear systems with nondifferentiable terms , 1993 .

[6]  R. Fletcher Practical Methods of Optimization , 1988 .

[7]  P. P. Zabrejko,et al.  The majorant method in the theory of newton-kantorovich approximations and the pták error estimates , 1987 .

[8]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[9]  D. Sorensen Newton's method with a model trust region modification , 1982 .

[10]  M. Powell CONVERGENCE PROPERTIES OF A CLASS OF MINIMIZATION ALGORITHMS , 1975 .

[11]  Wenyu Sun,et al.  Trust region algorithm for nonsmooth optimization , 1997 .

[12]  Jong-Shi Pang,et al.  Globally Convergent Newton Methods for Nonsmooth Equations , 1992, Math. Oper. Res..

[13]  Liqun Qi,et al.  Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations , 1993, Math. Oper. Res..

[14]  Carl Tim Kelley Identification of the Support of Nonsmoothness , 1994 .

[15]  Jorge J. Moré,et al.  The Levenberg-Marquardt algo-rithm: Implementation and theory , 1977 .

[16]  L. Qi,et al.  An Iterative Method for the Minimax Problem , 1995 .

[17]  Roger Fletcher,et al.  An algorithm for solving linearly constrained optimization problems , 1972, Math. Program..

[18]  Liqun Qi,et al.  A nonsmooth version of Newton's method , 1993, Math. Program..

[19]  Wenyu Sun,et al.  A trust region method for conic model to solve unconstraind optimizaions , 1996 .

[20]  Wenyu Sun Newton's method and quasi-Newton - SQP method for general LC1 constrained optimization , 1998, Appl. Math. Comput..