Solving polynomial least squares problems via semidefinite programming relaxations
| Year of publication: |
2010
|
|---|---|
| Authors: | Kim, Sunyoung ; Kojima, Masakazu |
| Published in: |
Journal of Global Optimization. - Springer. - Vol. 46.2010, 1, p. 1-23
|
| Publisher: |
Springer |
| Subject: | Nonconvex optimization problems | Polynomial least squares problems | Polynomial semidefinite programs | Polynomial second-order cone programs | Sparsity |
-
On computational search for optimistic solutions in bilevel problems
Strekalovsky, Alexander, (2010)
-
Confidence sets based on penalized maximum likelihood estimators
Pötscher, Benedikt M., (2008)
-
SDP RELAXATIONS FOR QUADRATIC OPTIMIZATION PROBLEMS DERIVED FROM POLYNOMIAL OPTIMIZATION PROBLEMS
MEVISSEN, MARTIN, (2010)
- More ...
-
Kim, Sunyoung, (2025)
-
A General Framework for Convex Relaxation of Polynomial Optimization Problems over Cones
Kojima, Masakazu, (2003)
-
Sparse Second Order Cone Programming Formulations for Convex Optimization Problems
Kobayashi, Kazuhiro, (2008)
- More ...