A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\) (Q1823149): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(89)90064-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1993367034 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4091421 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Validation of subgradient optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3738922 / rank | |||
Normal rank | |||
Latest revision as of 09:35, 20 June 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
