Convergence rates of Newton's method for strongly self-concordant minimization
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912513284636672 |
|---|---|
| author | Tsipinakis, Nick Parpas, Panos |
| author_facet | Tsipinakis, Nick Parpas, Panos |
| contents | Newton's method has been thoroughly studied for the class of self-concordant functions. However, a local analysis specific to strongly self-concordant functions (a subclass of the former) is missing from the literature. The local quadratic rate of strongly self-concordant functions follows, of course, from the known results for self-concordant functions. However, it is not known whether strongly self-concordant functions enjoy better theoretical properties. In this paper, we study the local convergence of Newton's method for this subclass. We show that its quadratic convergence rate differs from that of general self-concordant functions. In particular, it is provably faster for a wide range of objective functions and benefits from a larger region of local convergence. Thus, the results of this paper close the gap in the theoretical understanding of Newton's method applied to strongly self-concordant functions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_23558 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Convergence rates of Newton's method for strongly self-concordant minimization Tsipinakis, Nick Parpas, Panos Optimization and Control Newton's method has been thoroughly studied for the class of self-concordant functions. However, a local analysis specific to strongly self-concordant functions (a subclass of the former) is missing from the literature. The local quadratic rate of strongly self-concordant functions follows, of course, from the known results for self-concordant functions. However, it is not known whether strongly self-concordant functions enjoy better theoretical properties. In this paper, we study the local convergence of Newton's method for this subclass. We show that its quadratic convergence rate differs from that of general self-concordant functions. In particular, it is provably faster for a wide range of objective functions and benefits from a larger region of local convergence. Thus, the results of this paper close the gap in the theoretical understanding of Newton's method applied to strongly self-concordant functions. |
| title | Convergence rates of Newton's method for strongly self-concordant minimization |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2507.23558 |