skip to main content


Title: Efficient One-Shot Technique for Adjoint-Based Unsteady Optimization
A computationally efficient one-shot approach with a low memory footprint is presented for unsteady optimization. The proposed technique is based on a novel and unique approach that combines local-in-time and fixed-point iteration methods to advance the unconverged primal and adjoint solutions forward and backward in time to evaluate the sensitivity of the globally time-integrated objective function. This is in some ways similar to the piggyback iterations in which primal and adjoint solutions are evaluated at a frozen design. During each cycle, the primal, adjoint, and design update problems are solved to advance the optimization problem. This new coupled approach is shown to provide significant savings in the memory footprint while reducing the computational cost of primal and adjoint evaluations per design cycle. The method is first applied to an inverse design problem for the unsteady lid-driven cavity. Following this, vortex suppression and mean drag reduction for a circular cylinder in crossflow is considered. Both of these objectives are achieved by optimizing the rotational speeds for steady or periodically oscillating excitations. For all cases presented in this work, the proposed technique is shown to provide significant reductions in memory as well as computational time. It is also shown that the unsteady optimization problem converges to the same optimal solution obtained using a conventional approach.  more » « less
Award ID(s):
1803760
NSF-PAR ID:
10280830
Author(s) / Creator(s):
;
Date Published:
Journal Name:
AIAA Journal
ISSN:
0001-1452
Page Range / eLocation ID:
1 to 17
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. A computationally efficient "one-shot" approach with a low memory footprint is presented for unsteady design optimization. The proposed technique is based on a novel and unique approach that combines "local-in-time" and fixed-point iteration methods to advance the unconverged primal and adjoint solutions forward and backward in time to evaluate the sensitivity of the globally time-integrated objective function. This is in some ways similar to the "piggyback" iterations where primal and adjoint solutions are evaluated at a frozen design. During each cycle, the primal, adjoint, and design update problems are solved to advance the optimization problem. This new coupled approach is shown to provide significant savings in the memory footprint while reducing the computational cost of primal and adjoint evaluations per design cycle. The method is first applied to an inverse design problem for the unsteady lid-driven cavity. Following this, vortex suppression and mean drag reduction for a circular cylinder in cross-flow is considered. Both of these objectives are achieved by optimizing the rotational speeds for steady or periodically oscillating excitations. For all cases presented in this work, the proposed technique is shown to provide significant reductions in memory as well as computational time. It is also shown that the unsteady design optimization problem converges to the same optimal solution obtained using a conventional approach. 
    more » « less
  2. null (Ed.)
    A memory efficient framework is developed for the aerodynamic design optimization of helicopter rotor blades in hover. This framework is based on a fully-automated discrete-adjoint toolbox called FDOT. The in-house toolbox is capable of computing sensitivity or gradient information very accurately, and uses an operator-overloading technique that takes advantage of a unique expression-template-based approach for memory and computational efficiency while still being fully-automated with minimal user interventions. The main goal of the present work is to "design" helicopter rotor blades with increased figure-of-merit. Therefore, the flow around the Caradonna-Tung rotor in non-lifting and lifting hover conditions is studied in order to validate the primal and adjoint solvers based on a rotating frame of reference formulation. The efficacy of the optimization framework is first demonstrated for drag minimization of a rotating NACA 0012 airfoil, which resembles a Vertical-Axis Wind Turbine (VAWT) configuration. Finally, the single- and multi-point design optimization results for the Caradonna-Tung rotor are presented. It is important to note that the current approach (FDOT) can be directly coupled -- in a "black-box" manner -- to other existing codes in the Helios computational platform, which is part of CREATE-AV. 
    more » « less
  3. An improved version of the Fast automatic Differentiation using Operator-overloading Technique (FDOT) toolbox is developed in this work. The enhanced sensitivity analysis toolbox utilizes an expression-based tape approach -- a first-of-its-kind implementation in Fortran programming language -- that can significantly reduce the memory footprint while improving the computational efficiency of the adjoint-based automatic differentiation (AD). In the proposed approach, the partial derivatives are calculated for each expression using the reverse adjoint accumulation for the active variables involved on the right-hand-side of that expression. The recorded partial derivative information is then used in a very efficient adjoint evaluation process to calculate the entire Jacobian information. The enhanced toolbox is coupled with the in-house UNstructured PArallel Compressible (UNPAC) flow solver for a robust design optimization framework, called UNPAC-DOF. The efficiency and robustness of the proposed technique and the resulting framework are tested for aerodynamic shape optimization problems applied to airfoil and wing geometries. 
    more » « less
  4. N/A (Ed.)
    Abstract

    Partial differential equation (PDE)-constrained inverse problems are some of the most challenging and computationally demanding problems in computational science today. Fine meshes required to accurately compute the PDE solution introduce an enormous number of parameters and require large-scale computing resources such as more processors and more memory to solve such systems in a reasonable time. For inverse problems constrained by time-dependent PDEs, the adjoint method often employed to compute gradients and higher order derivatives efficiently requires solving a time-reversed, so-called adjoint PDE that depends on the forward PDE solution at each timestep. This necessitates the storage of a high-dimensional forward solution vector at every timestep. Such a procedure quickly exhausts the available memory resources. Several approaches that trade additional computation for reduced memory footprint have been proposed to mitigate the memory bottleneck, including checkpointing and compression strategies. In this work, we propose a close-to-ideal scalable compression approach using autoencoders to eliminate the need for checkpointing and substantial memory storage, thereby reducing the time-to-solution and memory requirements. We compare our approach with checkpointing and an off-the-shelf compression approach on an earth-scale ill-posed seismic inverse problem. The results verify the expected close-to-ideal speedup for the gradient and Hessian-vector product using the proposed autoencoder compression approach. To highlight the usefulness of the proposed approach, we combine the autoencoder compression with the data-informed active subspace (DIAS) prior showing how the DIAS method can be affordably extended to large-scale problems without the need for checkpointing and large memory.

     
    more » « less
  5. o shift the computational burden from real-time to offline in delay-critical power systems applications, recent works entertain the idea of using a deep neural network (DNN) to predict the solutions of the AC optimal power flow (AC-OPF) once presented load demands. As network topologies may change, training this DNN in a sample-efficient manner becomes a necessity. To improve data efficiency, this work utilizes the fact OPF data are not simple training labels, but constitute the solutions of a parametric optimization problem. We thus advocate training a sensitivity-informed DNN (SI-DNN) to match not only the OPF optimizers, but also their partial derivatives with respect to the OPF parameters (loads). It is shown that the required Jacobian matrices do exist under mild conditions, and can be readily computed from the related primal/dual solutions. The proposed SI-DNN is compatible with a broad range of OPF solvers, including a non-convex quadratically constrained quadratic program (QCQP), its semidefinite program (SDP) relaxation, and MATPOWER; while SI-DNN can be seamlessly integrated in other learning-to-OPF schemes. Numerical tests on three benchmark power systems corroborate the advanced generalization and constraint satisfaction capabilities for the OPF solutions predicted by an SI-DNN over a conventionally trained DNN, especially in low-data setups. 
    more » « less