Solving the minimal least squares problem subject to bounds on the variables (Q797970)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving the minimal least squares problem subject to bounds on the variables |
scientific article; zbMATH DE number 3870505
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the minimal least squares problem subject to bounds on the variables |
scientific article; zbMATH DE number 3870505 |
Statements
Solving the minimal least squares problem subject to bounds on the variables (English)
0 references
1984
0 references
The author considers a solution method for linear least squares problems subject to lower and upper bounds on the variables. In a first step, an arbitrary solution is found based on an active set strategy. The corresponding subproblems are either solved by direct factorization (QR) or a conjugate gradient method. Subsequently the minimum norm solution of the least squares problem is determined. The algorithm and details on its numerical implementation are outlined and some numerical results are presented.
0 references
linear least squares problems
0 references
active set strategy
0 references
direct factorization
0 references
conjugate gradient method
0 references
minimum norm solution
0 references
numerical results
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8495492935180664
0 references
0.8349001407623291
0 references
0.8256304264068604
0 references
0.8238183259963989
0 references
