Two fast algorithms for projecting a point onto the canonical simplex
From MaRDI portal
Two algorithms are considered for finding the orthogonal projection of a point onto a convex polyhedron. The first one is the scalar algorithm based on the algebraic analysis of the Kuhn-Tucker optimality conditions. The second one is the vector algorithm based on a recurrence of vector quantities. This paper presents improved versions of the description and proof of the finite convergence of the scalar and vector algorithms. Numerical results on the computational complexity of the two algorithms are presented.
Recommendations
- Comparative study of two fast algorithms for projecting a point to the standard 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\)
- Fast projection onto the simplex and the l₁ ball
- scientific article; zbMATH DE number 3924512
Cites work
- 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
- Two fast algorithms for projecting a point onto the canonical simplex
- Validation of subgradient optimization
Cited in
(24)- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- Projective-dual method for solving systems of linear equations with nonnegative variables
- 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
- Nonsmooth penalty and subgradient algorithms to solve the problem of projection onto a polytope
- A filtered bucket-clustering method for projection onto the simplex and the \(\ell_1\) ball
- Enhanced basic procedures for the projection and rescaling algorithm
- Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in \(\mathbb{R}^n\)
- Canonical analysis of two convex polyhedral cones and applications
- Two simplified affine projection algorithms
- Projected gradient algorithms for optimization over order simplices
- 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
- scientific article; zbMATH DE number 3924512 (Why is no real title available?)
- Fast projection method for a special class of polytopes with applications
- A O(n) algorithm for projecting a vector on the intersection of a hyperplane and R^n_+
- Complexity estimation for an algorithm of searching for zero of a piecewise linear convex function
- Projections onto the canonical simplex with additional linear inequalities
- An algorithm for projecting onto simplicial cones
- Fast Algorithms for Projection on an Ellipsoid
- scientific article; zbMATH DE number 7656030 (Why is no real title available?)
- A bicomposition of conical projections
- Efficient methods for verifying monotonicity of 2-additive fuzzy measures
This page was built for publication: Two fast algorithms for projecting a point onto the canonical simplex
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q327053)
