Two fast algorithms for projecting a point onto the canonical simplex

DOI10.1134/S0965542516050146zbMath1352.65154OpenAlexW2487879311MaRDI QIDQ327053

G. Sh. Tamasyan, Vasily N. Malozemov

Publication date: 13 October 2016

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542516050146

zbMATH Keywords

computational complexityconvergencequadratic programmingfast algorithmsoptimality conditionnumerical resultprojecting onto a simplex

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Complexity and performance of numerical algorithms (65Y20)

Related Items (5)

Projective-dual method for solving systems of linear equations with nonnegative variables ⋮ Two fast algorithms for projecting a point onto the canonical simplex ⋮ Comparative study of two fast algorithms for projecting a point to the standard simplex ⋮ Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function ⋮ Unnamed Item

Cites Work

• Two fast algorithms for projecting a point onto the canonical simplex
• A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
• A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\)
• A purely geometric approach to the problem of computing the projection of a point on a simplex
• Validation of subgradient optimization

This page was built for publication: Two fast algorithms for projecting a point onto the canonical simplex