New constrained optimization reformulation of complementarity problems

DOI10.1023/A:1022627217515zbMath0907.90260MaRDI QIDQ1264991

Andreas Fischer

Publication date: 11 February 1999

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

zbMATH Keywords

convex optimizationcomplementarity problemsstationary pointsreformulation as constrained minimization problems

Mathematics Subject Classification ID

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

Related Items (10)

An almost smooth equation reformulation to the nonlinear complementarity problem and Newton's method ⋮ A descent algorithm for generalized complementarity problems based on generalized Fischer-Burmeister functions ⋮ Recurrent neural network model based on projective operator and its application to optimization problems ⋮ On minimizing some merit functions for nonlinear complementarity problems under \(H\) -differentiability ⋮ An application of \(H\)-differentiability to nonnegative and unrestricted generalized complementarity problems ⋮ Smoothing Levenberg-Marquardt method for general nonlinear complementarity problems under local error bound ⋮ Active-set projected trust-region algorithm for box-constrained nonsmooth equations ⋮ Reference variable methods of solving min-Max optimization problems ⋮ Convergence analysis of a trust-region multidimensional filter method for 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
• Unnamed Item
• Unnamed Item
• NE/SQP: A robust algorithm for the nonlinear complementarity problem
• Gauss-Newton methods for the complementarity problem
• Nonlinear complementarity as unconstrained and constrained minimization
• Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
• A new trust region algorithm for bound constrained minimization
• An unconstrained optimization technique for large-scale linearly constrained convex minimization problems
• Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
• Solution of monotone complementarity problems with locally Lipschitzian functions
• A semismooth equation approach to the solution of nonlinear complementarity problems
• New NCP-functions and their properties
• On the resolution of monotone complementarity problems
• Solution of linear complementarity problems using minimization with simple bounds
• On stationary points of the implicit Lagrangian for nonlinear complementarity problems
• A Newton-type method for positive-semidefinite linear complementarity problems
• Nonlinear complementarity as unconstrained optimization
• Local uniqueness and convergence of iterative methods for nonsmooth variational inequalities
• Unconstrained minimization approaches to nonlinear complementarity problems
• A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
• A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
• Optimization and nonsmooth analysis
• Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
• Equivalence of the Complementarity Problem to a System of Nonlinear Equations
• A special newton-type optimization method
• A Class of penalty functions for optimization problema with bound constraints
• An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
• Global Methods for Nonlinear Complementarity Problems
• A Positive Algorithm for the Nonlinear Complementarity Problem
• OPTIMIZATION BASED GLOBALLY CONVERGENT METHODS FOR THE NONLINEAR COMPLEMENTARITY PROBLEM
• Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach

This page was built for publication: New constrained optimization reformulation of complementarity problems