Convexification method for bilevel programs with a nonconvex Follower's problem
From MaRDI portal
Publication:2031936
DOI10.1007/s10957-020-01804-9zbMath1469.90112OpenAlexW3118514307MaRDI QIDQ2031936
Publication date: 15 June 2021
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-020-01804-9
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Solving mathematical programs with equilibrium constraints
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- A smoothing method for mathematical programs with equilibrium constraints
- Practical bilevel optimization. Algorithms and applications
- Stability of regularized bilevel programming problems
- New NCP-functions and their properties
- Foundations of bilevel programming
- On bilevel programs with a convex lower-level problem violating Slater's constraint qualification
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Solving bilevel programs with the KKT-approach
- Deterministic global optimization. Theory, methods and applications
- On solving simple bilevel programs with a nonconvex lower level program
- An overview of bilevel optimization
- Sensitivity Analysis of the Value Function for Parametric Mathematical Programs with Equilibrium Constraints
- On calmness conditions in convex bilevel programming
- New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
- On the numerical solution of a class of Stackelberg problems
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- The Theory of Moral Hazard and Unobservable Behaviour: Part I
- A note on optimality conditions for bilevel programming problems∗
- Optimality Conditions for Optimization Problems with Complementarity Constraints
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Semivectorial bilevel programming versus scalar bilevel programming
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
- Point-to-Set Maps in Mathematical Programming
- Mathematical Programs with Equilibrium Constraints
