A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
From MaRDI portal
Publication:1785391
DOI10.1016/j.orl.2015.05.006zbMath1408.90226OpenAlexW2195665680WikidataQ59241455 ScholiaQ59241455MaRDI QIDQ1785391
Guoyin Li, Vaithilingam Jeyakumar
Publication date: 28 September 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2015.05.006
Related Items (5)
Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints ⋮ Optimality conditions for nonsmooth multiobjective bilevel optimization problems ⋮ Convergences for robust bilevel polynomial programmes with applications ⋮ Bilevel aggregator-prosumers' optimization problem in real-time: a convex optimization approach ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Uses Software
Cites Work
- Unnamed Item
- Linear bilevel programming with interval coefficients
- Farkas' lemma: three decades of generalizations for mathematical optimization
- On polynomial optimization over non-compact semi-algebraic sets
- Robust Farkas' lemma for uncertain linear systems with applications
- Global solution of bilevel programs with a nonconvex inner program
- Practical bilevel optimization. Algorithms and applications
- Bilevel and multilevel programming: A bibliography review
- Foundations of bilevel programming
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems
- An overview of bilevel optimization
- Lectures on Modern Convex Optimization
- An Introduction to Polynomial and Semi-Algebraic Optimization
- New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
- From the Farkas Lemma to the Hahn--Banach Theorem
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Pre- and Post-Processing Sum-of-Squares Programs in Practice
- Necessary optimality conditions in pessimistic bilevel programming
- A new class of alternative theorems for SOS-convex inequalities and robust optimization
- KKT Reformulation and Necessary Conditions for Optimality in Nonsmooth Bilevel Optimization
- Global optimization of nonlinear bilevel programming problems
This page was built for publication: A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
