Two derivative-free methods for solving underdetermined nonlinear systems of equations

In this paper, two different approaches to solve underdetermined nonlinear system of equations are proposed. In one of them, the derivative-free method defined by La Cruz, Martinez and Raydan for solving square nonlinear systems is modified and extended to cope with the underdetermined case. The other approach is a Quasi-Newton method that uses the Broyden update formula and the globalized line search that combines the strategy of Grippo, Lampariello and Lucidi with the Li and Fukushima one. Global convergence results for both methods are proved and numerical experiments are presented.

[1]  Nataša Krejić,et al.  An interior-point method for solving box-constrained underdetermined nonlinear systems , 2005 .

[2]  Nicholas I. M. Gould,et al.  Nonlinear programming without a penalty function or a filter , 2010, Math. Program..

[3]  L. Grippo,et al.  A nonmonotone line search technique for Newton's method , 1986 .

[4]  M. Powell.  The NEWUOA software for unconstrained optimization without derivatives , 2006 .

[5]  Nélida E. Echebest,et al.  Incomplete oblique projections for solving large inconsistent linear systems , 2007, Math. Program..

[6]  Masao Fukushima,et al.  Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions , 2002, Optim. Methods Softw..

[7]  José Mario Martínez,et al.  Globally Convergent Inexact Quasi-Newton Methods for Solving Nonlinear Systems , 2003, Numerical Algorithms.

[8]  J. B. Rosen.  TWO-PHASE ALGORITHM FOR NONLINEAR CONSTRAINT PROBLEMS11This research was supported in part by the National Science Foundation grant MCS 76-23311. Support by the Systems Optimization Lab, Department of Operations Research, Stanford University, during the author's sabbatical leave, is also gratefully , 1978 .

[9]  J. B. Rosen.  The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints , 1960 .

[10]  José Mario Martínez,et al.  Quasi-inexact-Newton methods with global convergence for solving constrained nonlinear systems , 1997 .

[11]  José Mario Martínez,et al.  Two-Phase Model Algorithm with Global Convergence for Nonlinear Programming , 1998 .

[12]  J. B. Rosen.  The gradient projection method for nonlinear programming: Part II , 1961 .

[13]  Klaus Schittkowski,et al.  More test examples for nonlinear programming codes , 1981 .

[14]  Mordecai Avriel,et al.  Properties of the sequential gradient-restoration algorithm (SGRA), part 1: Introduction and comparison with related methods , 1989 .

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

[16]  J. C. Heideman,et al.  Sequential gradient-restoration algorithm for the minimization of constrained functions—Ordinary and conjugate gradient versions , 1969 .

[17]  Francisco A. M. Gomes,et al.  Dynamic Control of Infeasibility in Equality Constrained Optimization , 2008, SIAM J. Optim..

[18]  Mordecai Avriel,et al.  Properties of the sequential gradient-restoration algorithm (SGRA), part 2: Convergence analysis , 1989 .

[19]  Edward Michael Sims.  Sequential gradient-restoration algorithm for mathematical programming problems with inequality constraints , 1983 .

[20]  J. M. Martínez,et al.  Inexact-Restoration Algorithm for Constrained Optimization1 , 2000 .

[21]  P. Stark.  Bounded-Variable Least-Squares: an Algorithm and Applications , 2008 .

[22]  M. Fukushima,et al.  A derivative-free line search and global convergence of Broyden-like method for nonlinear equations , 2000 .

[23]  José Mario Martínez,et al.  Spectral residual method without gradient information for solving large-scale nonlinear systems of equations , 2006, Math. Comput..

[24]  J. M. Martínez,et al.  Inexact-Restoration Method with Lagrangian Tangent Decrease and New Merit Function for Nonlinear Programming , 2001 .

[25]  A. V. Levy,et al.  Modifications and extensions of the conjugate gradient-restoration algorithm for mathematical programming problems , 1971 .

[26]  Klaus Schittkowski,et al.  Test examples for nonlinear programming codes , 1980 .

[27]  H. Walker,et al.  Least-change secant update methods for undetermined systems , 1990 .