Search NASA⌕ Search

SEARCH · Search NASA

Results for “dynamic optimization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

A framework for modeling and optimizing dynamic systems under uncertainty

Algebraic modeling languages (AMLs) have drastically simplified the implementation of algebraic optimization problems. However, there are still many classes of optimization problems that are not easily represented in most AMLs. These classes of problems are typically reformulated before implementation, which requires significant effort and time from the modeler and obscures the original problem structure or context. In this work we demonstrate how the Pyomo AML can be used to represent complex optimization problems using high-level modeling constructs. We focus on the operation of dynamic systems under uncertainty and demonstrate the combination of Pyomo extensions for dynamic optimization and stochastic programming. We use a dynamic semibatch reactor model and a large-scale bubbling fluidized bed adsorber model as test cases.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Storage ring nonlinear dynamics optimization with multi-objective multi-generation Gaussian process optimizer

Nonlinear beam dynamics optimization is essential in a low emittance storage ring design. Multi-objective optimization algorithms are needed in order to simultaneously optimize the dynamic aperture and the momentum aperture. In this study we demonstrate the application of a highly efficient stochastic optimization algorithm, the multi-generation Gaussian process optimizer (MG-GPO), to storage ring nonlinear dynamics optimization by successfully applying the method to the SPEAR3 upgrade lattice. It is shown that the new method, owing to its capability of selecting high rank candidates from a large number of trial solutions, converges significantly faster than the commonly used traditional algorithms, multi-objective genetic algorithms (MOGA) and particle swarm optimization (PSO).

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2023

A parallel variable population multi-objective optimizer for accelerator beam dynamics optimization

The simultaneous optimization of multiple objective functions is needed in many particle accelerator applications. In this paper, we present a parallel evolution based multi-objective optimizer that uses a variable population from generation to generation and an external storage to save good solutions. Two heuristic optimization methods, one uses the unified differential evolution and the other uses the real-coded genetic algorithm, are included in the optimizer to generate next generation candidate solutions, and are compared in the test examples. Finally, as an application, we applied this optimizer to the beam dynamics design optimization of a photoinjector and attained the optimal front solutions after 200 generations with the unified differential evolution offspring production scheme.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2025

A randomized sketching trust-region secant method for low-memory dynamic optimization

The numerical solution of dynamic optimization problems is often limited by the memory required to store the state trajectory, which is used to evaluate the objective function and its derivatives. Recently, [R. Muthukumar et al., SIAM Journal on Optimization 31(2), pp. 1242–1275 (2021)] introduced a trust-region method for dynamic optimization that employs randomized sketching to compress the state trajectory, resulting in inexact derivative computations. By adaptively learning the sketch rank, the trust-region algorithm achieves rigorous convergence guarantees. Here, we extend this approach to use secant Hessian approximations. Due to the randomness introduced by the sketch, the traditional secant update formulae can produce poor Hessian approximations. In particular, the difference of two gradients, computed from two different sketches, may be inconsistent. To overcome this, we employ a sketched approximation of the Hessian application, in lieu of computing the gradient difference. We numerically demonstrate the improved stability of this approach on an example from PDE-constrained optimization.

dynamic optimization↗
DOE OSTI2026

Memory-efficient nonsmooth dynamic optimization using adaptive randomized compression

Dynamic optimization problems arise in many applications including flow control, full waveform inversion, and medical imaging. These problems are plagued by significant computational challenges. One such challenge — and the focus of this work — is the memory limitation induced by the size of the underlying dynamical system. In particular, the entire dynamic trajectory is required for derivative computation and therefore must be stored or recomputed using, e.g., checkpointing. Although recent work demonstrated the use of adaptive randomized sketching to overcome the memory challenge, that work only applies to smooth unconstrained problems, prohibiting its use for nonsmooth regularized and constrained problems. The inclusion of nonsmooth regularizers and constraints is critical as they often arise in an attempt to preserve certain physical properties or to promote sparsity. To solve these problems, we introduce a trust-region algorithm for minimizing the sum of a smooth nonconvex function and a nonsmooth convex function that leverages randomized sketching to compress the dynamical system trajectories and adaptively adjust the sketch rank to satisfy a gradient inexactness condition. We prove convergence of this algorithm and demonstrate that it achieves substantial memory reduction on three discretized PDE-constrained optimization applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A direct transcription-based multiple shooting formulation for dynamic optimization

