Interplay of non-convex quadratically constrained problems with adjustable robust optimization

Recommendations

On conic QPCCs, conic QCQPs and completely positive programs
A geometrical analysis on convex conic reformulations of quadratic and polynomial optimization problems
Conic approximation to nonconvex quadratic programming with convex quadratic constraints
A gentle, geometric introduction to copositive optimization
A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program

Cites work

A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides
A gentle, geometric introduction to copositive optimization
A survey of adjustable robust optimization
A Survey of the S-Lemma
A variational approach to copositive matrices
Adjustable robust solutions of uncertain linear programs
Computable representations for convex hulls of low-dimensional quadratic forms
Convexity of quadratic transformations and its use in control and optimization
Copositive optimization -- recent developments and applications
Copositive programming
Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems
scientific article; zbMATH DE number 4070633 (Why is no real title available?)
scientific article; zbMATH DE number 3368525 (Why is no real title available?)
LMI Approximations for Cones of Positive Semidefinite Forms
On Cones of Nonnegative Quadratic Functions
On the copositive representation of binary and continuous nonconvex quadratic programs
On the mapping of quadratic forms
On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
On the Slater condition for the SDP relaxations of nonconvex sets
Partial Lagrangian relaxation for general quadratic programming
Quadratic programs with hollows
Representing quadratically constrained quadratic programs as generalized copositive programs
Robust optimization
Robust quadratic programming with mixed-integer uncertainty
Second-order-cone constraints for extended trust-region subproblems
Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
The trust region subproblem with non-intersecting linear constraints
Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization

Cited in

(9)

SDP reformulation for robust optimization problems based on nonconvex QP duality
Uncertainty Preferences in Robust Mixed-Integer Linear Optimization with Endogenous Uncertainty
A robustification approach in unconstrained quadratic optimization
Optimization under uncertainty and risk: quadratic and copositive approaches
Sparse conic reformulation of structured QCQPs based on copositive optimization with applications in stochastic optimization
Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: exact second-order cone program reformulations
Further development in convex conic reformulation of geometric nonconvex conic optimization problems
Finding quadratic underestimators for optimal value functions of nonconvex all-quadratic problems via copositive optimization
Solving nonconvex optimization problems using outer approximations of the set-copositive cone

This page was built for publication: Interplay of non-convex quadratically constrained problems with adjustable robust optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2661757)