Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Nonlinear 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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Investigating nonlinear magnetohydrodynamics in an optimized, reactor-scale quasi-axisymmetric stellarator

We use the new simulation capabilities of the extended-magnetohydrodynamic (MHD) code, M3D-C1, to investigate the nonlinear MHD properties of a reactor-scale quasisymmetric stellarator equilibrium. Our model captures the self-consistent evolution of the magnetic field, temperature, density, and flow profiles without imposing restrictions on the structure of the first. We include the effects of resistivity using a realistic temperature-dependent Spitzer model, along with a model for heat transport that captures the key physical characteristic, namely, strongly anisotropic diffusion in directions perpendicular and parallel to the magnetic field. We consider a quasi-axisymmetric, finite-pressure equilibrium that was optimized for self-consistent bootstrap current, quasi-symmetry, and energetic particle confinement. Our assessment finds that the equilibrium is highly unstable to interchange-like pressure-driven instabilities near the plasma edge. The initially unstable modes rapidly destabilize other modes in the direction of the N-fold rotational symmetry (toroidal, in this case). For this equilibrium, N = 2, meaning destabilization of a large number of even-numbered toroidal Fourier modes. Thus, field-periodicity is likely to be an important factor in the nonlinear MHD stability characteristics of optimized stellarators.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Adjoint DSMC for nonlinear Boltzmann equation constrained optimization

Applications for kinetic equations such as optimal design and inverse problems often involve finding unknown parameters through gradient-based optimization algorithms. Based on the adjoint-state method, we derive two different frameworks for approximating the gradient of an objective functional constrained by the nonlinear Boltzmann equation. While the forward problem can be solved by the DSMC method, it is difficult to efficiently solve the high-dimensional continuous adjoint equation obtained by the “optimize-then-discretize” approach. This challenge motivates us to propose an adjoint DSMC method following the “discretize-then-optimize” approach for Boltzmann-constrained optimization. We also analyze the properties of the two frameworks and their connections. Here, several numerical examples are presented to demonstrate their accuracy and efficiency.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations

Many applications require minimizing the sum of smooth and nonsmooth functions. For example, basis pursuit denoising problems in data science require minimizing a measure of data misfit plus an $\ell^1$-regularizer. Similar problems arise in the optimal control of partial differential equations (PDEs) when sparsity of the control is desired. Here, we develop a novel trust-region method to minimize the sum of a smooth nonconvex function and a nonsmooth convex function. Our method is unique in that it permits and systematically controls the use of inexact objective function and derivative evaluations. When using a quadratic Taylor model for the trust-region subproblem, our algorithm is an inexact, matrix-free proximal Newton-type method that permits indefinite Hessians. We prove global convergence of our method in Hilbert space and demonstrate its efficacy on three examples from data science and PDE-constrained optimization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Optimal Power Flow Derived Sparse Linear Solver Benchmarks

Due to the changing nature of the power grid, it is increasingly important to be able to solve a high-fidelity optimal power-flow models on large power networks. This high-fidelity problem, called AC Optimal Power Flow (ACOPF), is a nonlinear, nonconvex optimization problem. One of the few reliable ways of solving such a problem is interior point methods. These methods result in sparse linear systems where the coefficient matrix is symmetric, indefinite and nearly always ill-conditioned. As such, they are particularly challenging for sparse linear solvers and represent a considerable computational bottleneck in solving the ACOPF problem. In this paper, we introduce a repository of linear systems captured from ACOPF problems when solved by the open-source optimizer IPOPT. These matrices are meant to be used as a test suite for sparse linear solver development.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Bayesian optimization of Fisher Information in nonlinear multiresonant quantum photonics gyroscopes

Abstract We propose an on-chip gyroscope based on nonlinear multiresonant optics in a thin film χ (2) resonator that combines high sensitivity, compact form factor, and low power consumption simultaneously. We theoretically analyze a novel holistic metric – Fisher Information capacity of a multiresonant nonlinear photonic cavity – to fully characterize the sensitivity of our gyroscope under fundamental quantum noise conditions. Leveraging Bayesian optimization techniques, we directly maximize the nonlinear multiresonant Fisher Information. Our holistic optimization approach orchestrates a harmonious convergence of multiple physical phenomena – including noise squeezing, nonlinear wave mixing, nonlinear critical coupling, and noninertial signals – all encapsulated within a single sensor-resonator, thereby significantly augmenting sensitivity. We show that ∼ 470 × $\sim 470{\times}$ improvement is possible over the shot-noise limited linear gyroscope with the same footprint, intrinsic quality factors, and power budget.

