论文信息 - Trust Region Algorithms for Nonlinear Equations

Trust Region Algorithms for Nonlinear Equations

In this paper, we consider the problem of solving nonlinear equations F (x) = 0, where F (x) from < n to < m is continuously diierentiable. We study a class of general trust region algorithms for solving nonlinear equation by minimizing a given norm jjF(x)jj. The trust region algorithm for nonlinear equations can be viewed as an extension of the Levenberg-Marquardt algorithm for nonlinear least squares. Global convergence of trust region algorithms for nonlinear equations are studied and local convergence analyses are also given.

Ya-Xiang Yuan | Ya-xiang Yuan

[1] R. Fletcher,et al. Second order corrections for non-differentiable optimization , 1982 .

[2] Thomas F. Coleman,et al. Computing a Trust Region Step for a Penalty Function , 1990, SIAM J. Sci. Comput..

[3] R. Fletcher. A model algorithm for composite nondifferentiable optimization problems , 1982 .

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

[5] M. Powell. A New Algorithm for Unconstrained Optimization , 1970 .

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

[7] R. Tapia,et al. A Global Convergence Theory for Arbitrary Norm Trust-Region Methods for Nonlinear Equations , 1995 .

[8] J. Nocedal,et al. The use of linear programming for the solution of sparse sets of nonlinear equations , 1987 .

[9] Kenneth Levenberg. A METHOD FOR THE SOLUTION OF CERTAIN NON – LINEAR PROBLEMS IN LEAST SQUARES , 1944 .