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
Authors: Mengdan Wang, Zhe Chen, 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
Recommendations
- Strong duality in robust convex programming: complete characterizations
- scientific article; zbMATH DE number 7709322
- Stable and total Fenchel duality for convex optimization problems in locally convex spaces
- Complete characterizations of robust strong duality for robust vector optimization problems
- Stable and total Fenchel duality for composed convex optimization problems
Cites Work
- Title not available (Why is that?)
- Robust optimization
- 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 (17)
- Fenchel duality for convex set functions
- Title not available (Why is that?)
- On strong and total Lagrange duality for convex optimization problems
- Strong duality in parametric robust semi-definite linear programming and exact relaxations
- Duality for robust linear infinite programming problems revisited
- Strong duality in robust convex programming: complete characterizations
- Title not available (Why is that?)
- Strong and total Fenchel dualities for robust composed convex optimization problems in locally convex spaces
- Robust duality in parametric convex optimization
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Robust duality for generalized invex programming problems
- Sectional convexity of epigraphs of conjugate mappings with applications to robust vector duality
- Title not available (Why is that?)
- Convexity and closedness in stable robust duality
- Stable Lagrange dualities for robust conical programming
- 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)
