Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming
type: Item
instance of: scholarly article
title: Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming
zbMATH Open document ID: 0994.65050
DOI: 10.1016/S0168-9274(01)00119-2
author: Shao-Liang Zhang
author: Kazuhide Nakata
author: Masakazu Kojima
published in: Applied Numerical Mathematics
publication date: 2002-05-21T00:00:00Z
Mathematics Subject Classification ID: 65F35
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 1743067
zbMATH Keywords: large and dense linear systems
zbMATH Keywords: interior-point method
zbMATH Keywords: semidefinite programming
zbMATH Keywords: iterative methods
zbMATH Keywords: incomplete orthogonalization preconditioners
zbMATH Keywords: conjugate gradient method
zbMATH Keywords: numerical experiments
describes a project that uses: CSDP
describes a project that uses: SDPA
describes a project that uses: SDPpack
describes a project that uses: SDPHA
describes a project that uses: SDPT3
describes a project that uses: CIMGS
describes a project that uses: Sp
MaRDI profile type: Publication
cites work: Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
cites work: CSDP 2.3 user's guide
cites work: Q4496019
cites work: Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
cites work: An Interior-Point Method for Semidefinite Programming
cites work: Methods of conjugate gradients for solving linear systems
cites work: Incomplete Methods for Solving $A^T Ax = b$
cites work: Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
cites work: An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
cites work: Primal--Dual Path-Following Algorithms for Semidefinite Programming
cites work: A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
cites work: Sdpha: a Matlab implementation of homogeneous interior-point algorithms for semidefinite programming
cites work: Preconditioning techniques for nonsymmetric and indefinite linear systems
cites work: Semidefinite Programming
cites work: CIMGS: An Incomplete Orthogonal FactorizationPreconditioner
cites work: Q5691079
cites work: Semidefinite programming relaxations for the quadratic assignment problem
cites work: Solving large and sparse linear least-squares problems by conjugate gradient algorithms
full work available at URL: s0168-9274(01)00119-2
OpenAlex ID: W2032229464
Recommended article: Q5436098
Recommended article: Preconditioned GMRES methods with incomplete Givens orthogonalization method for large sparse least-squares problems
Recommended article: Pseudoinverse preconditioners and iterative methods for large dense linear least-squares problems
Recommended article: Preconditioning indefinite systems in interior point methods for large scale linear optimisation
Recommended article: Numerical study on incomplete orthogonal factorization preconditioners
Recommended article: A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization
Recommended article: A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
Recommended article: An Incomplete Cholesky Preconditioner Based on Orthogonal Approximations
Recommended article: Q4945783
Recommended article: Q4351596
description: scientific article; zbMATH DE number 1743067