Pages that link to "Item:Q2583183"
From MaRDI portal
The following pages link to D.C. versus copositive bounds for standard QP (Q2583183):
Displaying 15 items.
- Copositivity and constrained fractional quadratic problems (Q403649) (← links)
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints (Q925234) (← links)
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342) (← links)
- The semi-continuous quadratic mixture design problem: description and branch-and-bound approach (Q932200) (← links)
- On global optimization with indefinite quadratics (Q1707078) (← links)
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations (Q2231320) (← links)
- Tightening a copositive relaxation for standard quadratic optimization problems (Q2376121) (← links)
- Improved SDP bounds for minimizing quadratic functions over the \(\ell^{1}\)-ball (Q2458903) (← links)
- Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex (Q2954391) (← links)
- A new branch-and-bound algorithm for standard quadratic programming problems (Q4646674) (← links)
- Optimization under uncertainty and risk: quadratic and copositive approaches (Q6113346) (← links)
