A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming

DOI10.1007/s10589-013-9572-5zbMath1287.90030OpenAlexW2167874188MaRDI QIDQ2636608

María D. González-Lima, Danilo Elias Oliveira, Aurelio Ribeiro Leite Oliveira

Publication date: 30 January 2014

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

Full work available at URL: https://doi.org/10.1007/s10589-013-9572-5

zbMATH Keywords

linear programminglinear systemsprimal-dual interior point methods

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Related Items (1)

Sparsity preserving preconditioners for linear systems in interior-point methods

Uses Software

• LSQR
• HOPDM
• CRAIG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A stable primal-dual approach for linear programming under nondegeneracy assumptions
• HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
• DEA/AR profit ratios and sensitivity of 100 large U. S. banks
• A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
• On the construction of strong complementarity slackness solutions for DEA linear programming problems using a primal-dual interior-point method
• Stabilization of interior-point methods for linear programming
• An implementation of Karmarkar's algorithm for linear programming
• Preconditioning indefinite systems in interior point methods for optimization
• On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
• A primal-dual interior-point algorithm for quadratic programming
• Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming
• Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
• A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• On the Implementation of a Primal-Dual Interior Point Method
• 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
• An Efficient Solver for Multi--Right-Hand-Side Linear Systems Based on the CCCG($\eta$) Method with Applications to Implicit Time-Dependent Partial Differential Equations
• PCx: an interior-point code for linear programming
• On the Identification of Zero Variables in an Interior-Point Framework
• Benchmarking optimization software with performance profiles.

This page was built for publication: A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming