Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization
type: Item
instance of: scholarly article
title: Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization
zbMATH Open document ID: 1325.65042
author: D. Orban
published in: Numerical Algorithms
publication date: 2015-10-13T00:00:00Z
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 65F08
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 6493749
zbMATH Keywords: preconditioning
zbMATH Keywords: symmetric quasi definite
zbMATH Keywords: incomplete factorization
zbMATH Keywords: limited-memory factorization
zbMATH Keywords: interior-point methods
zbMATH Keywords: quadratic optimization
zbMATH Keywords: numerical result
describes a project that uses: HSL
describes a project that uses: CUTEr
describes a project that uses: mctoolbox
describes a project that uses: PDCO
describes a project that uses: Spot
describes a project that uses: NETLIB LP Test Set
describes a project that uses: SYM-ILDL
describes a project that uses: HSL_MI28
describes a project that uses: KNITRO
describes a project that uses: SifDec
describes a project that uses: Ipopt
MaRDI profile type: Publication
full work available at URL: s11075-014-9933-x
OpenAlex ID: W2069715122
cites work: An Approximate Minimum Degree Ordering Algorithm
cites work: Q3993534
cites work: Optimization Viewpoint on Kalman Smoothing with Applications to Robust and Sparse Estimation
cites work: Iterative Solution of Symmetric Quasi-Definite Linear Systems
cites work: Iterative Solution Methods
cites work: Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
cites work: A stable method for the incomplete factorization of H-matrices
cites work: Q5493572
cites work: A linear time implementation of the reverse Cuthill-McKee algorithm
cites work: On generalized successive overrelaxation methods for augmented linear systems
cites work: An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
cites work: Benchmarking optimization software with performance profiles.
cites work: Implicit-Factorization Preconditioning and Iterative Solvers for Regularized Saddle-Point Systems
cites work: Q5702543
cites work: Q3832834
cites work: A primal-dual regularized interior-point method for convex quadratic programs
cites work: An improved incomplete Cholesky factorization
cites work: Q4328333
cites work: Q5689624
cites work: CUTEr and SifDec
cites work: On the Aharonov-Bohm Hamiltonian
cites work: SYM-ILDL
cites work: Deficiency indices and singular boundary conditions in quantum mechanics
cites work: On the rate of convergence of a positive approximation process
cites work: Accuracy and Stability of Numerical Algorithms
cites work: An Incomplete Factorization Technique for Positive Definite Linear Systems
cites work: An extremal plurisubharmonic function associated to a convex pluricomplex Green function with pole at infinity.
cites work: High quality preconditioning of a general symmetric positive definite matrix based on its \(U^T U + U^T R + R^T U\)-decomposition
cites work: Crout Versions of ILU for General Sparse Matrices
cites work: Crout versions of ILU factorization with pivoting for sparse symmetric matrices
cites work: Pattern formation in the one-dimensional Gray - Scott model
cites work: Nano boundary layers over stretching surfaces
cites work: Q4531870
cites work: On the Implementation of a Primal-Dual Interior Point Method
cites work: On the stability of the incomplete LU-factorizations and characterizations of \(H\)-matrices
cites work: Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
cites work: Q3993065
cites work: Solution of Sparse Indefinite Systems of Linear Equations
cites work: On a series representation for Carleman orthogonal polynomials
cites work: A new preconditioning technique for solving large sparse linear systems
cites work: A note on the LDL\(^{T}\) decomposition of matrices from saddle-point problems
cites work: Symmetric Quasidefinite Matrices
cites work: An interior-point algorithm for nonconvex nonlinear programming
cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
DOI: 10.1007/S11075-014-9933-X