Solving mathematical programs with equilibrium constraints

DOI10.1007/s10957-014-0699-zzbMath1327.90233OpenAlexW2023446959MaRDI QIDQ493259

Jane J. Ye, Lei Guo, Gui-Hua Lin

Publication date: 3 September 2015

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

Full work available at URL: https://doi.org/10.1007/s10957-014-0699-z

zbMATH Keywords

error boundmathematical program with equilibrium constraintsLevenberg-Marquardt methodClarke/Mordukhovich/Strong stationarity

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (25)

On bilevel programs with a convex lower-level problem violating Slater's constraint qualification ⋮ Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators ⋮ Optimality conditions, approximate stationarity, and applications – a story beyond lipschitzness ⋮ Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems ⋮ MPCC strategies for nonsmooth nonlinear programs ⋮ Bilevel programming approaches to production planning for multiple products with short life cycles ⋮ Single-level reformulations of a specific non-smooth bilevel programming problem and their applications ⋮ On approximate stationary points of the regularized mathematical program with complementarity constraints ⋮ A modified Levenberg-Marquardt method for solving system of nonlinear equations ⋮ A modified inexact Levenberg-Marquardt method with the descent property for solving nonlinear equations ⋮ Improved Convergence Properties of the Relaxation Schemes of Kadrani et al. and Kanzow and Schwartz for MPEC ⋮ A primal nonsmooth reformulation for bilevel optimization problems ⋮ A globally convergent neurodynamics optimization model for mathematical programming with equilibrium constraints ⋮ Saddle point optimality criteria for mathematical programming problems with equilibrium constraints ⋮ Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators ⋮ A bicriteria perspective on \(L\)-penalty approaches -- a corrigendum to Siddiqui and Gabriel's \(L\)-penalty approach for solving MPECs ⋮ Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems ⋮ On strong KKT type sufficient optimality conditions for nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints ⋮ Convexification method for bilevel programs with a nonconvex Follower's problem ⋮ Duality for nonsmooth mathematical programming problems with equilibrium constraints ⋮ Local convergence of the Levenberg-Marquardt method under Hölder metric subregularity ⋮ Improved convergence results for a modified Levenberg–Marquardt method for nonlinear equations and applications in MPCC ⋮ Reformulation of the M-Stationarity Conditions as a System of Discontinuous Equations and Its Solution by a Semismooth Newton Method ⋮ A Short State of the Art on Multi-Leader-Follower Games ⋮ Bilevel hyperparameter optimization for support vector classification: theoretical analysis and a solution method

Uses Software

• levmar

Cites Work

• Unnamed Item
• Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
• Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
• Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
• Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
• A unified local convergence analysis of inexact constrained Levenberg-Marquardt methods
• On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
• Partial augmented Lagrangian method and mathematical programs with complementarity constraints
• Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
• Sensitivity Analysis of the Value Function for Parametric Mathematical Programs with Equilibrium Constraints
• Parametric Nonlinear Programming Problems under the Relaxed Constant Rank Condition
• Exact Penalization of Mathematical Programs with Equilibrium Constraints
• Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
• Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
• First-Order and Second-Order Conditions for Error Bounds
• Stability Analysis for Parametric Mathematical Programs with Geometric Constraints and Its Applications
• Mathematical Programs with Geometric Constraints in Banach Spaces: Enhanced Optimality, Exact Penalty, and Sensitivity
• Lower-order penalty methods for mathematical programs with complementarity constraints
• Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
• Mathematical Programs with Equilibrium Constraints

This page was built for publication: Solving mathematical programs with equilibrium constraints