On unconstrained and constrained stationary points of the implicit Lagrangian
From MaRDI portal
Publication:1364220
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)
Related Items
A descent algorithm for generalized complementarity problems based on generalized Fischer-Burmeister functions ⋮ Stationary points of bound constrained minimization reformulations of complementarity problems ⋮ New NCP-functions and their properties ⋮ On minimizing the implicit Lagrangian for nonlinear complementarity problems under \(H\)-differentiability ⋮ A non-interior continuation algorithm for the CP based on a generalized smoothing function ⋮ On minimizing some merit functions for nonlinear complementarity problems under \(H\) -differentiability ⋮ An application of \(H\)-differentiability to nonnegative and unrestricted generalized complementarity problems ⋮ Active-set projected trust-region algorithm for box-constrained nonsmooth equations ⋮ Properties of a family of merit functions and a merit function method for the NCP ⋮ The Lagrangian globalization method for nonsmooth constrained equations ⋮ VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS ⋮ Properties of restricted NCP functions for nonlinear complementarity problems ⋮ Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities ⋮ Unconstrained minimization approaches to nonlinear complementarity problems ⋮ An active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations
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