Pages that link to "Item:Q5929997"
From MaRDI portal
The following pages link to On copositive programming and standard quadratic optimization problems (Q5929997):
Displayed 16 items.
- 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)
- 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)
- 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)
- Multi-standard quadratic optimization: Interior point methods and cone programming reformulation (Q2379693) (← links)
- On the copositive representation of binary and continuous nonconvex quadratic programs (Q2391001) (← links)
- Improved SDP bounds for minimizing quadratic functions over the \(\ell^{1}\)-ball (Q2458903) (← links)
- Algorithmic copositivity detection by simplicial partition (Q2477530) (← links)
- D.C. versus copositive bounds for standard QP (Q2583183) (← links)
- Computable representations for convex hulls of low-dimensional quadratic forms (Q2638365) (← links)
- Foundations of Set-Semidefinite Optimization (Q5188753) (← links)