42 ENGINEERING↗
DOE OSTI2024

Sparse Cholesky factorization for solving nonlinear PDEs via Gaussian processes

In recent years, there has been widespread adoption of machine learning-based approaches to automate the solving of partial differential equations (PDEs). Among these approaches, Gaussian processes (GPs) and kernel methods have garnered considerable interest due to their flexibility, robust theoretical guarantees, and close ties to traditional methods. They can transform the solving of general nonlinear PDEs into solving quadratic optimization problems with nonlinear, PDE-induced constraints. However, the complexity bottleneck lies in computing with dense kernel matrices obtained from pointwise evaluations of the covariance kernel, and its partial derivatives, a result of the PDE constraint and for which fast algorithms are scarce. The primary goal of this paper is to provide a near-linear complexity algorithm for working with such kernel matrices. We present a sparse Cholesky factorization algorithm for these matrices based on the near-sparsity of the Cholesky factor under a novel ordering of pointwise and derivative measurements. The near-sparsity is rigorously justified by directly connecting the factor to GP regression and exponential decay of basis functions in numerical homogenization. We then employ the Vecchia approximation of GPs, which is optimal in the Kullback-Leibler divergence, to compute the approximate factor. This enables us to compute ϵ-approximate inverse Cholesky factors of the kernel matrices with complexity O(N log d (N/ϵ)) in space and O(N log 2d (N/ϵ)) in time. We integrate sparse Cholesky factorizations into optimization algorithms to obtain fast solvers of the nonlinear PDE. We numerically illustrate our algorithm’s near-linear space/time complexity for a broad class of nonlinear PDEs such as the nonlinear elliptic, Burgers, and Monge-Ampère equations. In summary, we provide a fast, scalable, and accurate method for solving general PDEs with GPs and kernel methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Gradient-based constrained optimization using a database of linear reduced-order models

A methodology grounded in model reduction is presented for accelerating the gradient-based solution of a family of linear or nonlinear constrained optimization problems where the constraints include at least one linear Partial Differential Equation (PDE). A key component of this methodology is the construction, during an offline phase, of a database of pointwise, linear, Projection-based Reduced-Order Models (PROM)s associated with a design parameter space and the linear PDE(s). A parameter sampling procedure based on an appropriate saturation assumption is proposed to maximize the efficiency of such a database of PROMs. A real-time method is also presented for interpolating at any queried but unsampled parameter vector in the design parameter space the relevant sensitivities of a PROM. The practical feasibility, computational advantages, and performance of the proposed methodology are demonstrated for several realistic, nonlinear, aerodynamic shape optimization problems governed by linear aeroelastic constraints.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Robust Optimal Experimental Design of Infinite-Dimensional Bayesian Nonlinear Inverse Problems

Abstract. We consider robust optimal experimental design (ROED) for nonlinear Bayesian inverse problems governed by partial differential equations (PDEs). An optimal design is one that maximizes some utility quantifying the quality of the solution of an inverse problem. However, the optimal design is dependent on elements of the inverse problem such as the simulation model, the prior, or the measurement error model. ROED aims to produce an optimal design that is aware of the additional uncertainties encoded in the inverse problem and remains optimal even after variations in them. We follow a worst-case scenario approach to develop a new framework for robust optimal design of nonlinear Bayesian inverse problems. The proposed framework (a) is scalable and designed for infinite-dimensional Bayesian nonlinear inverse problems constrained by PDEs; (b) develops efficient approximations of the utility, namely the expected information gain; (c) employs eigenvalue sensitivity techniques to develop analytical forms and efficient evaluation methods of the gradient of the utility with respect to the uncertainties against which we wish to be robust; and (d) employs a probabilistic optimization paradigm that properly defines and efficiently solves the resulting combinatorial max-min optimization problem. The effectiveness of the proposed approach is illustrated for optimal sensor placement problem in an inverse problem governed by an elliptic PDE.

