On well definedness of the central path
type: Item
instance of: scholarly article
title: On well definedness of the central path
zbMATH Open document ID: 0941.90061
DOI: 10.1023/A:1021768121263
author: L. M. Graña Drummond
author: B. F. Svaiter
published in: Journal of Optimization Theory and Applications
publication date: 1999-12-19T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 49M30
zbMATH DE Number: 1367929
zbMATH Keywords: convex programming
zbMATH Keywords: linear constraints
zbMATH Keywords: central path
zbMATH Keywords: logarithmic barrier function
zbMATH Keywords: analytic center
MaRDI profile type: Publication
cites work: Q3996571
cites work: A new polynomial-time algorithm for linear programming
cites work: A polynomial Newton method for linear programming
cites work: Interior path following primal-dual algorithms. I: Linear programming
cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming
cites work: A polynomial-time algorithm for a class of linear complementarity problems
cites work: Q4296156
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: Boundary Behavior of Interior Point Algorithms in Linear Programming
cites work: Central Paths, Generalized Proximal Point Methods, and Cauchy Trajectories in Riemannian Manifolds
cites work: Q4324980
cites work: Convex Analysis
full work available at URL: a:1021768121263
OpenAlex ID: W172506827
description: scientific article; zbMATH DE number 1367929