Preprocessing sparse semidefinite programs via matrix completion

Author： Fujisawa Katsuki   Fukuda Mituhiro   Nakata Kazuhide  

Publisher： Taylor & Francis Ltd

ISSN： 1055-6788

Source： Optimization Methods and Software, Vol.21, Iss.1, 2006-02, pp. : 17-39

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

A sensitivity result for semidefinite programs

By Freund R.W.   Jarre F.  

Operations Research Letters, Vol. 32, Iss. 2, 2004-03 ,pp. : 126-132

Elsevier

Access to resources Recommend Favorite

Solving semidefinite programs using preconditioned conjugate gradients

By Wolkowicz Henry  

Optimization Methods and Software, Vol. 19, Iss. 6, 2004-12 ,pp. : 653-672

Taylor & Francis Ltd

Access to resources Recommend Favorite

Successive Linearization Methods for Nonlinear Semidefinite Programs

By Kanzow Christian   Nagel Christian   Kato Hirokazu   Fukushima Masao  

Computational Optimization and Applications, Vol. 31, Iss. 3, 2005-07 ,pp. : 251-273

Springer Publishing Company

Access to resources Recommend Favorite

On a special class of regularized central paths for semidefinite programs

By Lin Anhua  

Mathematical Programming, Vol. 122, Iss. 1, 2010-03 ,pp. : 65-85

Elsevier

Access to resources Recommend Favorite

The unique square root of a positive semidefinite matrix

By Koeber Martin   Schäfer Uwe  

International Journal of Mathematical Education in Science and Technology, Vol. 37, Iss. 8, 2006-12 ,pp. : 990-992

Taylor & Francis Ltd

Access to resources Recommend Favorite