Strong and total Fenchel dualities for robust convex optimization problems
From MaRDI portal
Publication:2262012
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
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Constructing uncertainty sets for robust linear optimization
- Convex functions, monotone operators and differentiability.
- Duality in Vector Optimization
- Duality in robust optimization: Primal worst equals dual best
- Necessary and sufficient conditions for stable conjugate duality
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
- Quasi-Slater and Farkas-Minkowski qualifications for semi-infinite programming with applications
- Robust Farkas' lemma for uncertain linear systems with applications
- Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Robust linear optimization under general norms.
- Robust optimization
- Robust optimization-methodology and applications
- Selected topics in robust convex optimization
- Some robust convex programs without a duality gap
- Stable and total Fenchel duality for convex optimization problems in locally convex spaces
- Strong duality in robust convex programming: complete characterizations
Cited in
(18)- Fenchel duality for convex set functions
- scientific article; zbMATH DE number 5944598 (Why is no real title available?)
- 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
- Robust strong duality for nonconvex optimization problem under data uncertainty in constraint
- Strong duality in robust convex programming: complete characterizations
- scientific article; zbMATH DE number 7294847 (Why is no real title available?)
- 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
- Sectional convexity of epigraphs of conjugate mappings with applications to robust vector duality
- Robust duality for generalized invex programming problems
- scientific article; zbMATH DE number 7709322 (Why is no real title available?)
- 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)
