Some robust convex programs without a duality gap
From MaRDI portal
Recommendations
- Strong duality in robust convex programming: complete characterizations
- Universal duality in conic convex optimization
- Robust duality for generalized convex programming problems under data uncertainty
- Generalized robust duality in constrained nonconvex optimization
- Some convex programs without a duality gap
Cited in
(21)- Characterizing robust solution sets of convex programs under data uncertainty
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
- Prices stabilization for inexact unit-commitment problems
- Universal duality in conic convex optimization
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Some convex programs without a duality gap
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality
- Local optimality conditions and local saddle point theorems for nonconvex robust programming
- Strong duality in robust convex programming: complete characterizations
- Strong and total Fenchel dualities for robust convex optimization problems
- Characterizations of robust solution set of convex programs with uncertain data
- On second-order conic programming duals for robust convex quadratic optimization problems
- Generalized robust duality in constrained nonconvex optimization
- A note on Fenchel duality for equilibrium problems
- Sectional convexity of epigraphs of conjugate mappings with applications to robust vector duality
- Constraint qualifications for uncertain convex optimization without convexity of constraint data uncertainty
- Complete characterizations of robust strong duality for robust vector optimization problems
- A unifying approach to robust convex infinite optimization duality
- Strong duality for robust minimax fractional programming problems
- Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
- On uncertain conical convex optimization problems
This page was built for publication: Some robust convex programs without a duality gap
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841072)
