Cutting plane algorithms for robust conic convex optimization problems
From MaRDI portal
Publication:3423595
DOI10.1080/10556780500159128zbMath1112.90054OpenAlexW1995978630MaRDI QIDQ3423595
No author found.
Publication date: 14 February 2007
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/178249
Related Items (5)
Semi-infinite programming ⋮ Benders decomposition approach for the robust network design problem with flow bifurcations ⋮ Comments on: Stability in linear optimization and related topics. A personal tour ⋮ Cascading: An adjusted exchange method for robust conic programming ⋮ Necessary conditions and duality for inexact nonlinear semi-infinite programming problems
Cites Work
- Unnamed Item
- Unnamed Item
- Applications of second-order cone programming
- Discretization methods for the solution of semi-infinite programming problems
- Second-order cone programming
- Strong duality for inexact linear programming
- Lectures on Modern Convex Optimization
- Robust Convex Optimization
- Duality for inexact linear programming problems∗
- Semi-Infinite Programming: Theory, Methods, and Applications
- Connections between generalized, inexact and semi-infinite linear programming
- An implementation of a discretization method for semi-infinite programming
- Direct theorems in semi-infinite convex programming
- Some generalization of inexact linear programming
- Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints
- Semidefinite Programming
- Duality for inexact semi-infinite linear programming
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
This page was built for publication: Cutting plane algorithms for robust conic convex optimization problems
