An algorithm for finding nonnegative minimal norm solutions of linear systems (Q2865641)
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: An algorithm for finding nonnegative minimal norm solutions of linear systems |
scientific article; zbMATH DE number 6235031
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for finding nonnegative minimal norm solutions of linear systems |
scientific article; zbMATH DE number 6235031 |
Statements
2 December 2013
0 references
duality conditions
0 references
minimal norm solution
0 references
global convergence
0 references
algorithm
0 references
large size problem
0 references
An algorithm for finding nonnegative minimal norm solutions of linear systems (English)
0 references
The authors present a nice algorithm for searching a minimal norm solution of a system of linear equations. The feasibility and global convergence of the algorithm is proved for general strictly convex, smooth norms. This algorithm also performed well for relatively large size problem.
0 references
0.9178293943405152
0 references
0.9139798879623412
0 references
0.9043136835098268
0 references
0.8820804357528687
0 references
0.8775135278701782
0 references
