Geometric and computational hardness of bilevel programming
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 45943 (Why is no real title available?)
- scientific article; zbMATH DE number 770227 (Why is no real title available?)
- scientific article; zbMATH DE number 3186512 (Why is no real title available?)
- A robust approach for modeling limited observability in bilevel optimization
- A study on the computational complexity of the bilevel knapsack problem
- A survey on bilevel optimization under uncertainty
- Algorithms in real algebraic geometry
- An introduction to differential manifolds. Translated from the 2nd French edition by Jonathan Upjohn
- Bilevel optimization and variational analysis
- Bilevel polynomial programs and semidefinite relaxation methods
- Bilevel programming and the separation problem
- Computational Complexity
- Computational Difficulties of Bilevel Linear Programming
- Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
- Examples of Pathological Dynamics of the Subgradient Method for Lipschitz Path-Differentiable Functions
- Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials
- Foundations of bilevel programming
- Geometric categories and o-minimal structures
- Global optimization with polynomials and the problem of moments
- High-dimensional probability. An introduction with applications in data science
- Introduction to Topological Manifolds
- Motion planning with pulley, rope, and baskets
- On calmness conditions in convex bilevel programming
- On solving simple bilevel programs with a nonconvex lower level program
- Optimality conditions for bilevel programming problems
- Pathological subgradient dynamics
- Semidefinite programming relaxations for semialgebraic problems
- Sensitivity analysis for two-level value functions with applications to bilevel programming
- Some properties of the bilevel programming problem
- The nonlinear bilevel programming problem:formulations,regularity and optimality conditions
- The polynomial hierarchy and a simple model for competitive analysis
- The polynomial-time hierarchy
- Typical properties of Lipschitz functions.
This page was built for publication: Geometric and computational hardness of bilevel programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6873495)
