Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
type: Item
instance of: scholarly article
title: Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
zbMATH Open document ID: 1148.90350
author: Silvana Bocanegra
author: F. F. Campos
author: Aurelio R. L. Oliveira
published in: Computational Optimization and Applications
publication date: 2007-08-27T00:00:00Z
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 5182950
zbMATH Keywords: Interior point methods
zbMATH Keywords: Preconditioning
zbMATH Keywords: Ill-conditioned systems
describes a project that uses: PDNET
describes a project that uses: QAPLIB
describes a project that uses: HOPDM
describes a project that uses: PCx
describes a project that uses: NETLIB LP Test Set
MaRDI profile type: MaRDI publication profile
full work available at URL: s10589-006-9009-5
OpenAlex ID: W2146296113
cites work: Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
cites work: An implementation of Karmarkar's algorithm for linear programming
cites work: Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
cites work: Q4532048
cites work: Solution of large‐scale weighted least‐squares problems
cites work: Numerical solution of saddle point problems
cites work: Preconditioning indefinite systems in interior point methods for optimization
cites work: 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
cites work: PCx: an interior-point code for linear programming
cites work: Q5493573
cites work: Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems
cites work: On Best Conditioned Matrices
cites work: An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
cites work: Preconditioners for Indefinite Systems Arising in Optimization
cites work: HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
cites work: Multiple centrality corrections in a primal-dual method for linear programming
cites work: On the solution of equality constrained quadratic programming problems arising in optimization
cites work: An improved incomplete Cholesky factorization
cites work: QAPLIB-A quadratic assignment problem library
cites work: Constraint Preconditioning for Indefinite Linear Systems
cites work: On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
cites work: An Incomplete Factorization Technique for Positive Definite Linear Systems
cites work: On the Implementation of a Primal-Dual Interior Point Method
cites work: Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
cites work: A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
cites work: Location, scheduling, design and integer programming
cites work: Q4953319
cites work: An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
cites work: Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
DOI: 10.1007/S10589-006-9009-5
description: scientific article; zbMATH DE number 5182950