Strong and total Fenchel dualities for robust convex optimization problems
From MaRDI portal
Publication:2262012
DOI10.1186/s13660-015-0592-9zbMath1308.90130OpenAlexW2127855168WikidataQ59435975 ScholiaQ59435975MaRDI QIDQ2262012
Zhe Chen, Mengdan Wang, Dong Hui Fang
Publication date: 16 March 2015
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-015-0592-9
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
- Robust Farkas' lemma for uncertain linear systems with applications
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Convex functions, monotone operators and differentiability.
- Robust linear optimization under general norms.
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- Selected topics in robust convex optimization
- Duality in robust optimization: Primal worst equals dual best
- Robust optimization-methodology and applications
- Necessary and sufficient conditions for stable conjugate duality
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Constructing Uncertainty Sets for Robust Linear Optimization
- Duality in Vector Optimization
- Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex Spaces
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
- Quasi-Slater and Farkas--Minkowski Qualifications for Semi-infinite Programming with Applications
This page was built for publication: Strong and total Fenchel dualities for robust convex optimization problems
