A purely geometric approach to the problem of computing the projection of a point on a simplex
From MaRDI portal
(Redirected from Publication:1949586)
Recommendations
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- Fast projection onto the simplex and the l₁ ball
- Two fast algorithms for projecting a point onto the canonical simplex
- A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\)
- scientific article; zbMATH DE number 3924512
Cites work
- A class of methods for projection on a convex set
- 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
- Lipschitz continuity results for a class of variational inequalities and applications: A geometric approach
Cited in
(8)- Projecting a simplex onto another one
- A projected gradient method for optimization over density matrices
- Fast projection onto the simplex and the l₁ ball
- Comparative study of two fast algorithms for projecting a point to the standard simplex
- Two fast algorithms for projecting a point onto the canonical simplex
- Complexity estimation for an algorithm of searching for zero of a piecewise linear convex function
- Efficient methods for verifying monotonicity of 2-additive fuzzy measures
- A big-M type method for the computation of projections onto polyhedrons
This page was built for publication: A purely geometric approach to the problem of computing the projection of a point on a simplex
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1949586)
