Derivation of the Lewenstein–Sanpera Decomposition via Semidefinite Programming

Author： Jafarizadeh M.   Mirzaee M.   Rezaee M.  

Publisher： Springer Publishing Company

ISSN： 1570-0755

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

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

Solving polynomial least squares problems via semidefinite programming relaxations

By Kim Sunyoung   Kojima Masakazu  

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

Springer Publishing Company

Access to resources Recommend Favorite

Ensemble clustering using semidefinite programming with applications

By Singh Vikas   Mukherjee Lopamudra   Peng Jiming   Xu Jinhui  

Machine Learning, Vol. 79, Iss. 1-2, 2010-05 ,pp. : 177-200

Springer Publishing Company

Access to resources Recommend Favorite

Unsupervised Learning of Image Manifolds by Semidefinite Programming

By Weinberger Kilian   Saul Lawrence  

International Journal of Computer Vision, Vol. 70, Iss. 1, 2006-10 ,pp. : 77-90

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

Stochastic semidefinite programming: a new paradigm for stochastic optimization

By Ariyawansa K.   Zhu Yuntao  

4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol. 4, Iss. 3, 2006-09 ,pp. : 239-253

Springer Publishing Company

Access to resources Recommend Favorite