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 15 items.
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization (Q721146) (← links)
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← 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)
- An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation (Q2044572) (← links)
- Optimization and operations research in mitigation of a pandemic (Q2158111) (← 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)
- Optimal Information Blending with Measurements in the <i>L</i><sup>2</sup> Sphere (Q3465948) (← links)
- Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs (Q4995063) (← links)
- Adaptive computable approximation to cones of nonnegative quadratic functions (Q5169468) (← links)
