The Convergence of a Levenberg–Marquardt Method for Nonlinear Inequalities

REFERENCES

• P. Amaral and P. Barahona ( 2005 ). Connections between the total least squares and the correction of an infeasible system of linear inequalities . Linear Algebra Appl. 395 : 191 – 210 .
   Web of Science ®Google Scholar
• P. Amaral , M.W. Trosset , and P. Barahona ( 2000 ). Correcting an inconsistent system of linear inequalities by nonlinear programming. Department of Computational and Applied Mathematics , Rice University , Houston , TX .
   Google Scholar
• P. Amaral and P. Barahona ( 1999 ). About infeasibility in the constraints of a linear model . Ricerca Operativa 92 : 49 – 67 .
   Google Scholar
• R. Bhatia ( 1997 ). Matrix Analysis . Springer-Verlag , New York .
   Google Scholar
• R. Bramley and B. Winnicka ( 1996 ). Solving linear inequalities in a least squares sense . SIAM J. Sci. Comput. 17 : 275 – 286 .
   Google Scholar
• J. Burke and S. Xu ( 1998 ). The global linear convergence of a non-interior path-following algorithm for linear complementarity problems . Math. Oper. Res. 23 : 719 – 734 .
   Web of Science ®Google Scholar
• Y. Censor and S.A. Zenios ( 1997 ). Parallel Optimization: Theory, Algorithms and Applications . Oxford University Press , New York .
   Google Scholar
• B. Chen and P.T. Harker ( 1993 ). A noninterior continuation method for quadratic and linear programming . SIAM J. Optim. 3 : 503 – 515 .
   Google Scholar
• C. Chen and O.L. Mangasarian ( 1996 ). A class of smoothing functions for nonlinear and mixed complementarity problems . Comput. Optim. Appl. 5 : 97 – 138 .
   Google Scholar
• X. Chen and P. Tseng ( 2003 ). Non-interior continuation methods for solving semidefinite complementarity problems . Math. Program. 95 : 431 – 474 .
   Web of Science ®Google Scholar
• X.J. Chen , L. Qi , and D. Sun ( 1998 ). Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities . Math. Comput. 67 : 519 – 540 .
   Web of Science ®Google Scholar
• X.J. Chen and Y. Ye ( 1999 ). On homotopy-smoothing methods for variational inequalities . SIAM J. Control Optim. 37 : 589 – 616 .
   Web of Science ®Google Scholar
• F.H. Clarke ( 1983 ). Optimization and Nonsmooth Analysis . Wiley , New York .
   Google Scholar
• J.W. Daniel ( 1973 ). Newton's method for nonlinear inequalities . Numer. Math. 21 : 381 – 387 .
   Web of Science ®Google Scholar
• T. De Luca , F. Facchinei , and C. Kanzow ( 1996 ). A semismooth equation approach to the solution of nonlinear complementarity problems . Math. Program. 75 : 407 – 439 .
   Web of Science ®Google Scholar
• J.E. Dennis , H.J. Martinez , and R.A. Tapia ( 1989 ). Convergence theory for the structured BFGS secant method with an application to nonlinear least squares . J. Optim. Theory Appl. 61 : 161 – 178 .
   Web of Science ®Google Scholar
• S. Engelke and C. Kanzow ( 2002 ). Predictor-corrector smoothing methods for linear programs with a more flexible update of the smoothing parameter . Comput. Optim. Appl. 23 : 299 – 320 .
   Web of Science ®Google Scholar
• A. Fischer ( 1997 ). Solution of monotone complementarity problems with locally Lipschitzian functions . Math. Program. 76 : 513 – 532 .
   Web of Science ®Google Scholar
• M. Fukushima and J.-S. Pang ( 1999 ). Convergence of a smoothing continuation method for mathematical programs with complementarity constraints. in Ill-Posed Variational Problems and Regularization Techniques. Lecture Notes in Economics and Mathematical Systems, Vol. 477 (M. Thera and R. Tichatschke, eds.), Springer-Verlag, Berlin/Heidelberg , pp. 99 – 110 .
   Google Scholar
• S.-P. Han ( 1980 ). Least-square solution of linear inequalities. Technique Report TR-2141, Mathematics Research Center, University of Wisconsin-Madison .
   Google Scholar
• Z.H. Huang and J. Han ( 2003 ). A non-interior continuation method for solving the monotone semidefinite complementarity problem . Appl. Math. Optim. 47 : 195 – 211 .
   Web of Science ®Google Scholar
