OCP: a greedy projection method for row-sparse representations of minimum-norm solutions (Q7452736)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | OCP: a greedy projection method for row-sparse representations of minimum-norm solutions |
No description defined |
Statements
OCP: a greedy projection method for row-sparse representations of minimum-norm solutions (English)
0 references
17 November 2026
0 references
math.NA
0 references
Tao Li
0 references
Deanna Needell
0 references
Qing-Wen Wang
0 references
We propose a greedy projection method OCP to identify a small set of rows whose span contains the minimum-norm solution, with an exact row selection guarantee for sparse signals under suitable conditions, and apply its variant to solve support vector machines efficiently.
0 references
Greedy Projection
0 references
Row-Sparse
0 references
Minimum-Norm Solution
0 references
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference