scientific article; zbMATH DE number 3363343

zbMath0228.90030MaRDI QIDQ5636689

Gene H. Golub, Michael A. Saunders, Richard H. Bartels

Publication date: 1970

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Nonlinear programming (90C30) Quadratic programming (90C20) Linear programming (90C05) Numerical linear algebra (65Fxx)

Related Items

An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values, Affirmative action algorithms, A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems, On the augmented system approach to sparse least-squares problems, A fast solver for linear systems with displacement structure, A penalty linear programming method using reduced-gradient basis-exchange techniques, Methods for Modifying Matrix Factorizations, Newton-type methods for unconstrained and linearly constrained optimization, The solution of large-scale least-squares problems on supercomputers, An alternate implementation of Goldfarb's minimization algorithm, A numerically stable dual method for solving strictly convex quadratic programs, A weighted gram-schmidt method for convex quadratic programming, Matrix factorizations in optimization of nonlinear functions subject to linear constraints, A degeneracy exploiting LU factorization for the simplex method, An Hybrid Approach for the Parallelization of a Block Iterative Algorithm, An algorithm for the linear complementarity problem, Interval arithmetic for guaranteed bounds in linear programming, Large-scale linear programming: Geometry, working bases and factorizations, The octahedral algorithm, a new simplicial fixed point algorithm, An implementation of the simplex method for linear programming problems with variable upper bounds, On the complexity of a pivot step of the revised simplex algorithm, A uniqueness result concerning a robust regularized least-squares solution, Analysis and implementation of a dual algorithm for constrained optimization