On a general class of interior-point algorithms for semidefinite programming with polynomial complexity and superlinear convergence
type: Item
instance of: scholarly article
title: On a general class of interior-point algorithms for semidefinite programming with polynomial complexity and superlinear convergence
zbMATH Open document ID: 0969.90066
author: Jun Ji
author: Florian A. Potra
author: Rongqin Sheng
published in: Methods and Applications of Analysis
publication date: 2001-01-14T00:00:00Z
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 1513210
zbMATH Keywords: predictor-corrector algorithms
zbMATH Keywords: semidefinite programming
zbMATH Keywords: globally convergent
zbMATH Keywords: superlinear convergence
zbMATH Keywords: infeasible-interior-point algorithm
describes a project that uses: SDPHA
MaRDI profile type: Publication
full work available at URL: maa.1999.v6.n4.a8
OpenAlex ID: W2733198502
DOI: 10.4310/MAA.1999.V6.N4.A8
description: scientific article; zbMATH DE number 1513210