Solving polynomial least squares problems via semidefinite programming relaxations.
Sunyoung KimMasakazu KojimaPublished in: J. Glob. Optim. (2010)
Keyphrases
- semidefinite programming
- semidefinite
- least squares
- linear programming
- nonlinear programming
- positive semidefinite
- kernel matrix
- quadratically constrained quadratic
- solving problems
- interior point methods
- feature extraction
- convex relaxation
- collaborative filtering
- np hard
- linear programming problems
- lower bound
- computational complexity