Potential-reduction methods in mathematical programming
type: Item
instance of: scholarly article
title: Potential-reduction methods in mathematical programming
zbMATH Open document ID: 0881.90097
DOI: 10.1007/BF02614377
author: Michael J. Todd
published in: Mathematical Programming. Series A. Series B
publication date: 1997-07-23T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 1038502
zbMATH Keywords: self-concordant barriers
zbMATH Keywords: self-scaled barriers
zbMATH Keywords: survey
zbMATH Keywords: interior-point methods
zbMATH Keywords: potential-reduction methods
MaRDI profile type: Publication
cites work: A monotonic projective algorithm for fractional linear programming
cites work: A combined phase I-phase II projective algorithm for linear programming
cites work: A combined phase I-phase II scaled potential algorithm for linear programming
cites work: On the Performance of Karmarkar’s Algorithm over a Sequence of Iterations
cites work: On interior algorithms for linear programming with no regularity assumptions
cites work: Karmarkar's linear programming algorithm and Newton's method
cites work: On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise
cites work: Q4003375
cites work: Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
cites work: A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start''
cites work: A polynomial Newton method for linear programming
cites work: Polynomial affine algorithms for linear programming
cites work: Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method
cites work: Path-Following Methods for Linear Programming
cites work: On the convexity of the multiplicative version of Karmarkar's potential function
cites work: A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar’s Potential Function
cites work: A new polynomial-time algorithm for linear programming
cites work: An interior point potential reduction algorithm for the linear complementarity problem
cites work: An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
cites work: Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
cites work: Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem
cites work: O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming
cites work: Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
cites work: A primal-dual affine-scaling potential-reduction algorithm for linear programming
cites work: Superlinear primal-dual affine scaling algorithms for LCP
cites work: Q4324980
cites work: On the number of iterations of Karmarkar's algorithm for linear programming
cites work: On Anstreicher's combined phase I-phase II projective algorithm for linear programming
cites work: Combining phase I and phase II in a potential reduction algorithm for linear programming
cites work: An extension of Karmarkar's algorithm for linear programming using dual variables
cites work: A Centered Projective Algorithm for Linear Programming
cites work: Constant potential primal-dual algorithms: A framework
cites work: Semidefinite Programming
cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming
cites work: A Potential Reduction Algorithm Allowing Column Generation
cites work: Near boundary behavior of primal-dual potential reduction algorithms 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/bf02614377
OpenAlex ID: W2082909387
description: scientific article; zbMATH DE number 1038502