Robust quadratic programming with mixed-integer uncertainty
From MaRDI portal
Abstract: We study robust convex quadratic programs where the uncertain problem parameters can contain both continuous and integer components. Under the natural boundedness assumption on the uncertainty set, we show that the generic problems are amenable to exact copositive programming reformulations of polynomial size. These convex optimization problems are NP-hard but admit a conservative semidefinite programming (SDP) approximation that can be solved efficiently. We prove that the popular approximate S-lemma method --- which is valid only in the case of continuous uncertainty --- is weaker than our approximation. We also show that all results can be extended to the two-stage robust quadratic optimization setting if the problem has complete recourse. We assess the effectiveness of our proposed SDP reformulations and demonstrate their superiority over the state-of-the-art solution schemes on instances of least squares, project management, and multi-item newsvendor problems.
Recommendations
- Robust convex quadratically constrained programs
- Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
- SDP reformulation for robust optimization problems based on nonconvex QP duality
- Robust solutions of uncertain complex-valued quadratically constrained programs
- Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity
Cites work
- A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides
- A fresh CP look at mixed-binary QPs: new formulations and relaxations
- A Robust Optimization Perspective on Stochastic Programming
- Adjustable robust solutions of uncertain linear programs
- Approximation of the stability number of a graph via copositive programming
- Conic programming reformulations of two-stage distributionally robust linear programs over Wasserstein balls
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- Copositive programming
- Distributionally robust mixed integer linear programs: persistency models with applications
- Distributionally robust optimization and its tractable approximations
- Distributionally robust project crashing with partial or no correlation information
- Generalized decision rule approximations for stochastic programming via liftings
- Generalized Linear-Quadratic Problems of Deterministic and Stochastic Optimal Control in Discrete Time
- scientific article; zbMATH DE number 3176168 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 2121076 (Why is no real title available?)
- Infinitely constrained optimization problems
- Lectures on stochastic programming. Modeling and theory.
- Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
- New results on the cp-rank and related properties of co(mpletely) positive matrices
- On reduced semidefinite programs for second order moment bounds with applications
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Perturbation Theory for the Least Squares Problem with Linear Equality Constraints
- Rangen: A random network generator for activity-on-the-node networks
- Robust convex optimization
- Robust convex quadratically constrained programs
- Robust optimization
- Robust resource allocations in temporal networks
- Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Robustness and regularization of support vector machines
- Scheduling arrivals to a stochastic service delivery system using copositive cones
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Support-vector networks
- The sample average approximation method for stochastic discrete optimization
- Theory and applications of robust optimization
- Tractable approximations to robust conic optimization problems
Cited in
(16)- Robust convex quadratically constrained programs
- Maximizing perturbation radii for robust convex quadratically constrained quadratic programs
- A Lagrangian dual method for two-stage robust optimization with binary uncertainties
- A note on \(\Sigma_2^p\)-completeness of a robust binary linear program with binary uncertainty set
- Interplay of non-convex quadratically constrained problems with adjustable robust optimization
- Finding minimum volume circumscribing ellipsoids using generalized copositive programming
- Uncertainty Preferences in Robust Mixed-Integer Linear Optimization with Endogenous Uncertainty
- Extending the Scope of Robust Quadratic Optimization
- scientific article; zbMATH DE number 5019960 (Why is no real title available?)
- A robustification approach in unconstrained quadratic optimization
- Optimization under uncertainty and risk: quadratic and copositive approaches
- On second-order conic programming duals for robust convex quadratic optimization problems
- Exact SDP reformulations for adjustable robust quadratic optimization with affine decision rules
- Finding quadratic underestimators for optimal value functions of nonconvex all-quadratic problems via copositive optimization
- Two-stage robust mixed integer programming problem with objective uncertainty
- Interval quadratic programming for day-ahead dispatch of uncertain predicted demand
This page was built for publication: Robust quadratic programming with mixed-integer uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3386756)
