A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes

Related Items (17)

Best practices for comparing optimization algorithms ⋮ A direct method for sparse least squares problems with lower and upper bounds ⋮ Numerical study of some feasible direction methods in mathematical programming ⋮ A numerically stable dual method for solving strictly convex quadratic programs ⋮ A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes ⋮ Clusterwise linear regression ⋮ Bibliography on the evaluation of numerical software ⋮ A stable method for solving certain constrained least squares problems ⋮ An algorithm for linear least squares problems with equality and nonnegativity constraints ⋮ The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis ⋮ The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. II. An efficient implementation with linear least squares subproblems ⋮ Numeric computation of the projection of a point onto a polyhedron ⋮ Error analysis of an algorithm for solving an undetermined linear system ⋮ Solving large linear least squares problems with linear equality constraints ⋮ Solving the minimal least squares problem subject to bounds on the variables ⋮ A branch and bound algorithm for constrained least squares ⋮ Existence, characterization and application of interpolating minimal polynomials

Cites Work

This page was built for publication: A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes