A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
type: Item
instance of: scholarly article
title: A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
zbMATH Open document ID: 1408.90226
author: G. Li
author: V. Jeyakumar
published in: Operations Research Letters
publication date: 2018-09-28T00:00:00Z
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 6945379
zbMATH Keywords: bilevel programming
zbMATH Keywords: global polynomial optimization
zbMATH Keywords: bilevel Farkas' lemma
zbMATH Keywords: semidefinite programming
Wikidata QID: Q59241455
describes a project that uses: YALMIP
MaRDI profile type: Publication
full work available at URL: j.orl.2015.05.006
OpenAlex ID: W2195665680
cites work: Practical bilevel optimization. Algorithms and applications
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: Linear bilevel programming with interval coefficients
cites work: An overview of bilevel optimization
cites work: Foundations of bilevel programming
cites work: Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
cites work: Necessary optimality conditions in pessimistic bilevel programming
cites work: KKT Reformulation and Necessary Conditions for Optimality in Nonsmooth Bilevel Optimization
cites work: From the Farkas Lemma to the Hahn--Banach Theorem
cites work: Farkas' lemma: three decades of generalizations for mathematical optimization
cites work: Global optimization of nonlinear bilevel programming problems
cites work: On polynomial optimization over non-compact semi-algebraic sets
cites work: Robust Farkas' lemma for uncertain linear systems with applications
cites work: Exact SDP relaxations for classes of nonlinear semidefinite programming problems
cites work: A new class of alternative theorems for SOS-convex inequalities and robust optimization
cites work: Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
cites work: An Introduction to Polynomial and Semi-Algebraic Optimization
cites work: Pre- and Post-Processing Sum-of-Squares Programs in Practice
cites work: Q4326385
cites work: Global solution of bilevel programs with a nonconvex inner program
cites work: Bilevel and multilevel programming: A bibliography review
cites work: New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
DBLP publication ID: journals/orl/JeyakumarL15
DOI: 10.1016/J.ORL.2015.05.006
description: scientific article; zbMATH DE number 6945379