Primal-dual target-following algorithms for linear programming
type: Item
instance of: scholarly article
title: Primal-dual target-following algorithms for linear programming
zbMATH Open document ID: 0848.90083
DOI: 10.1007/BF02206817
author: C. Roos
author: Jean-Philippe Vial
author: Benjamin Jansen
author: Tamás Terlaky
published in: Annals of Operations Research
publication date: 1996-10-24T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 894984
zbMATH Keywords: interior-point method
zbMATH Keywords: primal-dual method
zbMATH Keywords: targe-following
zbMATH Keywords: centering
zbMATH Keywords: Dikin steps
zbMATH Keywords: optimality
zbMATH Keywords: centrality
zbMATH Keywords: convergence analysis
MaRDI profile type: Publication
cites work: A geometric view of parametric linear programming
cites work: A scaling technique for finding the weighted analytic center of a polytope
cites work: The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
cites work: Q5749159
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem
cites work: On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
cites work: On the Convergence of the Mizuno--Todd--Ye Algorithm to the Analytic Center of the Solution Set
cites work: On the Quadratic Convergence of the Simplified Mizuno--Todd--Ye Algorithm for Linear Programming
cites work: Path-Following Methods for Linear Programming
cites work: The use of the optimal partition in a linear programming solution for postoptimal analysis
cites work: Q4296156
cites work: A Polynomial Method of Weighted Centers for Convex Quadratic Programming
cites work: A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems
cites work: A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
cites work: The theory of linear programming:skew symmetric self-dual problems and the central path*
cites work: Primal-dual algorithms for linear programming based on the logarithmic barrier method
cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary
cites work: Q3491304
cites work: An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
cites work: AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM
cites work: Q5750715
cites work: A new polynomial time method for a linear complementarity problem
cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms 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 Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
cites work: Q4739657
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: A polynomial method of approximate centers for linear programming
cites work: An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
full work available at URL: https://doi.org/10.1007/bf02206817
OpenAlex ID: W1985564371
description: scientific article; zbMATH DE number 894984