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

TRACKING CODE DEVELOPMENT FOR BEAM DYNAMICS OPTIMIZATION

Dynamic aperture (DA) optimization with direct particle tracking is a straight forward approach when the computing power is permitted. It can have various realistic errors included and is more close than theoretical estimations. In this approach, a fast and parallel tracking code could be very helpful. In this presentation, we describe an implementation of storage ring particle tracking code TESLA for beam dynamics optimization. It supports MPI based parallel computing and is robust as DA calculation engine. This code has been used in the NSLS-II dynamics optimizations and obtained promising performance.

43 PARTICLE ACCELERATORS↗

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↗

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 ↗

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 ↗

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↗

Optimal dynamical decoupling sequence for the Ohmic spectrum

The optimal dynamical decoupling sequence for a qubit coupled to an Ohmic environment is investigated. By analytically computing the derivatives of the decoherence function, the optimal pulse locations are found to satisfy a set of nonlinear equations which can be easily solved. These equations incorporate the environment information such as the high-energy (UV) cutoff frequency {omega}{sub c}, giving a complete description of the decoupling process. The solutions explain previous experimental and theoretical results of locally optimized dynamical decoupling sequence in high-frequency-dominated environment, which were obtained by purely numerical computation and experimental feedback. As shown in numerical comparison, these solutions outperform the Uhrig dynamical decoupling sequence by one or more orders of magnitude in the Ohmic case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

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↗

Reduced-Order Model for Dynamic Optimization of Pressure Swing Adsorption

The last few decades have seen a considerable increase in the applications of adsorptive gas separation technologies, such as pressure swing adsorption (PSA). From an economic and environmental point of view, hydrogen separation and carbon dioxide capture from flue gas streams are the most promising applications of PSA. With extensive industrial applications, there is a significant interest for an efficient modeling, simulation, and optimization strategy. However, the design and optimization of the PSA processes have largely remained an experimental effort because of the complex nature of the mathematical models describing practical PSA processes. The separation processes are based on solid-gas equilibrium and operate under periodic transient conditions. Models for PSA processes are therefore multiple instances of partial differential equations (PDEs) in time and space with periodic boundary conditions that link the processing steps together and high nonlinearities arising from non-isothermal effects. The computational effort required to solve such systems is usually quite expensive and prohibitively time consuming. Besides this, stringent product specifications, required by many industrial processes, often lead to convergence failures of the optimizers. The solution of this coupled stiff PDE system is governed by steep concentrations and temperature fronts moving with time. As a result, the optimization of such systems for either design or operation represents a significant computational challenge to current differential algebraic equation (DAE) optimization techniques and nonlinear programming algorithms. Sophisticated optimization strategies have been developed and applied to PSA systems with significant improvement in the performance of the process. However, most of these approaches have been quite time consuming. This gives a strong motivation to develop cost-efficient and robust optimization strategies for PSA processes. Moreover, in case of flowsheet optimization, if dynamic PSA models are incorporated with other steady state models in the flowsheet then it will require much faster approaches for integrated optimization.

08 HYDROGEN↗

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↗

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↗

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↗

Nonlinear dynamics optimization with particle swarm and genetic algorithms for SPEAR3 emittance upgrade

Nonlinear dynamics optimization is carried out for a low emittance upgrade lattice of SPEAR3 in order to improve its dynamic aperture and Touschek lifetime. Two multi-objective optimization algorithms, a genetic algorithm and a particle swarm algorithm, are used for this study. The performance of the two algorithms are compared. The result shows that the particle swarm algorithm converges significantly faster to similar or better solutions than the genetic algorithm and it does not require seeding of good solutions in the initial population. These advantages of the particle swarm algorithm may make it more suitable for many accelerator optimization applications.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

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↗

Rigorous bounds for optimal dynamical decoupling

We present rigorous performance bounds for the optimal dynamical decoupling pulse sequence protecting a quantum bit (qubit) against pure dephasing. Our bounds apply under the assumption of instantaneous pulses and of bounded perturbing environment and qubit-environment Hamiltonians such as those realized by baths of nuclear spins in quantum dots. We show that if the total sequence time is fixed the optimal sequence can be used to make the distance between the protected and unperturbed qubit states arbitrarily small in the number of applied pulses. If, on the other hand, the minimum pulse interval is fixed and the total sequence time is allowed to scale with the number of pulses, then longer sequences need not always be advantageous. The rigorous bound may serve as a testbed for approximate treatments of optimal decoupling in bounded models of decoherence.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