A Unified Class of Directly Solvable Semidefinite Programming Problems

Author： Muramatsu Masakazu  

Publisher： Springer Publishing Company

ISSN： 0254-5330

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

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

Constraint qualification in a general class of Lipschitzian mathematical programming problems

By Zishuang Tong   Zheng X.  

Journal of Global Optimization, Vol. 38, Iss. 4, 2007-08 ,pp. : 625-635

Springer Publishing Company

Access to resources Recommend Favorite

Optimality conditions and duality for a class of nondifferentiable multi-objective fractional programming problems

By Liu Sanming   Feng Enmin  

Journal of Global Optimization, Vol. 38, Iss. 4, 2007-08 ,pp. : 653-666

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