• Z.H. Huang , J. Han , and Z. Chen ( 2003 ). A predictor-corrector smoothing Newton algorithm, based on a new smoothing function, for solving the nonlinear complementarity problem with a P 0 function . J. Optim. Theory Appl. 117 : 39 – 68 .
   Web of Science ®Google Scholar
• Z.H. Huang , L. Qi , and D. Sun ( 2004 ). Sub-quadratic convergence of a smoothing Newton algorithm for the P 0 − and monotone LCP . Math. Program. 99 : 423 – 441 .
   Web of Science ®Google Scholar
• H. Jiang and D. Ralph (2000). Smooth SQP methods for mathematical programs with nonlinear complementarity constraints. SIAM J. Optim. 10:779–808.
   Web of Science ®Google Scholar
• C. Kanzow ( 1996 ). Some noninterior continuation methods for linear complementarity problems . SIAM J. Matrix Anal. Appl. 17 : 851 – 868 .
   Web of Science ®Google Scholar
• C. Kanzow and C. Nagel ( 2002 ). Semidefinite programs: New search directions, smooth-type methods, and numerical results . SIAM J. Optim. 13 : 1 – 23 .
   Web of Science ®Google Scholar
• K. Levenberg ( 1944 ). A method for the solution of certain nonlinear problems in least squares . Quart. Appl. Math. 2 : 164 – 166 .
   Google Scholar
• Z.Q. Luo and T. Tseng ( 1997 ). A new class merit functions for the nonlinear complementarity problems . in Complementarity and Variational Problems: State of the Art ( M.C. Ferris and J.-S. Pang , eds.), SIAM , Philadelphia , pp. 204 – 225 .
   Google Scholar
• D.W. Marquardt ( 1963 ). An algorithm for least-squares estimation for nonlinear parameters . SIAM J. Appl. Math. 11 : 431 – 441 .
   Web of Science ®Google Scholar
• D.Q. Mayne , E. Polak , and A.J. Heunis ( 1981 ). Solving nonlinear inequalities in a finite number of iterations . J. Optim. Theory Appl. 33 : 207 – 221 .
   Web of Science ®Google Scholar
• R. Mifflin ( 1977 ). Semismooth and semiconvex functions in constrained optimization . SIAM J. Control Optim. 15 : 957 – 972 .
   Web of Science ®Google Scholar
• M.C. Pinar ( 1996 ). Newton method for linear inequality systems . Eur. J. Oper. Res. 107 : 710 – 719 .
   Google Scholar
• M.C. Pinar and B. Chen ( 1999 ). l 1 solution of linear inequalities . IMA J. Numer. Anal. 19 : 19 – 37 .
   Google Scholar
• L. Qi and H. Jiang ( 1997 ). Semismooth Karush-Kuhn-Tucker equations and convergence analysis of Newton methods and quasi-Newton methods for solving these equations . Math. Oper. Res. 22 : 301 – 325 .
   Web of Science ®Google Scholar
• L. Qi and J. Sun ( 1993 ). A nonsmooth version of Newton's method . Math. Program. 58 : 353 – 367 .
   Web of Science ®Google Scholar
• M. Sahba ( 1985 ). On the solution of nonlinear inequalities in a finite number of iterations . Numer. Math. 46 : 229 – 236 .
   Web of Science ®Google Scholar
• A.A. Vatolin ( 1986 ). Parametric approximation of inconsistent systems of linear inequalities . Seminarber 81 : 145 – 154 .
   Google Scholar
• M.A. Wolfe ( 1978 ). Numerical Methods for Unconstrained Optimization . Van Nostrand Reinhold , New York .
   Google Scholar
• H. Yabe and T. Takahashi ( 1991 ). Factorized quasi-Newton methods for nonlinear least squares problems . Math. Program. 51 : 75 – 100 .
   Web of Science ®Google Scholar
• H. Yin and J. Zhang ( 2006 ). Global convergence of a smooth approximation method for mathematical programs with complementarity constraints . Math. Methods Oper. Res. 64 : 255 – 269 .
   Google Scholar
• I. Zang ( 1980 ). A smoothing-out technique for min-max optimization . Math. Program. 19 : 61 – 71 .
   Web of Science ®Google Scholar
• J. Zhang and L. Chen ( 1997 ). Nonmonotone Levenberg-Marquardt algorithms and their convergence analysis . J. Optim. Theory Appl. 92 : 393 – 418 .
   Web of Science ®Google Scholar
• J. Zhang , L. Chen , and N. Deng ( 2000 ). A family of scaled factorized Broyden-like methods for nonlinear least squares problems . SIAM J. Optim. 10 : 1163 – 1179 .
   Google Scholar