On convergence of a \(q\)-random coordinate constrained algorithm for non-convex problems (Q6635808)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7941537
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On convergence of a \(q\)-random coordinate constrained algorithm for non-convex problems |
scientific article; zbMATH DE number 7941537 |
Statements
On convergence of a \(q\)-random coordinate constrained algorithm for non-convex problems (English)
0 references
12 November 2024
0 references
random coordinate descent algorithm
0 references
convergence analysis
0 references
densest \(k\)-subgraph problem
0 references
eigenvalue complementarity problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8520341515541077
0 references
0.8374837040901184
0 references
0.8126928210258484
0 references
0.7979825735092163
0 references
0.7934015989303589
0 references
