Convergence Analysis of an Inexact Infeasible Interior Point Method for Semidefinite Programming

Author： Bellavia Stefania   Pieraccini Sandra  

Publisher： Springer Publishing Company

ISSN： 0926-6003

Source： Computational Optimization and Applications, Vol.29, Iss.3, 2004-12, pp. : 289-313

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

Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming

By Zhang Lipu  

Optimization, Vol. 62, Iss. 2, 2013-02 ,pp. : 169-191

Taylor & Francis Ltd

Access to resources Recommend Favorite

Superlinear Convergence of Interior-Point Algorithms for Semidefinite Programming

By Potra F.A.   Sheng R.  

Journal of Optimization Theory and Applications, Vol. 99, Iss. 1, 1998-10 ,pp. : 103-119

Springer Publishing Company

Access to resources Recommend Favorite

Inexact Interior-Point Method

By Bellavia S.  

Journal of Optimization Theory and Applications, Vol. 96, Iss. 1, 1998-01 ,pp. : 109-121

Springer Publishing Company

Access to resources Recommend Favorite

An Infeasible Interior-Point Method with Nonmonotonic Complementarity Gaps

By Gasparo Maria Grazia   Pieraccini Sandra   Armellini Alessandro  

Optimization Methods and Software, Vol. 17, Iss. 4, 2002-01 ,pp. : 561-586

Taylor & Francis Ltd

Access to resources Recommend Favorite

A New Wide Neighborhood Primal–Dual Infeasible-Interior-Point Method for Symmetric Cone Programming

By Liu Hongwei   Yang Ximei   Liu Changhe  

Journal of Optimization Theory and Applications, Vol. 158, Iss. 3, 2013-09 ,pp. : 796-815

Springer Publishing Company

Access to resources Recommend Favorite