Chowdhary, Abhijit↗
DOE OSTI2025

Optimal Power Management for Large-Scale Battery Energy Storage Systems via Bayesian Inference

Large-scale battery energy storage systems (BESS) have found ever-increasing use across industry and society to accelerate clean energy transition and improve energy supply reliability and resilience. However, their optimal power management poses significant challenges: the underlying high-dimensional nonlinear nonconvex optimization lacks computational tractability in real-world implementation, and the uncertainty of the exogenous power demand makes exact optimization difficult. This paper presents a new solution framework to address these bottlenecks. The solution pivots on introducing power-sharing ratios to specify each cell’s power quota from the output power demand. To find the optimal power-sharing ratios, we formulate a nonlinear model predictive control (NMPC) problem to achieve power-loss-minimizing BESS operation while complying with safety, cell balancing, and power supply-demand constraints. We then propose a parameterized control policy for the power-sharing ratios, which utilizes only three parameters, to reduce the computational demand in solving the NMPC problem. This policy parameterization allows us to translate the NMPC problem into a Bayesian inference problem for the sake of 1) computational tractability, and 2) overcoming the nonconvexity of the optimization problem. We leverage the ensemble Kalman inversion technique to solve the parameter estimation problem. Concurrently, a low-level control loop is developed to seamlessly integrate our proposed approach with the BESS to ensure practical implementation. This low-level controller receives the optimal power-sharing ratios, generates output power references for the cells, and maintains a balance between power supply and demand despite uncertainty in output power. We conduct extensive simulations and experiments on a 20-cell prototype to validate the proposed approach.

Battery energy storage systems (BESSs)↗
DOE OSTI2023

Modeling and Rapid Prototyping of Integrated Transmission-Distribution OPF Formulations with PowerModelsITD.jl

Conventional electric power systems are composed of different unidirectional power flow stages of generation, transmission, and distribution, managed independently by transmission system and distribution system operators. However, as distribution systems increase in complexity due to the integration of distributed energy resources, coordination between transmission and distribution networks will be imperative for the optimal operation of the power grid. However, coupling models and formulations between transmission and distribution is non-trivial, in particular due to the common practice of modeling transmission systems as single-phase, and distribution systems as multi-conductor phase-unbalanced. To enable the rapid prototyping of power flow formulations, in particular in the modeling of the boundary conditions between these two seemingly incompatible data models, we introduce PowerModelsITD.jl, a free, open-source toolkit written in Julia for integrated transmission-distribution (ITD) optimization that leverages mature optimization libraries from the InfrastructureModels.jl-ecosystem. The primary objective of the proposed framework is to provide baseline implementations of steady-state ITD optimization problems, while providing a common platform for the evaluation of emerging formulations and optimization problems. In this work, we introduce the nonlinear formulations currently supported in PowerModelsITD.jl, which include AC-polar, AC-rectangular, current-voltage, and a linear network transportation model. Results are validated using combinations of IEEE transmission and distribution networks.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

A mixed-integer PDE-constrained optimization formulation for constructing electromagnetic cloaks with multiple materials

We study the design of an electromagnetic cloak from multiple materials with an additional constraint on the mass of the cloak. Our problem is an example of a topology optimization problem, and we formulate this problem as a mixed-integer partial-differential equation constrained optimization (MIPDECO) problem, where Maxwell’s equation models the propagation of the wave through the cloak and surrounding medium. We use binary variables to model the assignment of the different materials, and their relevant properties (permittivity and density). The mass constraint adds a nontrivial constraint to this problem. We propose a two-phase strategy to solve this problem. In the first phase, we solve a continuous relaxation, and then propose a new variant of the feasibility pump that exploits the structure of the PDE to obtain an initial integral solution candidate. In the second phase, we use a trust-region approach to improve this incumbent. We also consider a continuation or mesh-sequencing approach to find better solutions faster on consecutively finer meshes. We present detailed numerical results to illustrate the effectiveness of our approaches for constructing multi-material cloaks with a mass constraint.

Calculus of Variations and Optimization↗
DOE OSTI2021

Data-driven Chaos Indicator for Nonlinear Dynamics and Applications on Storage Ring Lattice Design

