New relaxation method for mathematical programs with complementarity constraints

DOI10.1023/A:1024739508603zbMath1033.90086OpenAlexW2122617831MaRDI QIDQ1407237

Masao Fukushima, Gui-Huan Lin

Publication date: 15 September 2003

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

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

zbMATH Keywords

weak stationaritynondegeneracyupper level strict complementarityM-stationaritysecond-order necessary conditionsB-stationarityC-stationarityMathematical programs with equilibrium constraintslinear independence constraint qualification

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Related Items

Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties, A new smoothing scheme for mathematical programs with complementarity constraints, A globally convergent neurodynamics optimization model for mathematical programming with equilibrium constraints, A three-dimension null-space approach for mathematical programs with equilibrium constraints., Smoothing method for mathematical programs with symmetric cone complementarity constraints, Newton-type method for a class of mathematical programs with complementarity constraints, Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization, A modified relaxation scheme for mathematical programs with complementarity constraints, Hybrid approach with active set identification for mathematical programs with complementarity constraints, New reformulations for stochastic nonlinear complementarity problems, Dynamic programming approach to discrete time dynamic feedback Stackelberg games with independent and dependent followers

Cites Work

• Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints
• A smoothing method for mathematical programs with equilibrium constraints
• A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
• A smoothing method for a mathematical program with P-matrix linear complementarity constraints
• A numerical approach to optimization problems with variational inequality constraints
• Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
• Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
• Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
• Some Feasibility Issues in Mathematical Programs with Equilibrium Constraints
• Exact Penalization of Mathematical Programs with Equilibrium Constraints
• On Optimization Problems with Variational Inequality Constraints
• Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
• The nonlinear bilevel programming problem:formulations,regularity and optimality conditions
• Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
• Mathematical Programs with Equilibrium Constraints