Comparative study of two fast algorithms for projecting a point to the standard simplex
From MaRDI portal
Publication:3186866
DOI10.1134/S1990478916020137zbMath1349.90668MaRDI QIDQ3186866
E. V. Prosolupov, T. A. Angelov, G. Sh. Tamasyan
Publication date: 12 August 2016
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Related Items (2)
Projective-dual method for solving systems of linear equations with nonnegative variables ⋮ Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function
Uses Software
Cites Work
- Two fast algorithms for projecting a point onto the canonical simplex
- An O(n) algorithm for quadratic knapsack problems
- Computation of the distance from an ellipsoid to a linear surface and a quadric in \(\mathbb R^n\)
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- Fast algorithm for projecting a point on a simplex
- 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
- A survey on the continuous nonlinear resource allocation problem
- Direct Methods in the Parametric Moving Boundary Variational Problem
- Exact penalty functions in isoperimetric problems
- A polynomially bounded algorithm for a singly constrained quadratic program
- Validation of subgradient optimization
- Finding the distance between ellipsoids
- Method of Steepest Descent for Two-Dimensional Problems of Calculus of Variations
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Comparative study of two fast algorithms for projecting a point to the standard simplex
