Limited-memory LDL^ factorization of symmetric quasi-definite matrices with application to constrained optimization
From MaRDI portal
Publication:745223
Recommendations
- Symmetric Quasidefinite Matrices
- On partial Cholesky factorization and a variant of quasi-Newton preconditioners for symmetric positive definite matrices
- Limited memory preconditioners for symmetric indefinite problems with application to structural mechanics
- Numerically stable LDLT factorizations in interior point methods for convex quadratic programming
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
Cites work
- A linear time implementation of the reverse Cuthill-McKee algorithm
- A new preconditioning technique for solving large sparse linear systems
- A note on the LDL\(^{T}\) decomposition of matrices from saddle-point problems
- A primal-dual regularized interior-point method for convex quadratic programs
- A stable method for the incomplete factorization of H-matrices
- Accuracy and Stability of Numerical Algorithms
- An Approximate Minimum Degree Ordering Algorithm
- An extremal plurisubharmonic function associated to a convex pluricomplex Green function with pole at infinity.
- An improved incomplete Cholesky factorization
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- An interior-point algorithm for nonconvex nonlinear programming
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Benchmarking optimization software with performance profiles.
- Crout versions of ILU factorization with pivoting for sparse symmetric matrices
- Crout Versions of ILU for General Sparse Matrices
- CUTEr and SifDec
- Deficiency indices and singular boundary conditions in quantum mechanics
- High quality preconditioning of a general symmetric positive definite matrix based on its U^T U + U^T R + R^T U-decomposition
- scientific article; zbMATH DE number 4109107 (Why is no real title available?)
- scientific article; zbMATH DE number 43693 (Why is no real title available?)
- scientific article; zbMATH DE number 44406 (Why is no real title available?)
- scientific article; zbMATH DE number 739279 (Why is no real title available?)
- scientific article; zbMATH DE number 1745051 (Why is no real title available?)
- scientific article; zbMATH DE number 5066287 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 2221749 (Why is no real title available?)
- Implicit-Factorization Preconditioning and Iterative Solvers for Regularized Saddle-Point Systems
- Iterative Solution Methods
- Iterative solution of symmetric quasi-definite linear systems
- Nano boundary layers over stretching surfaces
- On a series representation for Carleman orthogonal polynomials
- On generalized successive overrelaxation methods for augmented linear systems
- On the Aharonov-Bohm Hamiltonian
- On the Implementation of a Primal-Dual Interior Point Method
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the rate of convergence of a positive approximation process
- On the stability of the incomplete LU-factorizations and characterizations of \(H\)-matrices
- Optimization viewpoint on Kalman smoothing with applications to robust and sparse estimation
- Pattern formation in the one-dimensional Gray - Scott model
- Solution of Sparse Indefinite Systems of Linear Equations
- Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- SYM-ILDL: Incomplete LDL\(^{\mathrm T}\) factorization of symmetric indefinite and skew-symmetric matrices
- Symmetric Quasidefinite Matrices
Cited in
(7)- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- Numerically stable LDLT factorizations in interior point methods for convex quadratic programming
- Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- General-purpose preconditioning for regularized interior point methods
- Sparse linear least-squares problems
- Adaptive multilayer extreme learning machines
Describes a project that uses
Uses Software
This page was built for publication: Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q745223)
