Computational results of an interior point algorithm for large scale linear programming

DOI10.1007/BF01582905zbMath0739.90042MaRDI QIDQ1181915

K. G. Ramakrishnan, Narendra K. Karmarkar

Publication date: 27 June 1992

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

preconditioned conjugate gradient methodcomputational resultsimplementationdual projective algorithmreciprocal estimates

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (17)

Computational experience with a dual affine variant of Karmarkar's method for linear programming ⋮ On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods ⋮ Unnamed Item ⋮ A survey for the quadratic assignment problem ⋮ A QMR-based interior-point algorithm for solving linear programs ⋮ Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds ⋮ On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems ⋮ Fortran subroutines for network flow optimization using an interior point algorithm ⋮ Implementing cholesky factorization for interior point methods of linear programming ⋮ Greedy randomized adaptive search procedures ⋮ A weighted least squares study of robustness in interior point linear programming ⋮ Les effets de l'exposant de la fonction barrière multiplicative dans les méthodes de points intérieurs ⋮ Optimization of template-driven scheduling mechanisms: Regularity measures and computational techniques ⋮ Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning ⋮ Symbiosis between linear algebra and optimization ⋮ On the expected optimal value of random assignment problems: Experimental results and open questions ⋮ Active-set prediction for interior point methods using controlled perturbations

Uses Software

• LSQR
• KORBX
• MINOS
• LOLIB
• CRAIG

Cites Work

• A new polynomial-time algorithm for linear programming
• Computational experience with a primal-dual interior point method for linear programming
• Computational experience with a dual affine variant of Karmarkar's method for linear programming
• Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
• A relaxed version of Karmarkar's method
• An implementation of Karmarkar's algorithm for linear programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• On the acyclic subgraph polytope
• A variable-metric variant of the Karmarkar algorithm for linear programming
• The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
• Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computational results of an interior point algorithm for large scale linear programming