On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms
Data up to Jan 2025
Total Citations Per Year
Abstract
References (13)
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
1996 • 7,581 citations
A new polynomial-time algorithm for linear programming
1984 • 4,898 citations
A characterization of superlinear convergence and its application to quasi-Newton methods
1974 • 673 citations
Pathways to the Optimal Set in Linear Programming
1989 • 585 citations
A Primal-Dual Interior Point Algorithm for Linear Programming
1989 • 490 citations
Interior path following primal-dual algorithms. part I: Linear programming
1989 • 482 citations
An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming
2006 • 359 citations
Computational experience with a primal-dual interior point method for linear programming
1991 • 317 citations
An Implementation of a Primal-Dual Interior Point Method for Linear Programming
1989 • 210 citations
Feasibility issues in a primal-dual interior-point method for linear programming
1990 • 166 citations
Further Development of a Primal-Dual Interior Point Method
1990 • 67 citations
An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming
1992 • 34 citations
Numerical optimisation of dynamic systems
1980 • 14 citations