A data-driven chaos indicator concept is introduced to characterize the degree of chaos for nonlinear dynamical systems. The indicator is represented by the prediction accuracy of surrogate models established purely from data. It provides a metric for the predictability of nonlinear motions in a given system. When using the indicator to implement a tune-scan for a quadratic Hénon map, the main resonances and their asymmetric stop-band widths can be identified. When applied to particle transportation in a storage ring, as particle motion becomes more chaotic, its surrogate model prediction accuracy decreases correspondingly. Therefore, the prediction accuracy, acting as a chaos indicator, can be used directly as the objective for nonlinear beam dynamics optimization. This method provides a different perspective on nonlinear beam dynamics and an efficient method for nonlinear lattice optimization. Applications in dynamic aperture optimization are demonstrated as real world examples.

43 PARTICLE ACCELERATORS↗
DOE OSTI2021

Multiscale design of nonlinear materials using a Eulerian shape optimization scheme

Motivated by recent advances in manufacturing, the design of materials is the focal point of interest in the material research community. One of the critical challenges in this field is finding optimal material microstructure for a desired macroscopic response. This work presents a computational method for the mesoscale-level design of particulate composites for an optimal macroscale-level response. The method relies on a custom shape optimization scheme to find the extrema of a nonlinear cost function subject to a set of constraints. Three key “modules” constitute the method: multiscale modeling, sensitivity analysis, and optimization. Multiscale modeling relies on a classical homogenization method and a nonlinear NURBS-based generalized finite element scheme to efficiently and accurately compute the structural response of particulate composites using a nonconformal discretization. A three-parameter isotropic damage law is used to model microstructure-level failure. An analytical sensitivity method is developed to compute the derivatives of the cost/constraint functions with respect to the design variables that control the microstructure's geometry. The derivation uncovers subtle but essential new terms contributing to the sensitivity of finite element shape functions and their spatial derivatives. Several structural problems are solved to demonstrate the applicability, performance, and accuracy of the method for the design of particulate composites with a desired macroscopic nonlinear stress-strain response.

42 ENGINEERING↗
DOE OSTI2020

A scalable matrix-free spectral element approach for unsteady PDE constrained optimization using PETSc/TAO

In this work, we provide a new approach for the efficient matrix-free application of the transpose of the Jacobian for the spectral element method for the adjoint-based solution of partial differential equation (PDE) constrained optimization. This results in optimizations of nonlinear PDEs using explicit integrators where the integration of the adjoint problem is not more expensive than the forward simulation. Solving PDE constrained optimization problems entails combining expertise from multiple areas, including simulation, computation of derivatives, and optimization. The Portable, Extensible Toolkit for Scientific computation (PETSc) together with its companion package, the Toolkit for Advanced Optimization (TAO), is an integrated numerical software library that contains an algorithmic/software stack for solving linear systems, nonlinear systems, ordinary differential equations, differential algebraic equations, and large-scale optimization problems and, as such, is an ideal tool for performing PDE-constrained optimization. This paper describes an efficient approach in which the software stack provided by PETSc/TAO can be used for large-scale nonlinear time-dependent problems. Time integration can involve a range of high-order methods, both implicit and explicit. The PDE-constrained optimization algorithm used is gradient-based and seamlessly integrated with the simulation of the physical problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Data-driven chaos indicator for nonlinear dynamics and applications on storage ring lattice design

A data-driven chaos indicator concept is introduced to characterize the degree of chaos for nonlinear dynamical systems. The indicator is represented by the prediction accuracy of surrogate models established purely from data. It provides a metric for the predictability of nonlinear motions in a given system. When using the indicator to implement a tune-scan for a quadratic Hénon map, the main resonances and their asymmetric stop-band widths can be identified. When applied to particle transportation in a storage ring, as particle motion becomes more chaotic, its surrogate model prediction accuracy decreases correspondingly. So, the prediction accuracy, acting as a chaos indicator, can be used directly as the objective for nonlinear beam dynamics optimization. This method provides a different perspective on nonlinear beam dynamics and an efficient method for nonlinear lattice optimization. Applications in dynamic aperture optimization are demonstrated as real world examples.

36 MATERIALS SCIENCE↗