Large sparse numerical optimization

DOI10.1007/3-540-12914-6zbMath0536.65047OpenAlexW2030282193MaRDI QIDQ792069

Thomas F. Coleman

Publication date: 1984

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-12914-6

zbMATH Keywords

unconstrained optimizationsimplex algorithmprojection methodlinear least squares problemnonlinear least squareselimination methodmethod of Lagrange multipliersinfinite weights methodlarge sparse numerical optimization

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Linear programming (90C05) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02)

Related Items (12)

Theoretical challenges towards cutting-plane selection ⋮ An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems ⋮ The Null Space Problem I. Complexity ⋮ Approximating polyhedra with sparse inequalities ⋮ Computing a Sparse Basis for the Null Space ⋮ Some efficiently solvable problems over integer partition polytopes ⋮ A hierarchical algorithm for making sparse matrices sparser ⋮ Unnamed Item ⋮ A chordal preconditioner for large-scale optimization ⋮ The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices ⋮ An algorithm for solving sparse nonlinear least squares problems ⋮ On the use of dense matrix techniques within sparse simplex

Uses Software

• LSQR

This page was built for publication: Large sparse numerical optimization