Pages that link to "Item:Q4441957"
From MaRDI portal
The following pages link to Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation (Q4441957):
Displaying 13 items.
- Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints (Q625653) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming (Q902804) (← links)
- Lower-order penalization approach to nonlinear semidefinite programming (Q995945) (← links)
- Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints (Q1785385) (← links)
- Chebyshev center of the intersection of balls: complexity, relaxation and approximation (Q2020607) (← links)
- Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension (Q2045012) (← links)
- Comment on: ``Approximation algorithms for quadratic programming'' (Q2165269) (← links)
- Conic relaxation approaches for equal deployment problems (Q2297663) (← links)
- Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem (Q2311115) (← links)
- Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (Q2475315) (← links)
- Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints (Q4909732) (← links)
- A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity (Q5084603) (← links)
