Pages that link to "Item:Q1112557"
From MaRDI portal
The following pages link to A direct method for sparse least squares problems with lower and upper bounds (Q1112557):
Displayed 13 items.
- A direct active set algorithm for large sparse quadratic programs with simple bounds (Q583116) (← links)
- On iterative algorithms for linear least squares problems with bound constraints (Q756372) (← links)
- Regularization of a Volterra integral equation by linear inequalities (Q911737) (← links)
- A sparse counterpart of Reichel and Gragg's package QRUP (Q1044853) (← links)
- A direct method for sparse least squares problems with lower and upper bounds (Q1112557) (← links)
- Algorithms for bound constrained quadratic programming problems (Q1122320) (← links)
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds (Q1341568) (← links)
- An affine scaling interior trust-region method combining with line search filter technique for optimization subject to bounds on variables (Q1744045) (← links)
- The adventures of a simple algorithm (Q1863543) (← links)
- An efficient Hessian based algorithm for singly linearly and box constrained least squares regression (Q2049105) (← links)
- A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule (Q2475881) (← links)
- A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables (Q4317664) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)