Pages that link to "Item:Q1823149"

The following pages link to A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\) (Q1823149):

Displayed 13 items.

• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) ‎ (← links)
• Two fast algorithms for projecting a point onto the canonical simplex (Q327053) ‎ (← links)
• Variable fixing algorithms for the continuous quadratic Knapsack problem (Q927220) ‎ (← links)
• Minmax combinatorial optimization (Q1130081) ‎ (← links)
• Subgradient method with entropic projections for convex nondifferentiable minimization (Q1384058) ‎ (← links)
• An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\) (Q1411525) ‎ (← links)
• A fast algorithm for solving a simple search problem (Q2332641) ‎ (← links)
• A survey on the continuous nonlinear resource allocation problem (Q2456404) ‎ (← links)
• Breakpoint searching algorithms for the continuous quadratic knapsack problem (Q2465658) ‎ (← links)
• SAGA: sparse and geometry-aware non-negative matrix factorization through non-linear local embedding (Q2512905) ‎ (← links)
• Comparative study of two fast algorithms for projecting a point to the standard simplex (Q3186866) ‎ (← 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)