Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization

DOI10.1007/s10898-015-0277-4zbMath1346.90808OpenAlexW1973524432WikidataQ124842567 ScholiaQ124842567MaRDI QIDQ280088

F. Blanchet-Sadri, M. Dambrine

Publication date: 29 April 2016

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-015-0277-4

zbMATH Keywords

dualityrobust optimizationconvex polynomialsdifference of convex optimizationgeneralized Farkas's lemmaminimax programsnon-convex quadratic optimization

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)

Related Items (4)

Sum-of-squares relaxations in robust DC optimization and feature selection ⋮ D.C. programming approach for solving an applied ore-processing problem ⋮ DC approach to weakly convex optimization and nonconvex quadratic optimization problems ⋮ On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Farkas' lemma: three decades of generalizations for mathematical optimization
• Dual semidefinite programs without duality gaps for a class of convex minimax programs
• Lagrange-type duality in DC programming
• Some new Farkas-type results for inequality systems with DC functions
• Complete characterizations of stable Farkas' lemma and cone-convex programming duality
• Duality in nonconvex optimization
• Duality in D. C. programming: The case of several D. C. constraints
• A Frank--Wolfe type theorem for convex polynomial programs
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty
• DC programming: overview.
• Calculus Without Derivatives
• Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
• A closedness condition and its applications to DC programs with convex constraints
• A new class of alternative theorems for SOS-convex inequalities and robust optimization
• Convex Analysis
• A Survey of the S-Lemma

This page was built for publication: Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization