Pages that link to "Item:Q1386484"
From MaRDI portal
The following pages link to Approximation algorithms for quadratic programming (Q1386484):
Displayed 4 items.
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Detecting redundancy in optimization problems over intersection of ellipsoids (Q4465477) (← links)
- Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints (Q4909732) (← links)
- LMI approximations for the radius of the intersection of ellipsoids: Survey. (Q5929424) (← links)