SDP reformulation for robust optimization problems based on nonconvex QP duality

Authors:
Ryoichi Nishimura;Shunsuke Hayashi;Masao Fukushima
Affiliations:
Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto, Japan 606-8501;Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto, Japan 606-8501;Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto, Japan 606-8501
Venue:
Computational Optimization and Applications
Year:
2013

Citing 20
Cited 0

Semidefinite programming

SIAM Review
Robust Solutions to Least-Squares Problems with Uncertain Data

SIAM Journal on Matrix Analysis and Applications
Robust Convex Optimization

Mathematics of Operations Research
Lectures on modern convex optimization: analysis, algorithms, and engineering applications

Lectures on modern convex optimization: analysis, algorithms, and engineering applications
Robust Truss Topology Design via Semidefinite Programming

SIAM Journal on Optimization
Robust Solutions to Uncertain Semidefinite Programs

SIAM Journal on Optimization
Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems

SIAM Journal on Optimization
Robust portfolio selection problems

Mathematics of Operations Research
Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach

Operations Research
The Price of Robustness

Operations Research
Extending Scope of Robust Optimization: Comprehensive Robust Counterparts of Uncertain Problems

Mathematical Programming: Series A and B
A Robust Optimization Approach to Dynamic Pricing and Inventory Control with no Backorders

Mathematical Programming: Series A and B
Robust game theory

Mathematical Programming: Series A and B
Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints

SIAM Journal on Optimization
Second-order cone programming formulations for robust multiclass classification

Neural Computation
A Robust Optimization Approach to Inventory Theory

Operations Research
Selected topics in robust convex optimization

Mathematical Programming: Series A and B
Worst-Case Conditional Value-at-Risk with Application to Robust Portfolio Management

Operations Research
Robust portfolio selection with uncertain exit time using worst-case VaR strategy

Operations Research Letters
Robust solutions of uncertain linear programs

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a real situation, optimization problems often involve uncertain parameters. Robust optimization is one of distribution-free methodologies based on worst-case analyses for handling such problems. In this paper, we first focus on a special class of uncertain linear programs (LPs). Applying the duality theory for nonconvex quadratic programs (QPs), we reformulate the robust counterpart as a semidefinite program (SDP) and show the equivalence property under mild assumptions. We also apply the same technique to the uncertain second-order cone programs (SOCPs) with "single" (not side-wise) ellipsoidal uncertainty. Then we derive similar results on the reformulation and the equivalence property. In the numerical experiments, we solve some test problems to demonstrate the efficiency of our reformulation approach. Especially, we compare our approach with another recent method based on Hildebrand's Lorentz positivity.