A Unified Approach to Robust Farkas-Type Results with Applications to Robust Optimization Problems
From MaRDI portal
Publication:5266535
DOI10.1137/16M1067925zbMath1368.49042MaRDI QIDQ5266535
No author found.
Publication date: 16 June 2017
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Nonsmooth analysis (49J52) Programming in abstract spaces (90C48) Functional inequalities, including subadditivity, convexity, etc. (39B62) Duality theory (optimization) (49N15)
Related Items
Robust strong duality for nonconvex optimization problem under data uncertainty in constraint ⋮ Complete characterizations of robust strong duality for robust vector optimization problems ⋮ A perturbation approach to vector optimization problems: Lagrange and Fenchel-Lagrange duality ⋮ A unifying approach to robust convex infinite optimization duality ⋮ Convexity and closedness in stable robust duality ⋮ Convex robust sum optimization problems with conic and set constraints: duality and optimality conditions revisited ⋮ Robust duality for nonconvex uncertain vector optimization via a general scalarization ⋮ New representations of epigraphs of conjugate mappings and Lagrange, Fenchel–Lagrange duality for vector optimization problems ⋮ Characterizations of Robust and Stable Duality for Linearly Perturbed Uncertain Optimization Problems ⋮ Duality for robust linear infinite programming problems revisited ⋮ Exact relaxations for parametric robust linear optimization problems ⋮ Sectional convexity of epigraphs of conjugate mappings with applications to robust vector duality ⋮ Moreau Envelope of Supremum Functions with Applications to Infinite and Stochastic Programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robust linear semi-infinite programming duality under uncertainty
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Robust duality in parametric convex optimization
- Robust Farkas' lemma for uncertain linear systems with applications
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Robust duality for generalized convex programming problems under data uncertainty
- Functional inequalities and theorems of the alternative involving composite functions
- Robust portfolios: contributions from operations research and finance
- Conjugate duality in convex optimization
- Recent advances in robust optimization: an overview
- Farkas-type results for vector-valued functions with applications
- Qualification conditions and Farkas-type results for systems involving composite functions
- Robust solutions to multi-objective linear programs with uncertain data
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Theory and Applications of Robust Optimization
- From the Farkas Lemma to the Hahn--Banach Theorem
- On Extension of Fenchel Duality and its Application
- Robust optimization revisited via robust vector Farkas lemmas
