Solving a class of LP problems with a primal-dual logarithmic barrier method

DOI10.1016/0377-2217(93)E0323-PzbMath0928.90064MaRDI QIDQ1129972

Marek Makowski, Jacek Gondzio

Publication date: 16 August 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

interior point algorithmlarge real-life linear programmingprimal-dual logarithmic barrier method

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Linear programming (90C05) Interior-point methods (90C51)

Related Items (3)

Sparse Approximations with Interior Point Methods ⋮ An interior-point approach for primal block-angular problems ⋮ A preconditioning technique for Schur complement systems arising in stochastic optimization

Uses Software

• HOPDM
• MINOS
• OSL
• CHFACT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• HOPDM - a higher order primal-dual method for large scale linear programming
• Primal-dual algorithms for linear programming based on the logarithmic barrier method
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• Implementing cholesky factorization for interior point methods of linear programming
• On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
• Implementing the Simplex Method: The Initial Basis
• A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
• Implementing the simplex method for the Optimization Subroutine Library
• Implementing interior point linear programming methods in the Optimization Subroutine Library

This page was built for publication: Solving a class of LP problems with a primal-dual logarithmic barrier method