Fast deterministic algorithms for non-submodular maximization with strong performance guarantees

We study the non-submodular maximization problem, in which the objective function is characterized by parameters, subject to a cardinality or p -system constraint. By adapting the Threshold-Greedy algorithm for the submodular maximization, we present two deterministic algorithms for approximately so...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of global optimization Ročník 89; číslo 3; s. 777 - 801
Hlavní autoři: Lu, Cheng, Yang, Wenguo
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.07.2024
Springer
Springer Nature B.V
Témata:
Algorithms
Analysis
Approximation
Computer Science
Greedy algorithms
Mathematics
Mathematics and Statistics
Maximization
Operations Research/Decision Theory
Optimization
Real Functions
Greedy algorithm
Non-submodular maximization
Independence system
Curvature
ISSN:0925-5001, 1573-2916
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We study the non-submodular maximization problem, in which the objective function is characterized by parameters, subject to a cardinality or p -system constraint. By adapting the Threshold-Greedy algorithm for the submodular maximization, we present two deterministic algorithms for approximately solving the non-submodular maximization problem. Our analysis shows that the algorithms we propose requires much less function evaluations than existing algorithms, while providing comparable approximation guarantees. Moreover, numerical experiment results are presented to validate the theoretical analysis. Our results not only fill a gap in the (non-)submodular maximization, but also generalize and improve several existing results on closely related optimization problems.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-024-01371-7