Representing quadratically constrained quadratic programs as generalized copositive programs
From MaRDI portal
Publication:439919
DOI10.1016/J.ORL.2012.02.001zbMath1245.90080OpenAlexW2004392729MaRDI QIDQ439919
Publication date: 17 August 2012
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2012.02.001
Related Items (27)
A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation ⋮ On conic QPCCs, conic QCQPs and completely positive programs ⋮ Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming ⋮ Improved Conic Reformulations for $K$-means Clustering ⋮ On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets ⋮ Interplay of non-convex quadratically constrained problems with adjustable robust optimization ⋮ Necessary and sufficient conditions for copositive tensors ⋮ An exact completely positive programming formulation for the discrete ordered median problem: an extended version ⋮ Exact computable representation of some second-order cone constrained quadratic programming problems ⋮ A note on set-semidefinite relaxations of nonconvex quadratic programs ⋮ Completely positive reformulations of polynomial optimization problems with linear constraints ⋮ (Global) optimization: historical notes and recent developments ⋮ Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems ⋮ Convex hull results on quadratic programs with non-intersecting constraints ⋮ Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization ⋮ Copositive programming via semi-infinite optimization ⋮ Unnamed Item ⋮ A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties ⋮ A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides ⋮ Analytical expressions of copositivity for fourth-order symmetric tensors ⋮ On cones of nonnegative quartic forms ⋮ A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming ⋮ An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation ⋮ Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting ⋮ An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs ⋮ An Iterative Rank Penalty Method for Nonconvex Quadratically Constrained Quadratic Programs ⋮ Completely positive reformulations for polynomial optimization
Cites Work
- Unnamed Item
- Unnamed Item
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Second-order cone programming
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- On convex relaxations for quadratically constrained quadratic programming
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Copositive Programming
- The MILP Road to MIQCP
- A Variational Approach to Copositive Matrices
- On the Matrix Equation X′X = A
- Foundations of Set-Semidefinite Optimization
- An Adaptive Linear Approximation Algorithm for Copositive Programs
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
- LMI Approximations for Cones of Positive Semidefinite Forms
- On Cones of Nonnegative Quadratic Functions
This page was built for publication: Representing quadratically constrained quadratic programs as generalized copositive programs
