A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\) (Q1061617): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:36, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\) |
scientific article |
Statements
A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\) (English)
0 references
1986
0 references
An algorithm of successive location of the solution is developed for the problem of finding the projection of a point onto the canonical simplex in the Euclidean space \({\mathbb{R}}^ n\). This algorithm converges in a finite number of steps. Each iteration consists in finding the projection of a point onto an affine subspace and requires only explicit and very simple computations.
0 references
successive location of the solution
0 references
projection of a point
0 references
canonical simplex
0 references
projection onto a simplex
0 references
optimality conditions
0 references
