Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints

DOI10.1007/s10957-017-1069-4zbMath1370.49017OpenAlexW2584709508MaRDI QIDQ2363578

Thai Doan Chuong, Vaithilingam Jeyakumar

Publication date: 20 July 2017

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-017-1069-4

zbMATH Keywords

robust optimizationbilevel programmingglobal polynomial optimizationsemidefinite programuncertain linear constraints

Mathematics Subject Classification ID

Semidefinite programming (90C22) Multi-objective and goal programming (90C29) Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46) Optimality conditions (49K99) Optimality conditions for problems involving relations other than differential equations (49K21)

Related Items (7)

The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective ⋮ Optimality conditions for nonsmooth multiobjective bilevel optimization problems ⋮ 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 ⋮ Unnamed Item ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Uses Software

• Matlab
• YALMIP

Cites Work

• Unnamed Item
• Unnamed Item
• Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
• Dual semidefinite programs without duality gaps for a class of convex minimax programs
• On polynomial optimization over non-compact semi-algebraic sets
• A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals
• Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
• Selected topics in robust convex optimization
• Practical bilevel optimization. Algorithms and applications
• Foundations of bilevel programming
• Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
• A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
• Robust optimization-methodology and applications
• New optimality conditions for the semivectorial bilevel optimization problem
• Stochastic mathematical programs with equilibrium constraints
• Recent advances in robust optimization: an overview
• An overview of bilevel optimization
• Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems
• WHAT IS...a Spectrahedron?
• New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
• Theory and Applications of Robust Optimization
• Computational Difficulties of Bilevel Linear Programming
• Bilevel Programming Problems
• The solution approach to linear fuzzy bilevel optimization problems
• Global optimization of nonlinear bilevel programming problems

This page was built for publication: Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints