Pages that link to "Item:Q644906"
From MaRDI portal
The following pages link to Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906):
Displaying 34 items.
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- Convex relaxations for mixed integer predictive control (Q710707) (← links)
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization (Q721146) (← links)
- Faster, but weaker, relaxations for quadratically constrained quadratic programs (Q742292) (← links)
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
- A novel optimization method for nonconvex quadratically constrained quadratic programs (Q1724769) (← links)
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint (Q1753128) (← links)
- On convex relaxations for quadratically constrained quadratic programming (Q1925792) (← links)
- On convex relaxations of quadrilinear terms (Q1959235) (← links)
- An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation (Q2044572) (← links)
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs (Q2070358) (← links)
- A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues (Q2112679) (← links)
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
- Optimization and operations research in mitigation of a pandemic (Q2158111) (← links)
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (Q2176277) (← links)
- A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs (Q2244199) (← links)
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming (Q2274889) (← links)
- Template polyhedra and bilinear optimization (Q2322312) (← links)
- Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs (Q2409582) (← links)
- New bounds for nonconvex quadratically constrained quadratic programming (Q2689857) (← links)
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
- New positive semidefinite relaxations for nonconvex quadratic programs (Q2768052) (← links)
- Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming (Q2786313) (← links)
- Computational methods for solving nonconvex block-separable constrained quadratic problems (Q2810546) (← links)
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs (Q3396382) (← links)
- Optimal Information Blending with Measurements in the <i>L</i><sup>2</sup> Sphere (Q3465948) (← links)
- Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron (Q3978620) (← links)
- Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets (Q4509736) (← links)
- Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs (Q4995063) (← links)
- Adaptive computable approximation to cones of nonnegative quadratic functions (Q5169468) (← links)
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs (Q5746688) (← links)
