Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints
From MaRDI portal
Publication:2363578
bilevel programmingglobal polynomial optimizationrobust optimizationsemidefinite programuncertain linear constraints
Optimality conditions for problems involving relations other than differential equations (49K21) Optimality conditions (49K99) Numerical optimization and variational techniques (65K10) Semidefinite programming (90C22) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Recommendations
- Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
- Bilevel polynomial programs and semidefinite relaxation methods
- A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
- Parametric global optimization for polynomial bilevel programming
- Global optimality test for maximin solution of bilevel linear programming with ambiguous lower-level objective function
Cites work
- A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
- A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals
- An overview of bilevel optimization
- Bilevel programming problems. Theory, algorithms and applications to energy networks
- Computational Difficulties of Bilevel Linear Programming
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
- Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
- Dual semidefinite programs without duality gaps for a class of convex minimax programs
- Foundations of bilevel programming
- Global optimization of nonlinear bilevel programming problems
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- New necessary optimality conditions for bilevel programs by combining the MPEC and value function approaches
- New optimality conditions for the semivectorial bilevel optimization problem
- On polynomial optimization over non-compact semi-algebraic sets
- Practical bilevel optimization. Algorithms and applications
- Recent advances in robust optimization: an overview
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Robust optimization
- Robust optimization-methodology and applications
- Selected topics in robust convex optimization
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
- Stochastic mathematical programs with equilibrium constraints
- The solution approach to linear fuzzy bilevel optimization problems
- Theory and applications of robust optimization
- What is \dots a spectrahedron?
Cited in
(10)- A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
- The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective
- Optimality conditions for nonsmooth multiobjective bilevel optimization problems
- Tight SDP relaxations for a class of robust SOS-convex polynomial programs without the Slater condition
- Uncertainty handling in bilevel optimization for robust and reliable solutions
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem
- Convergences for robust bilevel polynomial programmes with applications
- A survey on bilevel optimization under uncertainty
- Hierarchy relaxations for robust equilibrium constrained polynomial problems and applications to electric vehicle charging scheduling
This page was built for publication: Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363578)
