An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\) (Q1411525)
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 \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\) |
scientific article; zbMATH DE number 1997772
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\) |
scientific article; zbMATH DE number 1997772 |
Statements
An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\) (English)
0 references
29 October 2003
0 references
Orthogonal projections
0 references
linear-time algorithm
0 references
computational linear algebra
0 references
subgradient methods
0 references
0 references
0 references
0 references
0 references
