Solving mathematical programs with equilibrium constraints
From MaRDI portal
Recommendations
- On the solution of mathematical programming problems with equilibrium constraints
- scientific article; zbMATH DE number 1086742
- Notes on some constraint qualifications for mathematical programs with equilibrium constraints
- Globally convergent algorithm for solving stationary points for mathematical programs with complementarity constraints via nonsmooth reformulations
- A superlinear convergent smooth SQP algorithm for mathematical programs with nonlinear equilibrium constraints
Cites work
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- A unified local convergence analysis of inexact constrained Levenberg-Marquardt methods
- Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Exact Penalization of Mathematical Programs with Equilibrium Constraints
- First-Order and Second-Order Conditions for Error Bounds
- Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Lower-order penalty methods for mathematical programs with complementarity constraints
- Mathematical Programs with Equilibrium Constraints
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Mathematical programs with geometric constraints in Banach spaces: enhanced optimality, exact penalty, and sensitivity
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
- Parametric Nonlinear Programming Problems under the Relaxed Constant Rank Condition
- Partial augmented Lagrangian method and mathematical programs with complementarity constraints
- Sensitivity analysis of the value function for parametric mathematical programs with equilibrium constraints
- Stability analysis for parametric mathematical programs with geometric constraints and its applications
Cited in
(31)- scientific article; zbMATH DE number 7297336 (Why is no real title available?)
- Single-level reformulations of a specific non-smooth bilevel programming problem and their applications
- On strong KKT type sufficient optimality conditions for nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints
- A bicriteria perspective on \(L\)-penalty approaches -- a corrigendum to Siddiqui and Gabriel's \(L\)-penalty approach for solving MPECs
- Global algorithm for solving stationary points for equilibrium programs with shared equilibrium constraints
- On bilevel programs with a convex lower-level problem violating Slater's constraint qualification
- Optimality conditions, approximate stationarity, and applications -- a story beyond Lipschitzness
- Convexification method for bilevel programs with a nonconvex Follower's problem
- Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators
- Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems
- Reformulation of the M-stationarity conditions as a system of discontinuous equations and its solution by a semismooth Newton method
- A modified inexact Levenberg-Marquardt method with the descent property for solving nonlinear equations
- A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints
- Duality for nonsmooth mathematical programming problems with equilibrium constraints
- Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators
- Improved convergence properties of the relaxation schemes of Kadrani et al. and Kanzow and Schwartz for MPEC
- Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems
- A short state of the art on multi-leader-follower games
- Bilevel programming approaches to production planning for multiple products with short life cycles
- Saddle point optimality criteria for mathematical programming problems with equilibrium constraints
- Bilevel hyperparameter optimization for support vector classification: theoretical analysis and a solution method
- scientific article; zbMATH DE number 1086742 (Why is no real title available?)
- On the solution of mathematical programming problems with equilibrium constraints
- Solving the set equilibrium problems
- A globally convergent neurodynamics optimization model for mathematical programming with equilibrium constraints.
- Improved convergence results for a modified Levenberg-Marquardt method for nonlinear equations and applications in MPCC
- A primal nonsmooth reformulation for bilevel optimization problems
- A modified Levenberg-Marquardt method for solving system of nonlinear equations
- MPCC strategies for nonsmooth nonlinear programs
- On approximate stationary points of the regularized mathematical program with complementarity constraints
- Local convergence of the Levenberg-Marquardt method under Hölder metric subregularity
This page was built for publication: Solving mathematical programs with equilibrium constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q493259)
