On unconstrained and constrained stationary points of the implicit Lagrangian

DOI10.1023/A:1022688013571zbMath0914.90249MaRDI QIDQ1364220

Christian Kanzow, Francisco Facchinei

Publication date: 11 November 1997

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

stationary point; nonlinear complementarity; implicit Lagrangian

Mathematics Subject Classification ID

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

Related Items

Active-set projected trust-region algorithm for box-constrained nonsmooth equations, Properties of restricted NCP functions for nonlinear complementarity problems, Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities, Stationary points of bound constrained minimization reformulations of complementarity problems, New NCP-functions and their properties, Unconstrained minimization approaches to nonlinear complementarity problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• NE/SQP: A robust algorithm for the nonlinear complementarity problem
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• Nonlinear complementarity as unconstrained and constrained minimization
• Unconstrained optimization reformulations of variational inequality problems
• A semismooth equation approach to the solution of nonlinear complementarity problems
• On the resolution of monotone complementarity problems
• On stationary points of the implicit Lagrangian for nonlinear complementarity problems
• Nonlinear complementarity as unconstrained optimization
• Convergence of Trust Region Algorithms for Optimization with Bounds when Strict Complementarity Does Not Hold
• Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds