SDP reformulation for robust optimization problems based on nonconvex QP duality
From MaRDI portal
Publication:354630
DOI10.1007/s10589-012-9520-9zbMath1295.90031OpenAlexW2091131546MaRDI QIDQ354630
Shunsuke Hayashi, Ryoichi Nishimura, Masao Fukushima
Publication date: 19 July 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-012-9520-9
semidefinite programmingnonconvex quadratic programmingrobust optimizationsecond-order cone programming
Related Items
Quasiconvexity of set-valued maps assures well-posedness of robust vector optimization, Semidefinite complementarity reformulation for robust Nash equilibrium problems with Euclidean uncertainty sets, A non-probabilistic methodology for reliable sustainability planning: an application to the Iraqi national irrigation system
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- Robust portfolio optimization with derivative insurance guarantees
- Portfolio selection with uncertain exit time: a robust CVaR approach
- Semi-infinite programming
- Selected topics in robust convex optimization
- Applications of second-order cone programming
- Robust solutions of uncertain linear programs
- Second-order cone programming
- Robust portfolio selection with uncertain exit time using worst-case VaR strategy
- Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems
- A robust optimization approach to dynamic pricing and inventory control with no backorders
- Robust game theory
- Lectures on Modern Convex Optimization
- Robust Convex Optimization
- An LMI description for the cone of Lorentz-positive maps II
- Worst-Case Conditional Value-at-Risk with Application to Robust Portfolio Management
- A Robust Optimization Approach to Inventory Theory
- Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
- The Price of Robustness
- Robust Solutions to Uncertain Semidefinite Programs
- Robust Truss Topology Design via Semidefinite Programming
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
- Semidefinite Programming
- An LMI description for the cone of Lorentz-positive maps
- Convex Analysis
- Robust Portfolio Selection Problems
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- Second-Order Cone Programming Formulations for Robust Multiclass Classification
