On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems
From MaRDI portal
Publication:4870621
DOI10.1137/S0895479893252623zbMath0878.49020MaRDI QIDQ4870621
Joseph R. Shinnerl, Philip E. Gill, Michael A. Saunders
Publication date: 27 March 1996
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
linear programmingbackward stabilityindefinite systemsconstrained optimization problemssymmetric quasidefinite systemsunsymmetric positive definite systems
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
A regularized interior-point method for constrained linear least squares, Mixed precision algorithms in numerical linear algebra, A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows, Preconditioning Linear Least-Squares Problems by Identifying a Basis Matrix, Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number, Solvers for Systems of Linear Algebraic Equations with Block-Band Matrices, Inner solvers for interior point methods for large scale nonlinear programming, Solution of sparse rectangular systems using LSQR and Craig, CVXGEN: a code generator for embedded convex optimization, On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems, Matrix-free interior point method, Perturbation analysis for the generalized Cholesky factorization., Accelerating the Solution of Linear Systems by Iterative Refinement in Three Precisions, Backward stability analysis of weighted linear least-squares problems, Implementing a Smooth Exact Penalty Function for Equality-Constrained Nonlinear Optimization, Perturbation theory for the eigenvalues of factorised symmetric matrices, A sparse proximal implementation of the LP dual active set algorithm, A primal-dual regularized interior-point method for convex quadratic programs, A note on the perturbation analysis for the generalized Cholesky factorization, The factorability of symmetric matrices and some implications for statistical linear models, An efficient implementation of the ensemble Kalman filter based on an iterative Sherman-Morrison formula, On the minimum convergence factor of a class of GSOR-like methods for augmented systems, Numerical solution of 2 × 2 block linear systems by block Gram–Schmidt methods, Perturbation analysis of saddle-point problems, Parameter modified versions of preconditioning and iterative inner product free refinement methods for two-by-two block matrices, \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria, Cholesky-Like Factorization of Symmetric Indefinite Matrices and Orthogonalization with Respect to Bilinear Forms, Modifying the inertia of matrices arising in optimization, Inertia-controlling factorizations for optimization algorithms, A primal–dual regularized interior-point method for semidefinite programming
Uses Software
