scientific article; zbMATH DE number 3363343

From MaRDI portal
Revision as of 04:12, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5636689

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.



Related Items (23)

An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular valuesAffirmative action algorithmsA numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problemsOn the augmented system approach to sparse least-squares problemsA fast solver for linear systems with displacement structureA penalty linear programming method using reduced-gradient basis-exchange techniquesMethods for Modifying Matrix FactorizationsNewton-type methods for unconstrained and linearly constrained optimizationThe solution of large-scale least-squares problems on supercomputersAn alternate implementation of Goldfarb's minimization algorithmA numerically stable dual method for solving strictly convex quadratic programsA weighted gram-schmidt method for convex quadratic programmingMatrix factorizations in optimization of nonlinear functions subject to linear constraintsA degeneracy exploiting LU factorization for the simplex methodAn Hybrid Approach for the Parallelization of a Block Iterative AlgorithmAn algorithm for the linear complementarity problemInterval arithmetic for guaranteed bounds in linear programmingLarge-scale linear programming: Geometry, working bases and factorizationsThe octahedral algorithm, a new simplicial fixed point algorithmAn implementation of the simplex method for linear programming problems with variable upper boundsOn the complexity of a pivot step of the revised simplex algorithmA uniqueness result concerning a robust regularized least-squares solutionAnalysis and implementation of a dual algorithm for constrained optimization




This page was built for publication: