Keywords
Semidefinite programmingMathematicsSemidefinite embeddingBounded functionExplained sum of squaresReal algebraic geometryConvex optimizationAlgebraic numberHierarchyConstructiveAlgebra over a fieldConic optimizationDiscrete mathematicsRegular polygonMathematical optimizationQuadratically constrained quadratic programPure mathematicsConvex analysisQuadratic programmingMathematical analysisComputer science
Affiliated Institutions
Related Publications
Image Superresolution Using Support Vector Regression
A thorough investigation of the application of support vector regression (SVR) to the superresolution problem is conducted through various frameworks. Prior to the study, the SV...
Publication Info
- Year
- 2003
- Type
- article
- Volume
- 96
- Issue
- 2
- Pages
- 293-320
- Citations
- 1549
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
1549
OpenAlex
Cite This
Pablo A. Parrilo
(2003).
Semidefinite programming relaxations for semialgebraic problems.
Mathematical Programming
, 96
(2)
, 293-320.
https://doi.org/10.1007/s10107-003-0387-5
Identifiers
- DOI
- 10.1007/s10107-003-0387-5