The growing need for fast and efficient solution techniques for solving dynamic optimization problems is driven by a broad spectrum of applications in scheduling and control. We suggest a novel framework for dynamic optimization that utilizes a multiple shooting “backbone” with discrete rather than continuous subproblems, thereby eliminating need for repeated time-integration. A Lagrangian relaxation (LR)-based decomposition scheme is proposed, which dualizes the state continuity requirements between subproblems and enables parallel solution of the problem. We demonstrate the applicability of our method on two case studies: the Van der Pol oscillator and a batch reactor.

42 ENGINEERING↗
DOE OSTI2018

Bi-Level Dynamic Optimization with Feedback

This paper considers a bi-level real-time algorithmic framework for networked systems, consisting of several local controllers and a central controller. The central controller issues setpoints to the local controllers to optimize their operational objectives while satisfying system-wide constraints. In this context, the paper develops an online algorithm for tracking the optimal solution of the underlying dynamic optimization problem. The design of the algorithm is based on a projected-gradient method, suitably modified to accommodate appropriate measurements (i.e., feedback). Optimality claims are established in terms of the dynamic regret of the algorithm; the latter is a natural performance criterion in nonstationary environments associated with real-time control problems. Finally, the application of the algorithm to real-time control of power setpoints in an electrical grid is illustrated.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

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 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.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Randomized Sketching Algorithms for Low-Memory Dynamic Optimization

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.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Dynamic optimization with flexible heat integration of a solar parabolic trough collector plant with thermal energy storage used for industrial process heat

There is an increasing need to reduce fossil fuel consumption used for industrial process heat to slow the effects of climate change. Using solar thermal heat is a viable way to replace fossil fuel use, but solar industrial process heat plants have limited implementation due to large upfront costs and inefficiencies from the inherent variability from solar energy. Having more flexible and optimized control over these plants can enable them to be more efficient. Here in this work, a solar industrial process heat plant with thermal energy storage that can flexibly collect and deliver heat to two industrial processes (flexible heat integration) is dynamically modeled with control setpoints found by a dynamic optimization method. The optimized case can increase the solar efficiency of the plant by 7.5% on average relative to a base case. The results show that it is best to collect heat at lower temperatures for all but ideal solar conditions, only medium to high quality heat should be stored in large quantities, and exchanging heat with a lower temperature heat sink is generally more efficient. The optimized case is able to reduce the levelized cost of heat of the plant to $31.83/MWh th compared to a base case value of $34.10/MWh th . The optimized case can reduce emissions by 22.2% compared to a plant which uses only natural gas. This work shows that dynamic optimization with flexible heat integration can be a cost-effective way to increase efficiency so that more of these types of plants can be implemented.

14 SOLAR ENERGY↗
DOE OSTI2024

Advanced Process Control and Dynamic Optimization of Reversible Solid Oxide Cell Systems for Performance and Long-Term Health

This presentation was delivered at the 2024 Hydrogen Annual Merit Review Meeting. It focuses on three aspects of projects focusing on solid oxide cell systems- advanced control including nonlinear model predictive control and traditional control, dynamic optimization with due consideration of chemical degradation over the cell lifetime, dynamic optimization considering physical degradation.

Allan, Douglas↗
DOE OSTI2021

Multiobjective Dynamic Optimization for Optimal Load-Following of Natural Gas Combined Cycle Power Plants under Stress Constraints

