Solving polynomial least squares problems via semidefinite programming relaxations

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.46, Iss.1, 2010-01, pp. : 1-23

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems

By Blum A. Konjevod G. Ravi R. Vempala S.

Theoretical Computer Science, Vol. 235, Iss. 1, 2000-03 ,pp. : 25-42

Elsevier

Access to resources Recommend Favorite

On lattice reduction algorithms for solving weighted integer least squares problems: comparative study

By Jazaeri Shahram Amiri-Simkooei Alireza Sharifi Mohammad

GPS Solutions, Vol. 18, Iss. 1, 2014-01 ,pp. : 105-114

Springer Publishing Company

Access to resources Recommend Favorite

Derivation of the Lewenstein–Sanpera Decomposition via Semidefinite Programming

By Jafarizadeh M. Mirzaee M. Rezaee M.

Quantum Information Processing, Vol. 4, Iss. 3, 2005-08 ,pp. : 199-218

Springer Publishing Company

Access to resources Recommend Favorite

A Unified Class of Directly Solvable Semidefinite Programming Problems

By Muramatsu Masakazu

Annals of Operations Research, Vol. 133, Iss. 1-4, 2005-01 ,pp. : 85-97

Springer Publishing Company

Access to resources Recommend Favorite

Parallel Implementation of a Least-Squares Spectral Element Solver for Incompressible Flow Problems: Iterative Solving Environments and Optimization Techniques for Scientific Applications

By Nool Margreet Proot Michael M. J.

The Journal of Supercomputing, Vol. 28, Iss. 2, 2004-05 ,pp. : 135-148

Springer Publishing Company

Access to resources Recommend Favorite