Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy

Xiaojuan Zhang (), Qian Liu (), Min Li () and Yang Zhou ()
Additional contact information
Xiaojuan Zhang: Shandong Normal University
Qian Liu: Shandong Normal University
Min Li: Shandong Normal University
Yang Zhou: Shandong Normal University

Journal of Combinatorial Optimization, 2022, vol. 44, issue 5, No 18, 3549-3574

Abstract: Abstract In this paper, we concentrate on exploring fast algorithms for the minimization of a non-increasing supermodular or non-supermodular function f subject to a cardinality constraint. As for the non-supermodular minimization problem with the weak supermodularity ratio r, we can obtain a $$(1+\epsilon )$$ ( 1 + ϵ ) -approximation algorithm with adaptivity $$O(\frac{n}{\epsilon }\log {\frac{r n \cdot f(\emptyset )}{\epsilon \cdot \mathtt {OPT}}})$$ O ( n ϵ log r n · f ( ∅ ) ϵ · OPT ) under the bi-criteria strategy, where $$\mathtt {OPT}$$ OPT denotes the optimal objective value of the problem. That is, instead of selecting at most k elements on behalf of the constraint, the cardinality of the output may reach to $$\frac{k}{ r}\log {\frac{f(\emptyset )}{\epsilon \cdot \mathtt {OPT}}}$$ k r log f ( ∅ ) ϵ · OPT . Moreover, for the supermodular minimization problem, we propose two $$(1+\epsilon )$$ ( 1 + ϵ ) -approximation algorithms for which the output solution X is of size $$|X_0|+ O\left( k \log {\frac{f(X_0)}{\epsilon \cdot \mathtt {OPT}}}\right) $$ | X 0 | + O k log f ( X 0 ) ϵ · OPT . The adaptivities of this two algorithms are $$O \left( \log ^2n \cdot \log \frac{f(X_0)}{\epsilon \cdot \mathtt {OPT}}\right) $$ O log 2 n · log f ( X 0 ) ϵ · OPT and $$O\left( \log n \cdot \log \frac{f(X_0)}{\epsilon \cdot \mathtt {OPT}}\right) $$ O log n · log f ( X 0 ) ϵ · OPT , where $$X_0$$ X 0 is an input set and $$\mathtt {OPT}$$ OPT is the optimal value. Applications to group sparse linear regression problems and fuzzy C-means problems are studied at the end.

Keywords: Non-supermodular; Supermodular; Bi-criteria; Group sparse linear regression problem; Fuzzy C-means problem; 90C27; 68W25; 68Q25; 68W10 (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-022-00914-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:44:y:2022:i:5:d:10.1007_s10878-022-00914-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-022-00914-6

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().