Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy (Q2091111)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy |
scientific article; zbMATH DE number 7610141
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy |
scientific article; zbMATH DE number 7610141 |
Statements
Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy (English)
0 references
31 October 2022
0 references
non-supermodular
0 references
supermodular
0 references
bi-criteria
0 references
group sparse linear regression problem
0 references
fuzzy \(C\)-means problem
0 references
0 references
0 references
0 references
0 references
0.8967145085334778
0 references
0.784287691116333
0 references
0.7469568848609924
0 references
