Pages that link to "Item:Q4391294"
From MaRDI portal
The following pages link to Copositive realxation for genera quadratic programming (Q4391294):
Displaying 37 items.
- A note on set-semidefinite relaxations of nonconvex quadratic programs (Q386483) (← links)
- Copositive optimization -- recent developments and applications (Q421783) (← links)
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
- Representing quadratically constrained quadratic programs as generalized copositive programs (Q439919) (← links)
- Quadratic factorization heuristics for copositive programming (Q542052) (← links)
- An algorithm for determining copositive matrices (Q636239) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← 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)
- Role of redundant constraints for improving dual bounds in polynomial optimization problems (Q1288665) (← links)
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone (Q1785193) (← links)
- Simplified semidefinite and completely positive relaxations (Q1785437) (← links)
- Building a completely positive factorization (Q1787912) (← links)
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision (Q1949258) (← links)
- Conic approximation to nonconvex quadratic programming with convex quadratic constraints (Q2018510) (← links)
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs (Q2070358) (← links)
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality (Q2273897) (← links)
- Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations (Q2274881) (← links)
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs (Q2293657) (← links)
- Exploiting symmetry in copositive programs via semidefinite hierarchies (Q2349140) (← links)
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme (Q2355798) (← links)
- Tightening a copositive relaxation for standard quadratic optimization problems (Q2376121) (← links)
- On the copositive representation of binary and continuous nonconvex quadratic programs (Q2391001) (← links)
- A new certificate for copositivity (Q2418975) (← links)
- Algorithmic copositivity detection by simplicial partition (Q2477530) (← links)
- D.C. versus copositive bounds for standard QP (Q2583183) (← links)
- Partial Lagrangian relaxation for general quadratic programming (Q2644374) (← links)
- Copositivity aspects of standard quadratic optimization problems (Q2725640) (← links)
- New positive semidefinite relaxations for nonconvex quadratic programs (Q2768052) (← links)
- On linear conic relaxation of discrete quadratic programs (Q2829559) (← links)
- Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables (Q2928409) (← links)
- Foundations of Set-Semidefinite Optimization (Q5188753) (← links)
- LMI approximations for the radius of the intersection of ellipsoids: Survey. (Q5929424) (← links)
- On copositive programming and standard quadratic optimization problems (Q5929997) (← links)
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)
- Generating extreme copositive matrices near matrices obtained from COP-irreducible graphs (Q6536723) (← links)