Characterization of optimization problems that are solvable iteratively with linear convergence
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909231402188800 |
|---|---|
| author | Alimisis, Foivos |
| author_facet | Alimisis, Foivos |
| contents | In this work, we state a general conjecture on the solvability of optimization problems via algorithms with linear convergence guarantees. We make a first step towards examining its correctness by fully characterizing the problems that are solvable via Riemannian gradient descent with linear convergence. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_12090 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Characterization of optimization problems that are solvable iteratively with linear convergence Alimisis, Foivos Optimization and Control Differential Geometry In this work, we state a general conjecture on the solvability of optimization problems via algorithms with linear convergence guarantees. We make a first step towards examining its correctness by fully characterizing the problems that are solvable via Riemannian gradient descent with linear convergence. |
| title | Characterization of optimization problems that are solvable iteratively with linear convergence |
| topic | Optimization and Control Differential Geometry |
| url | https://arxiv.org/abs/2402.12090 |