A semi-smooth Newton method for general projection equations applied to the nearest correlation matrix problem
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910292027375616 |
|---|---|
| author | Armijo, Nicolas F. Bello-Cruz, Yunier Haeser, Gabriel |
| author_facet | Armijo, Nicolas F. Bello-Cruz, Yunier Haeser, Gabriel |
| contents | In this paper, we extend and investigate the properties of the semi-smooth Newton method when applied to a general projection equation in finite dimensional spaces. We first present results concerning Clarke's generalized Jacobian of the projection onto a closed and convex cone. We then describe the iterative process for the general cone case and establish two convergence theorems. We apply these results to the constrained quadratic conic programming problem, emphasizing its connection to the projection equation. To illustrate the performance of our method, we conduct numerical experiments focusing on semidefinite least squares, in particular the nearest correlation matrix problem. In the latter scenario, we benchmark our outcomes against previous literature, presenting performance profiles and tabulated results for clarity and comparison. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_04657 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A semi-smooth Newton method for general projection equations applied to the nearest correlation matrix problem Armijo, Nicolas F. Bello-Cruz, Yunier Haeser, Gabriel Optimization and Control 90C33, 15A48 In this paper, we extend and investigate the properties of the semi-smooth Newton method when applied to a general projection equation in finite dimensional spaces. We first present results concerning Clarke's generalized Jacobian of the projection onto a closed and convex cone. We then describe the iterative process for the general cone case and establish two convergence theorems. We apply these results to the constrained quadratic conic programming problem, emphasizing its connection to the projection equation. To illustrate the performance of our method, we conduct numerical experiments focusing on semidefinite least squares, in particular the nearest correlation matrix problem. In the latter scenario, we benchmark our outcomes against previous literature, presenting performance profiles and tabulated results for clarity and comparison. |
| title | A semi-smooth Newton method for general projection equations applied to the nearest correlation matrix problem |
| topic | Optimization and Control 90C33, 15A48 |
| url | https://arxiv.org/abs/2401.04657 |