Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity (Q2697002): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:57, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity |
scientific article |
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
