A purely geometric approach to the problem of computing the projection of a point on a simplex
From MaRDI portal
Publication:1949586
DOI10.1007/s10957-012-0115-5zbMath1262.90084OpenAlexW2056172626MaRDI QIDQ1949586
Publication date: 8 May 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0115-5
Related Items (4)
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 ⋮ A projected gradient method for optimization over density matrices
Cites Work
- Unnamed Item
- Lipschitz continuity results for a class of variational inequalities and applications: A geometric approach
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- Continuity Results for a Class of Variational Inequalities with Applications to Time-Dependent Network Problems
This page was built for publication: A purely geometric approach to the problem of computing the projection of a point on a simplex
