Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

An inexact semismooth Newton method with application to adaptive randomized sketching for dynamic optimization

Journal Article · · Finite Elements in Analysis and Design
 [1];  [1];  [2];  [3]
  1. George Mason Univ., Fairfax, VA (United States)
  2. Ruprecht-Karls-University, Heidelberg (Germany)
  3. 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

References (24)

Inexact Trust-Region Methods for PDE-Constrained Optimization book January 2018
Domain decomposition and model reduction for the numerical solution of PDE constrained optimization problems with localized optimization variables journal August 2010
A Variational Discretization Concept in Control Constrained Optimization: The Linear-Quadratic Case journal January 2005
Lossy compression for PDE-constrained optimization: adaptive error control journal November 2014
Controlling the Kelvin force: basic strategies and applications to magnetic drug targeting journal June 2018
Approximation numbers=singular values journal November 2007
A deterministic pathogen transmission model based on high-fidelity physics journal November 2022
An ‘empirical interpolation’ method: application to efficient reduced-basis discretization of partial differential equations journal November 2004
Real-time observation of vortex lattices in a superconductor by electron microscopy journal November 1992
Domain decomposition and balanced truncation model reduction for shape optimization of the Stokes system journal October 2011
Reduced Basis Method for Optimal Control of Unsteady Viscous Flows journal October 2001
Using sparse control methods to identify sources in linear diffusion-convection equations journal October 2019
A characterization of superlinear convergence and its application to quasi-Newton methods journal May 1974
Minimal Repetition Dynamic Checkpointing Algorithm for Unsteady Adjoint Calculation journal January 2009
New Algorithms for Optimal Online Checkpointing journal January 2010
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems journal July 1986
Nonlinear Model Reduction via Discrete Empirical Interpolation journal January 2010
Generalizations of the Dennis--Moré Theorem journal January 2012
Practical Sketching Algorithms for Low-Rank Matrix Approximation journal January 2017
Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation journal January 2019
An Efficient, Globally Convergent Method for Optimization Under Uncertainty Using Adaptive Model Reduction and Sparse Grids journal January 2019
Randomized Sketching Algorithms for Low-Memory Dynamic Optimization journal January 2021
Algorithm 799: revolve: an implementation of checkpointing for the reverse or adjoint mode of computational differentiation journal March 2000
Maximal discrete sparsity in parabolic optimal control with measures journal January 2020

Similar Records

A randomized sketching trust-region secant method for low-memory dynamic optimization
Journal Article · Wed Jun 25 00:00:00 EDT 2025 · Optimization Letters · OSTI ID:2999462

Exact and inexact subsampled Newton methods for optimization
Journal Article · Tue Apr 03 00:00:00 EDT 2018 · IMA Journal of Numerical Analysis · OSTI ID:1610078

Randomized Sketching Algorithms for Low-Memory Dynamic Optimization
Journal Article · Mon May 10 00:00:00 EDT 2021 · SIAM Journal on Optimization · OSTI ID:1784618