Strong and total Fenchel dualities for robust convex optimization problems
From MaRDI portal
Publication:2262012
DOI10.1186/S13660-015-0592-9zbMATH Open1308.90130OpenAlexW2127855168WikidataQ59435975 ScholiaQ59435975MaRDI QIDQ2262012FDOQ2262012
Zhe Chen, Mengdan Wang, D. H. 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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convex functions, monotone operators and differentiability.
- Duality in robust optimization: Primal worst equals dual best
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Constructing Uncertainty Sets for Robust Linear Optimization
- Robust linear optimization under general norms.
- Selected topics in robust convex optimization
- Robust optimization-methodology and applications
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
- Duality in Vector Optimization
- Quasi-Slater and Farkas--Minkowski Qualifications for Semi-infinite Programming with Applications
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Necessary and sufficient conditions for stable conjugate duality
- Robust Farkas' lemma for uncertain linear systems with applications
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
- Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex Spaces
- Some robust convex programs without a duality gap
Cited In (7)
- Title not available (Why is that?)
- Strong duality in parametric robust semi-definite linear programming and exact relaxations
- Title not available (Why is that?)
- Strong and total Fenchel dualities for robust composed convex optimization problems in locally convex spaces
- Robust duality for generalized invex programming problems
- Complete characterizations of robust strong duality for robust vector optimization problems
- A unifying approach to robust convex infinite optimization duality
This page was built for publication: Strong and total Fenchel dualities for robust convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2262012)
