Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints

DOI10.1023/A:1008656806889zbMath1040.90560OpenAlexW1720757687MaRDI QIDQ1294821

Masao Fukushima, Jong-Shi Pang

Publication date: 1999

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

Full work available at URL: https://doi.org/10.1023/a:1008656806889

zbMATH Keywords

mathematical programs with equilibrium constraintsstationarity conditions

Mathematics Subject Classification ID

Hierarchical games (including Stackelberg games) (91A65) Optimality conditions and duality in mathematical programming (90C46) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (53)

A pivoting algorithm for linear programming with linear complementarity constraints ⋮ Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints ⋮ Price-coupling games and the generation expansion planning problem ⋮ A Sequential Smooth Penalization Approach to Mathematical Programs with Complementarity Constraints ⋮ Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications ⋮ Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints ⋮ Relaxation approach for equilibrium problems with equilibrium constraints ⋮ Global convergence of a smooth approximation method for mathematical programs with complementarity constraints ⋮ Constraint qualifications and optimality conditions for optimization problems with cardinality constraints ⋮ Unnamed Item ⋮ A relaxed constant positive linear dependence constraint qualification for mathematical programs with equilibrium constraints ⋮ Three modeling paradigms in mathematical programming ⋮ A smoothing SAA method for a stochastic mathematical program with complementarity constraints. ⋮ Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints ⋮ Comparison of optimality systems for the optimal control of the obstacle problem ⋮ Algorithms for linear programming with linear complementarity constraints ⋮ On approximate stationary points of the regularized mathematical program with complementarity constraints ⋮ New relaxation method for mathematical programs with complementarity constraints ⋮ A log-exponential smoothing method for mathematical programs with complementarity constraints ⋮ A smoothing method for zero--one constrained extremum problems ⋮ Review of formulations for structural and mechanical system optimization ⋮ Computing B-Stationary Points of Nonsmooth DC Programs ⋮ On estimating the regular normal cone to constraint systems and stationarity conditions ⋮ On linear programs with linear complementarity constraints ⋮ Unnamed Item ⋮ On the Guignard constraint qualification for mathematical programs with equilibrium constraints ⋮ Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications ⋮ Mathematical programs with complementarity constraints in Banach spaces ⋮ New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints ⋮ New branch-and-Cut algorithm for bilevel linear programming ⋮ An overview of bilevel optimization ⋮ Abadie-type constraint qualification for mathematical programs with equilibrium constraints ⋮ Active set algorithm for mathematical programs with linear complementarity constraints ⋮ A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience ⋮ A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints ⋮ Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints ⋮ A modified relaxation scheme for mathematical programs with complementarity constraints ⋮ Partial augmented Lagrangian method and mathematical programs with complementarity constraints ⋮ Goal and predictive coordination in two level hierarchical systems ⋮ Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators ⋮ On Efficiency Conditions for Nonsmooth Vector Equilibrium Problems with Equilibrium Constraints ⋮ Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints ⋮ A smoothing augmented Lagrangian method for solving simple bilevel programs ⋮ Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints ⋮ On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints ⋮ Optimal control problems with control complementarity constraints: existence results, optimality conditions, and a penalty method ⋮ Convergence of an Inexact Smoothing Method for Mathematical Programs with Equilibrium Constraints ⋮ Optimality conditions for bilevel programming problems ⋮ Some results on mathematical programs with equilibrium constraints ⋮ On M-stationary points for mathematical programs with equilibrium constraints ⋮ Dynamic programming approach to discrete time dynamic feedback Stackelberg games with independent and dependent followers ⋮ Dynamic Stackelberg games under open-loop complete information ⋮ The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited

This page was built for publication: Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints