Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity (Q2697002): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10957-023-02171-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4322732110 / rank | |||
Normal rank | |||
Latest revision as of 23:08, 19 March 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
