Pages that link to "Item:Q5929997"
From MaRDI portal
The following pages link to On copositive programming and standard quadratic optimization problems (Q5929997):
Displaying 50 items.
- On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
- A copositive formulation for the stability number of infinite graphs (Q344928) (← links)
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets (Q360522) (← links)
- Sparse solutions to random standard quadratic optimization problems (Q378104) (← links)
- A note on set-semidefinite relaxations of nonconvex quadratic programs (Q386483) (← links)
- Copositivity and constrained fractional quadratic problems (Q403649) (← links)
- Copositive optimization -- recent developments and applications (Q421783) (← links)
- Optimality theorems for convex semidefinite vector optimization problems (Q425863) (← links)
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
- An improved algorithm to test copositivity (Q427387) (← links)
- Analysis of copositive optimization based linear programming bounds on standard quadratic optimization (Q496589) (← links)
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
- Quadratic factorization heuristics for copositive programming (Q542052) (← links)
- Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
- An algorithm for determining copositive matrices (Q636239) (← 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)
- Exceptional family and solvability of copositive complementarity problems (Q662097) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
- Partially positive matrices (Q892772) (← links)
- Interiors of completely positive cones (Q897047) (← links)
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342) (← links)
- A clique algorithm for standard quadratic programming (Q955308) (← links)
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
- On the computation of \(C^*\) certificates (Q1037359) (← links)
- LP-based tractable subcones of the semidefinite plus nonnegative cone (Q1657406) (← links)
- Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets (Q1682971) (← links)
- A fresh CP look at mixed-binary QPs: new formulations and relaxations (Q1683686) (← links)
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem (Q1734301) (← links)
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793) (← links)
- A primal barrier function phase I algorithm for nonsymmetric conic optimization problems (Q1926650) (← links)
- Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma (Q1987329) (← links)
- Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches (Q2010370) (← links)
- A modified simplex partition algorithm to test copositivity (Q2052385) (← links)
- Two-stage stochastic standard quadratic optimization (Q2077956) (← links)
- Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations (Q2133420) (← links)
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
- On strong duality in linear copositive programming (Q2149604) (← links)
- On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices (Q2158273) (← links)
- Completely positive factorizations associated with Euclidean distance matrices corresponding to an arithmetic progression (Q2174096) (← links)
- A factorization method for completely positive matrices (Q2174498) (← links)
- Hermitian completely positive matrices (Q2197205) (← links)
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations (Q2231320) (← links)
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality (Q2273897) (← links)
- Completely positive reformulations for polynomial optimization (Q2349130) (← links)
- Tightening a copositive relaxation for standard quadratic optimization problems (Q2376121) (← links)
