On O(n) algorithms for projection onto the top-k-sum sublevel set

  • The top-k-sum operator computes the sum of the largest k components of a given vector. The Euclidean projection onto the top-k-sum sublevel set serves as a cru- cial subroutine in iterative methods to solve composite superquantile optimization problems. In this paper, we introduce a solver that implements two finite-termination algorithms to compute this projection. Both algorithms have O(n) complexity of float- ing point operations when applied to a sorted n-dimensional input vector, where the absorbed constant is independent of k. This stands in contrast to an existing grid- search-inspired method that has O(k(n − k)) complexity, a partition-based method with O(n + D log D) complexity, where D ≤ n is the number of distinct elements in the input vector, and a semismooth Newton method with a finite termination prop- erty but unspecified floating point complexity. The improvement of our methods over the first method is significant when k is linearly dependent on n, which is frequently encountered in practical superquantile optimization applications. In instances where the input vector is unsorted, an additional cost is incurred to (partially) sort the vector, whereas a full sort of the input vector seems unavoidable for the other two methods. To reduce this cost, we further derive a rigorous procedure that leverages approx- imate sorting to compute the projection, which is particularly useful when solving a sequence of similar projection problems. Numerical results show that our methods solve problems of scale n = 10 7 and k = 10 4 within 0.05 s, whereas the most compet- itive alternative, the semismooth Newton-based method, takes about 1 s. The existing grid-search method and Gurobi’s QP solver can take from minutes to hours

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Jake Roth, Ying Cui
DOI:https://doi.org/10.1007/s12532-024-00273-9
ISSN:1867-2949
Parent Title (English):Mathematical Programming Computation
Publisher:Springer Science and Business Media LLC
Document Type:Article
Language:English
Year of Completion:2025
Volume:17
Issue:2
Page Number:42
First Page:307
Last Page:348
Mathematical Programming Computation :MPC 2025 - Issue 2
Verstanden ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.