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

Randomized Sketching Algorithms for Low-Memory Dynamic Optimization

Journal Article · · SIAM Journal on Optimization
DOI:https://doi.org/10.1137/19m1272561· OSTI ID:1784618
This paper develops a novel limited-memory method to solve dynamic optimization problems. The memory requirements for such problems often present a major obstacle, particularly for problems with PDE constraints such as optimal flow control, full waveform inversion, and optical tomography. In these problems, PDE constraints uniquely determine the state of a physical system for a given control; the goal is to find the value of the control that minimizes an objective. While the control is often low dimensional, the state is typically more expensive to store. This paper suggests using randomized matrix approximation to compress the state as it is generated and shows how to use the compressed state to reliably solve the original dynamic optimization problem. Concretely, the compressed state is used to compute approximate gradients and to apply the Hessian to vectors. The approximation error in these quantities is controlled by the target rank of the sketch. This approximate first- and second-order information can readily be used in any optimization algorithm. As an example, we develop a sketched trust-region method that adaptively chooses the target rank using a posteriori error information and provably converges to a stationary point of the original problem. Numerical experiments with the sketched trust-region method show promising performance on challenging problems such as the optimal control of an advection-reaction-diffusion equation and the optimal control of fluid flow past a cylinder.
Research Organization:
Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
Sponsoring Organization:
USDOE National Nuclear Security Administration (NNSA)
Grant/Contract Number:
AC04-94AL85000
OSTI ID:
1784618
Report Number(s):
SAND--2019-13974J; 681517
Journal Information:
SIAM Journal on Optimization, Journal Name: SIAM Journal on Optimization Journal Issue: 2 Vol. 31; ISSN 1052-6234
Publisher:
Society for Industrial and Applied Mathematics (SIAM)Copyright Statement
Country of Publication:
United States
Language:
English

References (25)

Active Control and Drag Optimization for Flow Past a Circular Cylinder journal September 2000
Adjoint-based Monte Carlo calibration of financial market models journal July 2009
Lossy Compression in Optimal Control of Cardiac Defibrillation journal October 2013
Optical tomography using the time-independent equation of radiative transfer—Part 2: inverse model journal March 2002
A fast randomized algorithm for the approximation of matrices journal November 2008
Towards efficient backward-in-time adjoint computations using data compression techniques journal May 2015
Suboptimal control of turbulent channel flow for drag reduction journal March 1998
Optical tomography: forward and inverse problems journal December 2009
Linearized Inversion of Seismic Reflection Data* journal December 1984
Minimal Repetition Dynamic Checkpointing Algorithm for Unsteady Adjoint Calculation journal January 2009
New Algorithms for Optimal Online Checkpointing journal January 2010
Reduced Basis Method and A Posteriori Error Estimation for Parametrized Linear-Quadratic Optimal Control Problems journal January 2010
Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions journal January 2011
A Trust-Region Algorithm with Adaptive Stochastic Collocation for PDE Optimization under Uncertainty journal January 2013
Optimal Multistage Algorithm for Adjoint Computation journal January 2016
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
Low-Rank Tucker Approximation of a Tensor from Streaming Data journal January 2020
Analysis of Inexact Trust-Region SQP Algorithms journal January 2002
Optimal principal component analysis in distributed and streaming models
  • Boutsidis, Christos; Woodruff, David P.; Zhong, Peilin
  • STOC '16: Symposium on Theory of Computing, Proceedings of the forty-eighth annual ACM symposium on Theory of Computing https://doi.org/10.1145/2897518.2897646
conference June 2016
Algorithm 799: revolve: an implementation of checkpointing for the reverse or adjoint mode of computational differentiation journal March 2000
Fast full-wavefield seismic inversion using encoded sources journal November 2009
Adaptive waveform inversion: Theory journal November 2016
Computational Advertising: Techniques for Targeting Relevant Ads journal January 2014

Similar Records

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

An inexact semismooth Newton method with application to adaptive randomized sketching for dynamic optimization
Journal Article · Tue Oct 17 20:00:00 EDT 2023 · Finite Elements in Analysis and Design · OSTI ID:2311364

An investigation of Newton-Sketch and subsampled Newton methods
Journal Article · Tue Feb 11 19:00:00 EST 2020 · Optimization Methods and Software · OSTI ID:1657509