On Max- K -Sums
Mathematical programming(2017)
School of Operations Research and Information Engineering
Abstract
The max- k -sum of a set of real scalars is the maximum sum of a subset of size k , or alternatively the sum of the k largest elements. We study two extensions: first, we show how to obtain smooth approximations to functions that are pointwise max- k -sums of smooth functions. Second, we discuss how the max- k -sum can be defined on vectors in a finite-dimensional real vector space ordered by a closed convex cone.
MoreTranslated text
Key words
Pointwise maximum,Smoothing,Max-k-sums,complexity,Partially ordered
PDF
View via Publisher
AI Read Science
Must-Reading Tree
Example

Generate MRT to find the research sequence of this paper
Related Papers
Rankmax: an Adaptive Projection Alternative to the Softmax Function.
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020 2020
被引用19
PROCEEDINGS OF THE ACM ON COMPUTER GRAPHICS AND INTERACTIVE TECHNIQUES 2023
被引用2
Proceedings of the ACM on Computer Graphics and Interactive Techniques 2023
被引用0
IEEE Transactions on Signal Processing 2024
被引用0
Data Disclaimer
The page data are from open Internet sources, cooperative publishers and automatic analysis results through AI technology. We do not make any commitments and guarantees for the validity, accuracy, correctness, reliability, completeness and timeliness of the page data. If you have any questions, please contact us by email: report@aminer.cn
Chat Paper
去 AI 文献库 对话