A primal-dual interior-point method for linear programming based on a weighted barrier function

DOI10.1007/BF02192566zbMath0839.90078OpenAlexW1967307266MaRDI QIDQ1906738

Z. Y. Cheng, John E. Mitchell

Publication date: 6 February 1996

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02192566

zbMATH Keywords

polynomial convergencequadratic convergenceinterior-point methodssuperlinear convergenceprimal-dual interior-point methodmodified least-squares problem

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

• Unnamed Item
• A modification of Karmarkar's linear programming algorithm
• A scaling technique for finding the weighted analytic center of a polytope
• Convergence behavior of interior-point algorithms
• A new polynomial-time algorithm for linear programming
• Computational experience with a primal-dual interior point method for linear programming
• Interior path following primal-dual algorithms. I: Linear programming
• A survey of search directions in interior point methods for linear programming
• Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited
• Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
• On the Implementation of a Primal-Dual Interior Point Method
• On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms
• An Implementation of a Primal-Dual Interior Point Method for Linear Programming
• A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
• Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem
• A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming