On the solution of convex bilevel optimization problems
From MaRDI portal
Publication:263155
DOI10.1007/S10589-015-9795-8zbMATH Open1343.90065OpenAlexW2157894832MaRDI QIDQ263155FDOQ263155
Publication date: 4 April 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-015-9795-8
Recommendations
- Bilevel optimization: reformulation and first optimality conditions
- Solution of bilevel optimization problems using the KKT approach
- An interior point technique for solving bilevel programming problems
- On a solving bilevel d.c.-convex optimization problems
- scientific article; zbMATH DE number 1329057
bilevel programmingKKT-transformationmathematical programs with equilibrium constraintsoptimal value transformationsolution algorithm
Nonconvex programming, global optimization (90C26) Hierarchical games (including Stackelberg games) (91A65)
Cites Work
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Practical bilevel optimization. Algorithms and applications
- Foundations of bilevel programming
- Title not available (Why is that?)
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- On calmness conditions in convex bilevel programming
- Title not available (Why is that?)
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- New necessary optimality conditions in optimistic bilevel programming
- Global solution of bilevel programs with a nonconvex inner program
- Links between linear bilevel and mixed 0-1 programming problems
- Bi-level strategies in semi-infinite programming.
- On generalized semi-infinite optimization and bilevel optimization
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Solving bilevel programs with the KKT-approach
- Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming
- On local search in d.c. optimization problems
- New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
- Title not available (Why is that?)
- Solution algorithm for an optimistic linear Stackelberg problem
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Theory of Moral Hazard and Unobservable Behaviour: Part I
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
- Optimality conditions for bilevel programming problems
- Bilevel Programming Problems
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Generalized semi-infinite programming: The symmetric reduction ansatz
Cited In (36)
- Solution of bilevel optimization problems using the KKT approach
- On solving simple bilevel programs with a nonconvex lower level program
- Bilevel Optimization as a Regularization Approach to Pseudomonotone Equilibrium Problems
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
- Necessary optimality conditions for a bilevel multiobjective programming problem via a Ψ-reformulation
- R-regularity of set-valued mappings under the relaxed constant positive linear dependence constraint qualification with applications to parametric and bilevel optimization
- Bilevel programming with convex lower level problems
- An algorithm for solving two-level convex optimization problems
- Analysis and Solution Methods for Bilevel Optimal Control Problems
- Bilevel programming problems with simple convex lower level
- On interval-valued bilevel optimization problems using upper convexificators
- MPEC Methods for Bilevel Optimization Problems
- Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming
- Solving inverse optimal control problems via value functions to global optimality
- Numerically tractable optimistic bilevel problems
- Theoretical and numerical comparison of the Karush-Kuhn-Tucker and value function reformulations in bilevel optimization
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
- Notes on the value function approach to multiobjective bilevel optimization
- Bilevel Polynomial Programs and Semidefinite Relaxation Methods
- Bilevel Optimization: Reformulation and First Optimality Conditions
- Title not available (Why is that?)
- Convergences for robust bilevel polynomial programmes with applications
- Solving ill-posed bilevel programs
- A bridge between bilevel programs and Nash games
- On calmness conditions in convex bilevel programming
- On the use of intersection cuts for bilevel optimization
- A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
- Title not available (Why is that?)
- Bilevel optimization: on the structure of the feasible set
- Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments
- A primal nonsmooth reformulation for bilevel optimization problems
- An online convex optimization-based framework for convex bilevel optimization
- Difference of convex algorithms for bilevel programs with applications in hyperparameter selection
- Discriminatively learned hierarchical rank pooling networks
- Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem
- Title not available (Why is that?)
Uses Software
This page was built for publication: On the solution of convex bilevel optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q263155)
