MPEC Methods for Bilevel Optimization Problems
From MaRDI portal
Publication:5014634
DOI10.1007/978-3-030-52119-6_12zbMath1481.90291OpenAlexW3107465411MaRDI QIDQ5014634
Youngdae Kim, Sven Leyffer, Todd S. Munson
Publication date: 8 December 2021
Published in: Bilevel Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-52119-6_12
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Duality results for interval-valued semiinfinite optimization problems with equilibrium constraints using convexificators, Focus programming: a bi‐level programming approach to static stochastic optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Modeling Language for Mathematical Programming
- On the solution of convex bilevel optimization problems
- Solving linear bilevel multiobjective programming problem via exact penalty function approach
- A bundle-free implicit programming approach for a class of elliptic MPECs in function space
- On linear programs with linear complementarity constraints
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
- Constraint qualifications for mathematical programs with equilibrium constraints and their local preservation property
- Enhanced Karush-Kuhn-Tucker conditions for mathematical programs with equilibrium constraints
- Feasible method for generalized semi-infinite programming
- Three modeling paradigms in mathematical programming
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Generalized stationary points and an interior-point method for mathematical programs with equilibrium constraints.
- Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints
- Bilevel programming: a survey
- Interior-point algorithms, penalty methods and equilibrium problems
- Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties
- Multiobjective bilevel optimization
- Global solution of bilevel programs with a nonconvex inner program
- Convex two-level optimization
- Partitioning procedures for solving mixed-variables programming problems
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- OPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints
- Practical bilevel optimization. Algorithms and applications
- Bilevel and multilevel programming: A bibliography review
- Robust discrete optimization and its applications
- Logic-based Benders decomposition
- On the global convergence of an SLP-filter algorithm that takes EQP steps
- Bi-level strategies in semi-infinite programming.
- Foundations of bilevel programming
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints
- A polyhedral branch-and-cut approach to global optimization
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Solving bilevel programs with the KKT-approach
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- On the solution of a minimum weight elastoplastic problem involving displacement and complementarity constraints
- Nonlinear programming and nonsmooth optimization by successive linear programming
- Necessary optimality condition for trilevel optimization problem
- Second order sufficient conditions for a class of bilevel programs with lower level second-order cone programming problem
- On convex quadratic programs with linear complementarity constraints
- The models of bilevel programming with lower level second-order cone programs
- Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs
- Abadie-type constraint qualification for mathematical programs with equilibrium constraints
- A robust SQP method for mathematical programs with linear complementarity constraints
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints
- A pivoting algorithm for linear programming with linear complementarity constraints
- New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
- Optimality Conditions for Disjunctive Programs Based on Generalized Differentiation with Application to Mathematical Programs with Equilibrium Constraints
- Branching and bounds tighteningtechniques for non-convex MINLP
- A direct proof for M-stationarity under MPEC-GCQ for mathematical programs with equilibrium constraints
- Complementarity constraints as nonlinear equations: Theory and numerical experience
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- Steering exact penalty methods for nonlinear programming
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Relaxation-Based Bounds for Semi-Infinite Programs
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- Nonconvex Structures in Nonlinear Programming
- Strongly Regular Generalized Equations
- New Branch-and-Bound Rules for Linear Bilevel Programming
- A New Approach to Lagrange Multipliers
- The Theory of Moral Hazard and Unobservable Behaviour: Part I
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- Some properties of regularization and penalization schemes for MPECs
- Solving mathematical programs with complementarity constraints as nonlinear programs
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Global Convergence of Augmented Lagrangian Methods Applied to Optimization Problems with Degenerate Constraints, Including Problems with Complementarity Constraints
- Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints
- Necessary optimality conditions in pessimistic bilevel programming
- The Mixed Integer Linear Bilevel Programming Problem
- KKT Reformulation and Necessary Conditions for Optimality in Nonsmooth Bilevel Optimization
- The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
- Pessimistic Bilevel Optimization
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs)
- On Using the Elastic Mode in Nonlinear Programming Approaches to Mathematical Programs with Complementarity Constraints
- Global Convergence of an Elastic Mode Approach for a Class of Mathematical Programs with Complementarity Constraints
- A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints
- An Implicit Programming Approach for a Class of Stochastic Mathematical Programs with Complementarity Constraints
- Interior Methods for Mathematical Programs with Complementarity Constraints
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Optimality conditions for mixed discrete bilevel optimization problems
- Mathematical Programs with Equilibrium Constraints