Two fast algorithms for projecting a point onto the canonical simplex
From MaRDI portal
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
(23)- Complexity estimation for an algorithm of searching for zero of a piecewise linear convex function
- Canonical analysis of two convex polyhedral cones and applications
- A filtered bucket-clustering method for projection onto the simplex and the \(\ell_1\) ball
- scientific article; zbMATH DE number 3924512 (Why is no real title available?)
- Projected gradient algorithms for optimization over order simplices
- An algorithm for projecting onto simplicial cones
- Fast projection onto the simplex and the l₁ ball
- scientific article; zbMATH DE number 7656030 (Why is no real title available?)
- Two fast algorithms for projecting a point onto the canonical simplex
- Fast projection method for a special class of polytopes with applications
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- Enhanced basic procedures for the projection and rescaling algorithm
- Projective-dual method for solving systems of linear equations with nonnegative variables
- A bicomposition of conical projections
- Projections onto the canonical simplex with additional linear inequalities
- Comparative study of two fast algorithms for projecting a point to the standard simplex
- Nonsmooth penalty and subgradient algorithms to solve the problem of projection onto a polytope
- A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\)
- Efficient methods for verifying monotonicity of 2-additive fuzzy measures
- A purely geometric approach to the problem of computing the projection of a point on a simplex
- Fast Algorithms for Projection on an Ellipsoid
- Two simplified affine projection algorithms
- Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in \(\mathbb{R}^n\)
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)
