D.C. versus copositive bounds for standard QP
From MaRDI portal
Publication:2583183
Recommendations
- Tightening a copositive relaxation for standard quadratic optimization problems
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- On copositive programming and standard quadratic optimization problems
- Copositive realxation for genera quadratic programming
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
Cites work
- A comparison of the Delsarte and Lovász bounds
- Approximation of the stability number of a graph via copositive programming
- Branch-and-bound approaches to standard quadratic optimization problems
- Maxima for Graphs and a New Proof of a Theorem of Turán
- On copositive programming and standard quadratic optimization problems
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(16)- \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\)
- On global optimization with indefinite quadratics
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
- Tightening a copositive relaxation for standard quadratic optimization problems
- Improved SDP bounds for minimizing quadratic functions over the \(\ell^{1}\)-ball
- Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex
- Copositivity and constrained fractional quadratic problems
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- A new branch-and-bound algorithm for standard quadratic programming problems
- Optimization under uncertainty and risk: quadratic and copositive approaches
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- The semi-continuous quadratic mixture design problem: description and branch-and-bound approach
This page was built for publication: D.C. versus copositive bounds for standard QP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583183)
