How Stringent is the Linear Independence Assumption for Mathematical Programs with Complementarity Constraints?
From MaRDI portal
Publication:5704058
DOI10.1287/moor.26.4.851.10007zbMath1082.90580OpenAlexW2149048932MaRDI QIDQ5704058
Michael Stöhr, Stefan Scholtes
Publication date: 11 November 2005
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.26.4.851.10007
Optimality conditions and duality in mathematical programming (90C46) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Methods of successive quadratic programming type (90C55)
Related Items (33)
Smoothing and regularization strategies for optimization of hybrid dynamic systems ⋮ A Sequential Smooth Penalization Approach to Mathematical Programs with Complementarity Constraints ⋮ Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints ⋮ Global convergence of a smooth approximation method for mathematical programs with complementarity constraints ⋮ Generic Property of the Partial Calmness Condition for Bilevel Programming Problems ⋮ Qualification Conditions in Semialgebraic Programming ⋮ A penalty method for nonlinear programs with set exclusion constraints ⋮ Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties ⋮ On M-stationarity conditions in MPECs and the associated qualification conditions ⋮ Global Dynamical Solvers for Nonlinear Programming Problems ⋮ Critical sets in one-parametric mathematical programs with complementarity constraints ⋮ Feedback stabilization methods for the solution of nonlinear programming problems ⋮ Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming ⋮ An interior point technique for solving bilevel programming problems ⋮ Newton-type methods for constrained optimization with nonregular constraints ⋮ Unnamed Item ⋮ Characterization of strong stability for C-stationary points in MPCC ⋮ Solving bilevel programs with the KKT-approach ⋮ Unnamed Item ⋮ Enhanced Karush-Kuhn-Tucker conditions for mathematical programs with equilibrium constraints ⋮ Is bilevel programming a special case of a mathematical program with complementarity constraints? ⋮ Newton-type method for a class of mathematical programs with complementarity constraints ⋮ On attraction of Newton-type iterates to multipliers violating second-order sufficiency conditions ⋮ Penalty and relaxation methods for the optimal placement and operation of control valves in water supply networks ⋮ Hybrid approach with active set identification for mathematical programs with complementarity constraints ⋮ Partial augmented Lagrangian method and mathematical programs with complementarity constraints ⋮ A smoothing heuristic for a bilevel pricing problem ⋮ A robust SQP method for mathematical programs with linear complementarity constraints ⋮ Necessary Optimality Conditions for Optimal Control Problems with Equilibrium Constraints ⋮ Directional Quasi-/Pseudo-Normality as Sufficient Conditions for Metric Subregularity ⋮ Genericity Analysis of Multi-Leader-Disjoint-Followers Game ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Bilevel Methods for Image Reconstruction
This page was built for publication: How Stringent is the Linear Independence Assumption for Mathematical Programs with Complementarity Constraints?
