A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\) (Q1823149): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56070151, #quickstatements; #temporary_batch_1704753733659 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:49, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\) |
scientific article |
Statements
A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\) (English)
0 references
1989
0 references
An algorithm is given for the projection of a vector \(\bar x\in R^ n\) on the simplex \(\{x\in R^ n|\) \(e^ Tx=1\), \(x\geq 0\}\). The problem is written as a convex quadratic programming problem, for which the Kuhn- Tucker conditions are solved. It is shown that the complexity is O(n) time. A numerical example is given.
0 references
computational linear algebra
0 references
projection of a vector
0 references
Kuhn-Tucker conditions
0 references
