A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)

DOI10.1007/BF00938486zbMath0571.90074MaRDI QIDQ1061617

B. George

Publication date: 1986

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

optimality conditions; canonical simplex; projection of a point; projection onto a simplex; successive location of the solution

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

90C20: Quadratic programming

90C55: Methods of successive quadratic programming type

Related Items

On the continuous quadratic knapsack problem, An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\), Geometrically convergent projection method in matrix games