An inexact semismooth Newton method with application to adaptive randomized sketching for dynamic optimization
- George Mason Univ., Fairfax, VA (United States)
- Ruprecht-Karls-University, Heidelberg (Germany)
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
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. Further, applications to optimization problems constrained by partial differential equations are also considered.
- Research Organization:
- Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR); US Air Force Office of Scientific Research (AFOSR)
- Grant/Contract Number:
- NA0003525
- OSTI ID:
- 2311364
- Report Number(s):
- SAND--2023-14004J
- Journal Information:
- Finite Elements in Analysis and Design, Journal Name: Finite Elements in Analysis and Design Vol. 228; ISSN 0168-874X
- Publisher:
- ElsevierCopyright Statement
- Country of Publication:
- United States
- Language:
- English
Similar Records
Exact and inexact subsampled Newton methods for optimization
Randomized Sketching Algorithms for Low-Memory Dynamic Optimization