Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation.
type: Item
instance of: scholarly article
title: Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation.
zbMATH Open document ID: 1050.90571
author: Shinji Mizuno
author: Florian Jarre
published in: Mathematical Programming. Series A. Series B
publication date: 2000-07-21T00:00:00Z
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 1479722
zbMATH Keywords: linear programming problem
zbMATH Keywords: interior-point method
zbMATH Keywords: primal-dual
zbMATH Keywords: convergence
zbMATH Keywords: inexact computation
describes a project that uses: PDNET
MaRDI profile type: Publication
full work available at URL: s10107980020a
OpenAlex ID: W1237127655
DOI: 10.1007/S10107980020A
description: scientific article; zbMATH DE number 1479722