Methods for Computing and Modifying the LDV Factors of a Matrix

DOI10.2307/2005744zbMath0339.65022OpenAlexW4244238031MaRDI QIDQ4107841

Philip E. Gill, Walter Murray, Michael A. Saunders

Publication date: 1975

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

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

Mathematics Subject Classification ID

Nonlinear programming (90C30) Quadratic programming (90C20) Linear programming (90C05) Linear inequalities of matrices (15A39) Linear equations (linear algebraic aspects) (15A06) Orthogonalization in numerical linear algebra (65F25)

Related Items

On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids, The simplex method is not always well behaved, Least squares modifications with inverse factorizations: Parallel implications, A dual projective simplex method for linear programming, Pivoting strategy for rank-one modification of \(LDM^ t\)-like factorization, Sparse matrix factor modification in structural reanalysis, Product-form Cholesky factorization in interior point methods for second-order cone programming, Large-scale linearly constrained optimization, Computational methods for optimum design of large complex systems, Unnamed Item, Large-scale linear programming: Geometry, working bases and factorizations, Modifications and implementation of the ellipsoid algorithm for linear programming, An implementation of the simplex method for linear programming problems with variable upper bounds, The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis, The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. II. An efficient implementation with linear least squares subproblems, Variable metric methods for unconstrained optimization and nonlinear least squares, Stability analysis of the G-algorithm and a note on its applications to sparse least squares problems, Analysis and implementation of a dual algorithm for constrained optimization, An active set RQP algorithm for engineering design optimization