With the increasing penetration of intermittent renewable energy sources into the electric grid, there is an associated need for conventional thermal power plants that are designed to operate at base-load conditions to cycle their load rapidly and frequently and operate under low-load conditions. Fast load-following operations lead to plant efficiency loss and the reduction of equipment life. A high-fidelity dynamic model of a natural gas combined cycle power plant, with rigorous equipment level submodels, is developed to capture the plant transient performance and the thermomechanical stress evolution at the high-pressure drum is computed to assess the drum life consumption. Stress evolution is modeled for the location of the edge at the drum/downcomer junction that experiences high circumferential stress amplitude during the fast load-following operation, leading to higher fatigue damage than locations considered under existing design standards. A dynamic optimization problem is solved for optimal load-following operation. Depending on the value of the stress constraint and the desired ramp rate, satisfying the desired stress constraint may be infeasible without relaxing the ramp rate. A multiobjective dynamic optimization problem is solved using a lexicographic approach that minimizes ramp rate relaxation and maximizes efficiency while satisfying stress constraints, avoiding spraying to saturation, and maintaining main steam and reheat steam temperature within bounds. It was observed that the optimal ramp rate can be highly nonlinear as opposed to the industry-standard linear ramp rate. Nonlinear optimal ramp-rate profiles not only help to avoid stress constraints that may be unavoidable by using the linear profile but also result in higher efficiency than the linear profile. Furthermore, the study shows that there is a strong tradeoff between the relaxation in the plant ramp rate and the time-average thermal efficiency.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

Optimal dynamic control for a maglev vehicle moving on multi-span guideway girders

Abstract An optimal control algorithm using a virtual tuned mass damper called virtual TMD to control the levitation force of a magnetic system is developed for resonance suppression of a maglev vehicle moving on multi-span guideway girders. Since the optimal dynamic parameters of a TMD in vibration control are well developed, the optimal tuning gains required to control the magnetic oscillations of the maglev bogie can be directly used and fed back to the maglev control system. To address the dynamic interaction analysis from the maglev vehicle to the guideway girders and vice versa, the entire coupling system is decomposed into two subsystems, one is the moving vehicle subsystem and another the stationary guideway subsystem. Then, an incremental–iterative procedure associated with the Newmark method is presented to solve the two sets of subsystem equations. Finally, the control effectiveness and parametric studies of the optimal virtual TMD scheme on resonance reduction of the moving maglev vehicle are demonstrated.

Liu, Linya↗
DOE OSTI2018

Sensitivity of joint contagiousness and susceptibility-based dynamic optimal control strategies for HIV prevention

Predicting the population-level effects of an infectious disease intervention that incorporate multiple modes of intervention is complicated by the joint non-linear dynamics of both infection transmission and the intervention itself. In this paper, we consider the sensitivity of Dynamic Optimal Control Profiles (DOCPs) for the optimal joint investment in both a contagiousness and susceptibility-based control of HIV to bio-behavioral, economic, and programmatic assumptions. The DOCP is calculated using recently developed numerical algorithms that allow controls to be represented by a set of piecewise constant functions that maintain a constant yearly budget. Our transmission model assumes multiple stages of HIV infection corresponding to acute and chronic infection and both within- and between-individual behavioral heterogeneity. We parameterize a baseline scenario from a longitudinal study of sexual behavior in MSM and consider sensitivity of the DOCPs to deviations from that baseline scenario. In the baseline scenario, the primary determinant of the dominant control were programmatic factors, regardless of budget. In sensitivity analyses, the qualitative aspects of the optimal control policy were often robust to significant deviation in assumptions regarding transmission dynamics. In addition, we found several conditions in which long-term joint investment in both interventions was optimal. Our results suggest that modeling in the service of decision support for intervention design can improve population-level effects of a limited set of economic resources. We found that economic and programmatic factors were as important as the inherent transmission dynamics in determining population-level intervention effects. Given our finding that the DOCPs were robust to alternative biological and behavioral assumptions it may be possible to identify DOCPs even when the data are not sufficient to identify a transmission model.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2017

COMPARISON OF NONLINEAR DYNAMICS OPTIMIZATION METHODS FOR APS-U

