An inexact semismooth Newton method with application to adaptive randomized sketching for dynamic optimization
In many applications, one can only access the inexact gradients and inexact hessian times vector products. Thus it is essential to consider algorithms that can handle such inexact quantities with a guaranteed convergence to solution. An inexact adaptive and provably convergent semismooth Newton meth...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Dokumenttyp: | Article (Journal) |
| Sprache: | Englisch |
| Veröffentlicht: |
1 January 2024
|
| In: |
Finite elements in analysis and design
Year: 2024, Jahrgang: 228, Pages: 1-21 |
| ISSN: | 0168-874X |
| DOI: | 10.1016/j.finel.2023.104052 |
| Online-Zugang: | Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1016/j.finel.2023.104052 Verlag, lizenzpflichtig, Volltext: https://www.sciencedirect.com/science/article/pii/S0168874X23001452 
|
| Verfasserangaben: | Mohammed Alshehri, Harbir Antil, Evelyn Herberg, Drew P. Kouri |
| Zusammenfassung: | In many applications, one can only access the inexact gradients and inexact hessian times vector products. Thus it is essential to consider algorithms that can handle such inexact quantities with a guaranteed convergence to solution. An inexact adaptive and provably convergent semismooth Newton method is considered to solve constrained optimization problems. In particular, dynamic optimization problems, which are known to be highly expensive, are the focus. A memory efficient semismooth Newton algorithm is introduced for these problems. The source of efficiency and inexactness is the randomized matrix sketching. Applications to optimization problems constrained by partial differential equations are also considered. |
|---|---|
| Beschreibung: | Online verfügbar 18 October 2023, Version des Artikels 18 October 2023 Gesehen am 10.06.2024 |
| Beschreibung: | Online Resource |
| ISSN: | 0168-874X |
| DOI: | 10.1016/j.finel.2023.104052 |