A stable method for solving certain constrained least squares problems
From MaRDI portal
Publication:4194741
DOI10.1007/BF01582105zbMath0407.90065MaRDI QIDQ4194741
Publication date: 1979
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items (15)
Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs ⋮ Separating plane algorithms for convex optimization ⋮ A regularized decomposition method for minimizing a sum of polyhedral functions ⋮ Algorithms for the solution of stochastic dynamic minimax problems ⋮ Partitioning mathematical programs for parallel solution ⋮ An active set method for solving linearly constrained nonsmooth optimization problems ⋮ Numerical study of some feasible direction methods in mathematical programming ⋮ A numerically stable dual method for solving strictly convex quadratic programs ⋮ Parallel bundle-based decomposition for large-scale structured mathematical programming problems ⋮ An algorithm for linear least squares problems with equality and nonnegativity constraints ⋮ An algorithm for least distance programming ⋮ Procedures for optimization problems with a mixture of bounds and general linear constraints ⋮ Solving the minimal least squares problem subject to bounds on the variables ⋮ A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\) ⋮ ε-Optimal solutions in nondifferentiable convex programming and some related questions
Cites Work
- Unnamed Item
- Unnamed Item
- A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Finding the nearest point in A polytope
- On the Numerical Solution of Constrained Least-Squares Problems
This page was built for publication: A stable method for solving certain constrained least squares problems
