A General Framework for Establishing Polynomial Convergence of Long-Step Methods for Semidefinite Programming

Author： Burer Samuel   Monteiro Renato D.C.  

Publisher： Taylor & Francis Ltd

ISSN： 1055-6788

Source： Optimization Methods and Software, Vol.18, Iss.1, 2003-01, pp. : 1-38

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

Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming

By Wu Huixian   Luo Hezhi   Ding Xiaodong   Chen Guanting  

Computational Optimization and Applications, Vol. 56, Iss. 3, 2013-12 ,pp. : 531-558

Springer Publishing Company

Access to resources Recommend Favorite

A unifying framework for several cutting plane methods for semidefinite programming

By Krishnan Kartik   Mitchell John  

Optimization Methods and Software, Vol. 21, Iss. 1, 2006-02 ,pp. : 57-74

Taylor & Francis Ltd

Access to resources Recommend Favorite

Embedding methods for semidefinite programming

By Zhang Qinghong  

Optimization Methods and Software, Vol. 27, Iss. 3, 2012-06 ,pp. : 461-482

Taylor & Francis Ltd

Access to resources Recommend Favorite

Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization

By Waki Hayato  

Computational Optimization and Applications, Vol. 53, Iss. 3, 2012-12 ,pp. : 823-844

Springer Publishing Company

Access to resources Recommend Favorite

Real ideal and the duality of semidefinite programming for polynomial optimization

By Sekiguchi Yoshiyuki  

Japan Journal of Industrial and Applied Mathematics, Vol. 30, Iss. 2, 2013-06 ,pp. : 321-330

Springer Publishing Company

Access to resources Recommend Favorite