On the Modification of LDL T Factorizations

DOI10.2307/2005366zbMath0293.65018WikidataQ114042857 ScholiaQ114042857MaRDI QIDQ4045505

Roger Fletcher, M. J. D. Powell

Publication date: 1974

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2005366

Mathematics Subject Classification ID

15A24: Matrix equations and identities

65F05: Direct numerical methods for linear systems and matrix inversion

Related Items

A restricted trust region algorithm for unconstrained optimization, A physical interpretation of factorization and factor modification in structural analysis, A quasi-Newton method with sparse triple factorization for unconstrained minimization, A parallel unconstrained quasi-Newton algorithm and its performance on a local memory parallel computer, An active set RQP algorithm for engineering design optimization, Computing Karmarkar projections quickly, Least squares modifications with inverse factorizations: Parallel implications, Computational experience with methods for estimating sparse hessians for nonlinear optimization, Partitioned variable metric updates for large structured optimization problems, Pivoting strategy for rank-one modification of \(LDM^ t\)-like factorization, Measurement updating using the U-D factorization, Numerical comparison of several variable metric algorithms, A total least squares method for Toeplitz systems of equations, Newton's method for linear inequality systems, Product-form Cholesky factorization in interior point methods for second-order cone programming, Computing Karmarkar's projections quickly by using matrix factorization, Stability analysis of a general Toeplitz system solver, A perturbation analysis of the problem of downdating a Cholesky factorization, A modification to the LINPACK downdating algorithm, Updating $LU$ Factorizations for Computing Stationary Distributions, Updating conjugate directions by the BFGS formula, A new arc algorithm for unconstrained optimization