Exact SDP reformulations for adjustable robust quadratic optimization with affine decision rules

Cites Work

Unnamed Item
Unnamed Item
On robust optimization. Relations between scalar robust optimization and unconstrained multicriteria optimization
A polynomial arc-search interior-point algorithm for convex quadratic programming
Exterior point algorithms for nearest points and convex quadratic programs
Robust solutions of uncertain linear programs
Robust convex quadratically constrained programs
Adjustable robust solutions of uncertain linear programs
Characterizations for optimality conditions of general robust optimization problems
A survey of adjustable robust optimization
Solving fractional multicriteria optimization problems with sum of squares convex polynomial data
A primal-dual regularized interior-point method for convex quadratic programs
Robust optimization-methodology and applications
Some geometric results in semidefinite programming
Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules
Generalized Farkas lemma with adjustable variables and two-stage robust linear programs
Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity
Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty
On approximate solutions and saddle point theorems for robust convex optimization
Recent advances in robust optimization: an overview
Radius of robust feasibility of system of convex inequalities with uncertain data
Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
Some characterizations of approximate solutions for robust semi-infinite optimization problems
WHAT IS...a Spectrahedron?
Duality in Two-Stage Adaptive Linear Optimization: Faster Computation and Stronger Bounds
Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts
Robust Quadratic Programming with Mixed-Integer Uncertainty
An unconstrained convex programming approach to solving convex quadratic programming problems
Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems
Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems
Complex Quadratic Optimization and Semidefinite Programming
A graph-based decomposition method for convex quadratic optimization with indicators
On second-order conic programming duals for robust convex quadratic optimization problems
Characterizing a class of robust vector polynomial optimization via sum of squares conditions

This page was built for publication: Exact SDP reformulations for adjustable robust quadratic optimization with affine decision rules