On O(n) algorithms for projection onto the top-k-sum sublevel set is a research paper published in Mathematical Programming Computation (2025). On theSindex it has a DataRank of 0.104. It has been cited 1 time.
Scored on demand from live citation data
DataRank reads this dataset's downstream impact straight off the citation graph — no black box, no proprietary weighting. How is this computed?
FAIR checklist signals are shown for context only and do not affect DataRank scoring.
We only score data papers we can read in full — never from an abstract alone.
Base Score Contribution
0.104
From this paper's citation signal
Citation Network Contribution
0
Citation network not refreshed for this result
This paper's DataRank is currently driven only by its base citation score. Citation network data was not refreshed for this result.
Learn more about DataRank methodology →NCI NIH HHS
Grant: R01 CA287413
National Science Foundation
Grant: 2153352
CRII: CCF: AF: Decomposition Algorithms for nonconvex nonsmooth constrained stochastic programs
National Institutes of Health
Grant: 5R01CA287413-02
SCH: A New Computational Framework for Learning from Imbalanced Biomedical Data
National Science Foundation
Grant: 2309729
Theory and algorithms for a new class of computationally amenable nonconvex functions
National Science Foundation
Grant: 2416172
CRII: CCF: AF: Decomposition Algorithms for nonconvex nonsmooth constrained stochastic programs
National Science Foundation
Grant: 2416250
Theory and algorithms for a new class of computationally amenable nonconvex functions
Fields of Study
Keywords
On $O(n)$ Algorithms for Projection onto the Top-$k$-sum Sublevel Set