Iteration complexity of the Difference-of-Convex Algorithm for unconstrained optimization: a simple proof
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917217686257664 |
|---|---|
| author | Gratton, Serge Toint, Philippe L. |
| author_facet | Gratton, Serge Toint, Philippe L. |
| contents | We propose a simple proof of the worst-case iteration complexity for the Difference of Convex functions Algorithm (DCA) for unconstrained minimization, showing that the global rate of convergence of the norm of the objective function's gradients at the iterates converge to zero like o(1/k). A small example is also provided indicating that the rate cannot be improved. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_15970 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Iteration complexity of the Difference-of-Convex Algorithm for unconstrained optimization: a simple proof Gratton, Serge Toint, Philippe L. Optimization and Control 49M37, 65K05, 68Q17, 68W40, 90C30 F.2.1; G.1.6; I.1.2 We propose a simple proof of the worst-case iteration complexity for the Difference of Convex functions Algorithm (DCA) for unconstrained minimization, showing that the global rate of convergence of the norm of the objective function's gradients at the iterates converge to zero like o(1/k). A small example is also provided indicating that the rate cannot be improved. |
| title | Iteration complexity of the Difference-of-Convex Algorithm for unconstrained optimization: a simple proof |
| topic | Optimization and Control 49M37, 65K05, 68Q17, 68W40, 90C30 F.2.1; G.1.6; I.1.2 |
| url | https://arxiv.org/abs/2601.15970 |