A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\)

DOI10.1016/0167-6377(89)90064-3zbMath0679.90054OpenAlexW1993367034WikidataQ56070151 ScholiaQ56070151MaRDI QIDQ1823149

Geraldo jun. Galdino de Paula, Nelson F. Maculan

Publication date: 1989

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(89)90064-3

zbMATH Keywords

Kuhn-Tucker conditionscomputational linear algebraprojection of a vector

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Nonlinear programming (90C30) Quadratic programming (90C20)

Related Items

Projections onto the canonical simplex with additional linear inequalities, Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies, Two fast algorithms for projecting a point onto the canonical simplex, Comparative study of two fast algorithms for projecting a point to the standard simplex, Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function, Subgradient method with entropic projections for convex nondifferentiable minimization, Minmax combinatorial optimization, An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\), Variable fixing algorithms for the continuous quadratic Knapsack problem, A survey on the continuous nonlinear resource allocation problem, Breakpoint searching algorithms for the continuous quadratic knapsack problem, SAGA: sparse and geometry-aware non-negative matrix factorization through non-linear local embedding, A fast algorithm for solving a simple search problem

Cites Work

• Validation of subgradient optimization
• Unnamed Item
• Unnamed Item