The Lagrangian Globalization Method for Nonsmooth Constrained Equations
- 1 January 2006
- journal article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 33 (1) , 89-109
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- On the Convergence of a Trust-Region Method for Solving Constrained Nonlinear Equations with Degenerate SolutionsJournal of Optimization Theory and Applications, 2004
- Active-Set Projected Trust-Region Algorithm for Box-Constrained Nonsmooth EquationsJournal of Optimization Theory and Applications, 2004
- An affine scaling trust-region approach to bound-constrained nonlinear systemsApplied Numerical Mathematics, 2003
- A feasible semismooth asymptotically Newton method for mixed complementarity problemsMathematical Programming, 2002
- A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple BoundsSIAM Journal on Optimization, 2002
- A Probability-One Homotopy Algorithm for Nonsmooth Equations and Mixed Complementarity ProblemsSIAM Journal on Optimization, 2002
- Nonmonotone Trust-Region Methods for Bound-Constrained Semismooth Equations with Applications to Nonlinear Mixed Complementarity ProblemsSIAM Journal on Optimization, 2001
- A Potential Reduction Newton Method for Constrained EquationsSIAM Journal on Optimization, 1999
- NE/SQP: A robust algorithm for the nonlinear complementarity problemMathematical Programming, 1993
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple BoundsSIAM Journal on Numerical Analysis, 1991