Many different objectives and genetic algorithms have been proposed for storage ring nonlinear dynamics performance optimization. These optimization objectives include nonlinear chromaticities and driving/detuning terms, on-momentum and off-momentum dynamic acceptance, chromatic detuning, local momentum acceptance, variation of transverse invariant, Touschek lifetime, etc. In this paper, the effectiveness of several different optimization methods and objectives are compared for the nonlinear beam dynamics optimization of the Advanced Photon Source upgrade (APS-U) lattice. The optimized solutions from these different methods are preliminarily compared in terms of the dynamic acceptance, local momentum acceptance, chromatic detuning, and other performance measures.

APS-U∗↗
DOE OSTI2020

Dynamic optimization and economic evaluation of flexible heat integration in a hybrid concentrated solar power plant

Hybridization of concentrated solar power (CSP) plants provides flexibility in operation that can drastically improve the solar-to-electric (STE) efficiency and levelized cost of electricity (LCOE) relative to standalone CSP plants. Flexible heat integration (FHI) is a novel concept where the collection and integration of CSP within a power plant is modified relative to the amount of solar energy available. FHI improves the thermal efficiency of a hybrid solar tower steam Rankine cycle power plant but leads to increased pumping needs due to continuously elevated molten salt flow rates through the collection system, which can negatively impact STE efficiency. The present work is carried out to maximize the STE efficiency of a hybrid CSP plant utilizing FHI by employing a dynamic optimization framework where a genetic algorithm optimizes the operation of the plant over a given solar irradiance profile. The study concerns a plant hypothetically located in Salt Lake City, Utah. Here, the optimization results confirm the accuracy of a predictive heuristic where the preferred operation of the plant can be estimated relative to local peaks in the incident power generated by the heliostat collection field. The optimized FHI operation demonstrates a yearly STE efficiency of 13.8%, whereas the equivalent base-level hybrid and solar-only plants exhibit solar efficiencies of 13.4% and 11.2%, respectively. Economic analysis shows that FHI reduces yearly natural gas costs, leading to a $\$0.5$/MWh reduction in LCOE relative to the base-level hybrid configuration. Overall, the results show that hybrid FHI schemes exhibit economic benefits along with observed thermodynamic improvements.

14 SOLAR ENERGY↗
DOE OSTI2025

Energy efficiency in industrial drying: A hybrid ultrasonic system with a novel dynamic optimization framework

Drying processes are among the most energy-consuming operations in industrial and manufacturing settings, demanding strategic selection, design, and control for enhanced efficiency. Advancing drying technologies is critical for improving sustainability, lowering energy use, reducing carbon emissions, and minimizing waste. This study explores two innovative strategies aimed at transforming drying processes into sustainable, low-carbon systems by reducing energy consumption, minimizing waste, and maintaining a strong emphasis on preserving product quality. The first strategy showcases a sub-pilot scale hybrid ultrasonic-convective dryer for agrifood products. This technology, powered by electricity (process electrification), integrates non-thermal ultrasonic dehydration with convective heating and is presented as a sustainable and energy-efficient solution that enhances eco-friendly practices. The second strategy involves introducing and implementing a novel, multiobjective, mixed integer dynamic optimization technique to determine the optimal time-dependent process parameter values for the drying operation. This optimization technique yields operating conditions that are piecewise constant in time aiming to maximize the energy efficiency of the hybrid ultrasonic-convective dryer while ensuring strict adherence to product quality constraints. By adopting the hybrid ultrasonic-convective dryer, a notable 35% improvement in energy efficiency was achieved compared to conventional hot-air drying systems for drying apple slices. The proposed optimization framework further enhanced energy efficiency by nearly 14% over the most efficient process on the identical testbed, under static operating conditions. The reported enhancements have been experimentally validated. Regarding drying time (thereby improving production yield), the developed hybrid ultrasonic-convective dryer demonstrates as much as a 41% reduction in total processing time, which is further optimized by an additional 10% using our proposed optimization framework. The research outcomes have profound implications for the design and operation of drying systems, encompassing crucial aspects such as process electrification, cost-effectiveness, energy savings, time efficiency, product yield, product quality, and process automation.

Dynamic optimization↗