Methods for Modifying Matrix Factorizations

DOI10.2307/2005923zbMath0289.65021MaRDI QIDQ4778230

Gene H. Golub, Philip E. Gill, Michael A. Saunders, Walter Murray

Publication date: 1974

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

Mathematics Subject Classification ID

90C30: Nonlinear programming

90C20: Quadratic programming

90C05: Linear programming

15A39: Linear inequalities of matrices

15A06: Linear equations (linear algebraic aspects)

Related Items

Computational Experiments and Techniques for the Penalty Method with Extrapolation, An algorithm for hierarchical optimization of large-scale problems with nested structure, The unitary completion and QR iterations for a class of structured matrices, A numerically stable dual method for solving strictly convex quadratic programs, A physical interpretation of factorization and factor modification in structural analysis, A quasi-Newton method with sparse triple factorization for unconstrained minimization, Solving the minimal least squares problem subject to bounds on the variables, A quasi-Newton method with modification of one column per iteration, Fast block Toeplitz orthogonalization, QR factorization of Toeplitz matrices, Householder reflections versus Givens rotations in sparse orthogonal decomposition, The QR algorithm for unitary Hessenberg matrices, On estimating the condition of eigenvalues and eigenvectors, Analysis of a recursive least squares hyperbolic rotation algorithm for signal processing, The simplex method is not always well behaved, A direct method for sparse least squares problems with lower and upper bounds, Parallel quasi-Newton methods for unconstrained optimization, Linearly constrained optimization, Least squares modifications with inverse factorizations: Parallel implications, A dual projective simplex method for linear programming, Algorithms for roundoff error analysis - a relative error approach, A quasi-Newton method with Cholesky factorization, Computational methods of linear algebra, Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition, A computational method for the indefinite quadratic programming problem, On the orthogonal factorization and its updating in band-structured matrix computations, Partitioned quasi-Newton methods for nonlinear equality constrained optimization, Tracking the condition number for RLS in signal processing, Adaptive Lanczos methods for recursive condition estimation, A nonlinear optimization approach for solving facility layout problems, A quasi-Gauss-Newton method for solving nonlinear algebraic equations, Discrete, linear approximation problems in polyhedral norms, Measurement updating using the U-D factorization, Pivoting techniques for symmetric Gaussian elimination, Unified approach to unconstrained minimization via basic matrix factorizations, A method for updating Cholesky factorization of a band matrix, A geometric method in nonlinear programming, Block RLS using row Householder reflections, A total least squares method for Toeplitz systems of equations, A modified layered-step interior-point algorithm for linear programming, Analysis and implementation of a dual algorithm for constrained optimization, Rank-\(k\) modification methods for recursive least squares problems, A modification of the Dewilde-van der Veen method for inversion of finite structured matrices, Algebraic and numerical techniques for the computation of matrix determinants, Accuracy-enhancing methods for balancing-related frequency-weighted model and controller reduction., Computational methods for modifying seemingly unrelated regressions models., Obtaining simultaneous solutions of linear subsystems of inequalities and duals, Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations, Stability analysis of the method of seminormal equations for linear least squares problems, On systolic arrays for updating the Cholesky factorization, Round-off error propagation in four generally-applicable, recursive, least-squares estimation schemes, Efficient algorithms for block downdating of least squares solutions, Fast Toeplitz orthogonalization, An iterative working-set method for large-scale nonconvex quadratic programming, On incremental and robust subspace learning, The convergence of quasi-Gauss-Newton methods for nonlinear problems, Stability analysis of a general Toeplitz system solver, An algorithm and stability theory for downdating the ULV decomposition, Accurate downdating of a modified Gram-Schmidt QR decomposition, Perturbation and error analyses for block downdating of a Cholesky decomposition, A projective simplex algorithm using LU decomposition, A note on Hammarling's algorithm for the discrete Lyapunov equation, A perturbation analysis of the problem of downdating a Cholesky factorization, Fast QR factorization of Cauchy-like matrices, Perturbation scheme for online learning of features: Incremental principal component analysis, An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming, A modification to the LINPACK downdating algorithm, A quadratically convergent method for minimizing a sum of euclidean norms, A weighted gram-schmidt method for convex quadratic programming, Equivalence of some quadratic programming algorithms, On QR factorization updatings, Optimization of unconstrained functions with sparse Hessian matrices—Quasi-Newton methods, Procedures for optimization problems with a mixture of bounds and general linear constraints, Updating $LU$ Factorizations for Computing Stationary Distributions, The computation of Lagrange-multiplier estimates for constrained minimization, An equivalence between two algorithms for quadratic programming, Modifications and implementation of the ellipsoid algorithm for linear programming, A critical index algorithm for nearest point problems on simplicial cones, Error Analysis of Some Techniques for Updating Orthogonal Decompositions, Direct Secant Updates of Matrix Factorizations, Newton-type methods for unconstrained and linearly constrained optimization, Chebyshev solution of overdetermined systems of linear equations, Matrix augmentation and partitioning in the updating of the basis inverse, Numerically stable methods for quadratic programming, Matrix factorizations in optimization of nonlinear functions subject to linear constraints, Large-scale linearly constrained optimization, A note on the efficient solution of matrix pencil systems, On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduation, Factorized Variable Metric Methods for Unconstrained Optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Triangular factors of modified matrices
• The QR algorithm for real Hessenberg matrices
• Least Squares Computations by Givens Transformations Without Square Roots
• Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
• The least squares problem and pseudo-inverses
• Quasi-Newton Methods for Unconstrained Optimization