Pages that link to "Item:Q1247006"
From MaRDI portal
The following pages link to A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes (Q1247006):
Displaying 17 items.
- A numerically stable dual method for solving strictly convex quadratic programs (Q59165) (← links)
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis (Q790580) (← links)
- 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 (Q790581) (← links)
- Error analysis of an algorithm for solving an undetermined linear system (Q796245) (← links)
- Solving the minimal least squares problem subject to bounds on the variables (Q797970) (← links)
- Numeric computation of the projection of a point onto a polyhedron (Q1054128) (← links)
- A direct method for sparse least squares problems with lower and upper bounds (Q1112557) (← links)
- Numerical study of some feasible direction methods in mathematical programming (Q1165559) (← links)
- A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes (Q1247006) (← links)
- Clusterwise linear regression (Q1249927) (← links)
- Bibliography on the evaluation of numerical software (Q1254823) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- Solving large linear least squares problems with linear equality constraints (Q2098770) (← links)
- A branch and bound algorithm for constrained least squares (Q3135469) (← links)
- Existence, characterization and application of interpolating minimal polynomials (Q3687576) (← links)
- An algorithm for linear least squares problems with equality and nonnegativity constraints (Q3911670) (← links)
- A stable method for solving certain constrained least squares problems (Q4194741) (← links)
