An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming (Q2148144)
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: An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming |
scientific article |
Statements
An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming (English)
0 references
21 June 2022
0 references
supervised distance preserving projection
0 references
rank constraint
0 references
inexact proximal difference-of-convex algorithm
0 references
sieving strategy
0 references
accelerated block coordinate descent
0 references
data dimensionality reduction
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7620294094085693
0 references
0.7605255842208862
0 references
0.7524470686912537
0 references
0.7089251279830933
0 references
0.7082811594009399
0 references
