Partial exact penalty for mathematical programs with equilibrium constraints

DOI10.1007/s11228-008-0095-7zbMath1170.65052OpenAlexW1993863961MaRDI QIDQ1005142

Jiaping Zhu, Jane Ye, Guo-shan Liu

Publication date: 16 March 2009

Published in: Set-Valued Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11228-008-0095-7

zbMATH Keywords

algorithmglobal convergencemathematical program with equilibrium constraintssmoothing algorithmMangasarian-Fromovitz constraint qualificationcomplementarity constraintM-stationary pointsMordukhovich-stationary pointpartial exact penalization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Related Items (14)

Partial Error Bound Conditions and the Linear Convergence Rate of the Alternating Direction Method of Multipliers ⋮ Generic Property of the Partial Calmness Condition for Bilevel Programming Problems ⋮ A relaxed constant positive linear dependence constraint qualification for mathematical programs with equilibrium constraints ⋮ On parametric vector optimization via metric regularity of constraint systems ⋮ On mathematical programs with equilibrium constraints under data uncertainty ⋮ On quasidifferentiable mathematical programs with equilibrium constraints ⋮ Lifted stationary points of sparse optimization with complementarity constraints ⋮ Evolution differential inclusion with projection for solving constrained nonsmooth convex optimization in Hilbert space ⋮ A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function ⋮ New Constraint Qualifications for S-Stationarity for MPEC with Nonsmooth Objective ⋮ Smoothing partial exact penalty splitting method for mathematical programs with equilibrium constraints ⋮ Approximating stationary points of stochastic mathematical programs with equilibrium constraints via sample averaging ⋮ Coupled versus decoupled penalization of control complementarity constraints ⋮ A LOCALLY SMOOTHING METHOD FOR MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS

Cites Work

• Unnamed Item
• Unnamed Item
• Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
• A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints
• A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
• Foundations of bilevel programming
• Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
• Merit-function piecewise SQP algorithm for mathematical programs with equilibrium constraints
• Optimization and nonsmooth analysis
• Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
• Exact Penalization of Mathematical Programs with Equilibrium Constraints
• Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
• Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
• First-Order and Second-Order Conditions for Error Bounds
• Optimality Conditions for Optimization Problems with Complementarity Constraints
• Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets
• The nonlinear bilevel programming problem:formulations,regularity and optimality conditions
• Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints
• Global Convergence of an Elastic Mode Approach for a Class of Mathematical Programs with Complementarity Constraints
• Non-Linear Programming Via Penalty Functions
• A new extreme point algorithm and its application in PSQP algorithms for solving mathematical programs with linear complementarity constraints.

This page was built for publication: Partial exact penalty for mathematical programs with equilibrium constraints