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
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5588268 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4101612 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A stable method for solving certain constrained least squares problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4132018 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding the nearest point in A polytope / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convex Analysis / rank | |||
Normal rank |
Latest revision as of 18:32, 14 June 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
0 references