Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity (Q2697002)
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: Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity |
scientific article; zbMATH DE number 7675430
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity |
scientific article; zbMATH DE number 7675430 |
Statements
Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity (English)
0 references
17 April 2023
0 references
difference-of-convex programming
0 references
difference-of-convex algorithm
0 references
linear convergence
0 references
error bound
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7965229749679565
0 references
0.7806780934333801
0 references
0.7695168852806091
0 references
0.7662016749382019
0 references
0.7533631324768066
0 references
