Pages that link to "Item:Q327053"

The following pages link to Two fast algorithms for projecting a point onto the canonical simplex (Q327053):

Displaying 18 items.

• Fast projection onto the simplex and the \(l_1\) ball (Q304269) (← links)
• Two fast algorithms for projecting a point onto the canonical simplex (Q327053) (← links)
• A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\) (Q1061617) (← links)
• Projective-dual method for solving systems of linear equations with nonnegative variables (Q1644007) (← links)
• A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\) (Q1823149) (← links)
• A purely geometric approach to the problem of computing the projection of a point on a simplex (Q1949586) (← links)
• Nonsmooth penalty and subgradient algorithms to solve the problem of projection onto a polytope (Q1956969) (← links)
• A filtered bucket-clustering method for projection onto the simplex and the \(\ell_1\) ball (Q2191778) (← links)
• Enhanced basic procedures for the projection and rescaling algorithm (Q2329647) (← links)
• Two simplified affine projection algorithms (Q2705734) (← links)
• Projected gradient algorithms for optimization over order simplices (Q2926073) (← links)
• Comparative study of two fast algorithms for projecting a point to the standard simplex (Q3186866) (← links)
• Fast projection method for a special class of polytopes with applications (Q3815151) (← links)
• A $O(n)$ algorithm for projecting a vector on the intersection of a hyperplane and $R^n_+$ (Q4345415) (← links)
• Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function (Q4558290) (← links)
• Projections onto the canonical simplex with additional linear inequalities (Q5038426) (← links)
• Modeling and optimizing large-scale production-level transportation systems (Q5878625) (← links)
• Efficient methods for verifying monotonicity of 2-additive fuzzy measures (Q6653932) (← links)