Maximizing a non-decreasing non-submodular function subject to various types of constraints

In this paper, we firstly study the problem of maximizing a γ -weakly DR-submodular function under a general matroid constraint. We present a local search algorithm, which is guided by a tailored potential function, for solving this problem. We prove that our algorithm produces a ( 1 - e - γ - ϵ )-a...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of global optimization Vol. 83; no. 4; pp. 727 - 751
Main Authors:	Lu, Cheng, Yang, Wenguo, Yang, Ruiqi, Gao, Suixiang
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.08.2022 Springer Springer Nature B.V
Subjects:	Algorithms Approximation Computer Science Design Machine learning Mathematical analysis Mathematics Mathematics and Statistics Maximization Operations Research/Decision Theory Optimization Real Functions Search algorithms Local search Supermodular function Non-submodular maximization Weakly DR-submodular function Curvature Matroid
ISSN:	0925-5001, 1573-2916
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!