Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization problems”

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 793 records · Page 44

Efficient algorithms and implementations of entropy-based moment closures for rarefied gases

We present efficient algorithms and implementations of the 35-moment system equipped with the maximum-entropy closure in the context of rarefied gases. While closures based on the principle of entropy maximization have been shown to yield very promising results for moderately rarefied gas flows, the computational cost of these closures is in general much higher than for closure theories with explicit closed-form expressions of the closing fluxes, such as Grad's classical closure. Following a similar approach as Garrett et al. (2015) , we investigate efficient implementations of the computationally expensive numerical quadrature method used for the moment evaluations of the maximum-entropy distribution by exploiting its inherent fine-grained parallelism with the parallelism offered by multi-core processors and graphics cards. We show that using a single graphics card as an accelerator allows speed-ups of two orders of magnitude when compared to a serial CPU implementation. To accelerate the time-to-solution for steady-state problems, we propose a new semi-implicit time discretization scheme. The resulting nonlinear system of equations is solved with a Newton type method in the Lagrange multipliers of the dual optimization problem in order to reduce the computational cost. Additionally, fully explicit time-stepping schemes of first and second order accuracy are presented. We investigate the accuracy and efficiency of the numerical schemes for several numerical test cases, including a steady-state shock-structure problem.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Parallel simulated annealing with embedded machine learning and multifidelity models for reactor core design

This paper presents extensions to a penalty-free, parallel simulated annealing (SA) algorithm for multi-constrained combinatorial optimization with the aim of embedding multi-fidelity physics models into the annealing procedure. The method uses a low-fidelity, quickly executing model for rapid design space exploration and a high-fidelity model for detailed constraint resolution and on-the-fly bias correction. Machine learning models updated within the annealing procedure were used to bridge the gap between the multi-fidelity models, which led to accurate rapid exploration and efficient detailed constraint resolution. A software implementation of the new multi-fidelity optimization methods, called ML-PSA, was demonstrated on a continuous multi-fidelity optimization problem and a constrained combinatorial PWR lattice design problem. These problems demonstrate some of the features, parallel performance characteristics, and extensible nature of the multi-fidelity SA methods. This paper shows that the developed software and procedure are a general optimization tool that can be applied to a wide variety of scientific and engineering design optimization applications. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Experience with approximations in the trust-region parallel direct search algorithm.

Recent years have seen growth in the number of algorithms designed to solve challenging simulation-based nonlinear optimization problems. One such algorithm is the Trust-Region Parallel Direct Search (TRPDS) method developed by Hough and Meza. In this paper, we take advantage of the theoretical properties of TRPDS to make use of approximation models in order to reduce the computational cost of simulation-based optimization. We describe the extension, which we call mTRPDS, and present the results of a case study for two earth penetrator design problems. In the case study, we conduct computational experiments with an array of approximations within the mTRPDS algorithm and compare the numerical results to the original TRPDS algorithm and a trust-region method implemented using the speculative gradient approach described by Byrd, Schnabel, and Shultz. The results suggest new ways to improve the algorithm.

97 MATHEMATICS AND COMPUTING↗

An Early Quantum Computing Proposal

The D-Wave 2X is the third generation of quantum processing created by D-Wave. NASA (with Google and USRA) and Lockheed Martin (with USC), both own D-Wave systems. Los Alamos National Laboratory (LANL) purchased a D-Wave 2X in November 2015. The D-Wave 2X processor contains (nominally) 1152 quantum bits (or qubits) and is designed to specifically perform quantum annealing, which is a well-known method for finding a global minimum of an optimization problem. This methodology is based on direct execution of a quantum evolution in experimental quantum hardware. While this can be a powerful method for solving particular kinds of problems, it also means that the D-Wave 2X processor is not a general computing processor and cannot be programmed to perform a wide variety of tasks. It is a highly specialized processor, well beyond what NNSA currently thinks of as an “advanced architecture.”A D-Wave is best described as a quantum optimizer. That is, it uses quantum superposition to find the lowest energy state of a system by repeated doses of power and settling stages. The D-Wave produces multiple solutions to any suitably formulated problem, one of which is the lowest energy state solution (global minimum). Mapping problems onto the D-Wave requires defining an objective function to be minimized and then encoding that function in the Hamiltonian of the D-Wave system. The quantum annealing method is then used to find the lowest energy configuration of the Hamiltonian using the current D-Wave Two, two-level, quantum processor. This is not always an easy thing to do, and the D-Wave Two has significant limitations that restrict problem sizes that can be run and algorithmic choices that can be made. Furthermore, as more people are exploring this technology, it has become clear that it is very difficult to come up with general approaches to optimization that can both utilize the D-Wave and that can do better than highly developed algorithms on conventional computers for specific applications. These are all fundamental challenges that must be overcome for the D-Wave, or similar, quantum computing technology to be broadly applicable.

97 MATHEMATICS AND COMPUTING↗

Chance-Constrained AC Optimal Power Flow for Distribution Systems With Renewables

This paper focuses on distribution systems featuring renewable energy sources (RESs) and energy storage systems, and presents an AC optimal power flow (OPF) approach to optimize system-level performance objectives while coping with uncertainty in both RES generation and loads. The proposed method hinges on a chance-constrained AC OPF formulation where probabilistic constraints are utilized to enforce voltage regulation with prescribed probability. A computationally more affordable convex reformulation is developed by resorting to suitable linear approximations of the AC power-flow equations as well as convex approximations of the chance constraints. The approximate chance constraints provide conservative bounds that hold for arbitrary distributions of the forecasting errors. An adaptive strategy is then obtained by embedding the proposed AC OPF task into a model predictive control framework. Finally, a distributed solver is developed to strategically distribute the solution of the optimization problems across utility and customers.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Numerical study of a matrix-free trust-region SQP method for equality constrained optimization

This is a companion publication to the paper 'A Matrix-Free Trust-Region SQP Algorithm for Equality Constrained Optimization' in which we develop and analyze a trust-region sequential quadratic programming (SQP) method that supports the matrix-free (iterative, in-exact) solution of linear systems. In this report, we document the numerical behavior of the algorithm applied to a variety of equality constrained optimization problems, with constraints given by partial differential equations (PDEs).

99 GENERAL AND MISCELLANEOUS↗

SU-D-17A-03: 5D Respiratory Motion Model Based Iterative Reconstruction Method for 4D Cone-Beam CT

Purpose: The purpose of this work is to develop a new iterative reconstruction method for 4D cone-beam CT (CBCT) based on a published time-independent 5D respiratory motion model. The proposed method will offer a single high-resolution image at a user-selected breathing phase and the 5D motion model parameters, which could be used to generate the breathing pattern during the CT acquisition. Methods: 5D respiratory motion model was proposed for accurately modeling the motion of lung and lung tumor tissues. 4D images are then parameterized by a reference image, measured breathing amplitude, breathing rate, two time-independent vector fields that describe the 5D model parameters, and a scalar field that describes the change in HU as a function of breathing amplitude. In contrast with the traditional method of reconstructing multiple temporal image phases to reduce respiratory artifact, 5D model based method simplify the problem into the reconstruction of a single reference image and the 5D motion model parameters. The reconstruction formulation of the reference image and scalar and vector fields is a nonlinear least-square optimization problem that consists of solving the reference image and fields alternately, in which the reference image is regularized with the total variation sparsity transform and the vector fields are solved through linearizations regularized by the H1 norm. 2D lung simulations were performed in this proof-of-concept study. Results: The breathing amplitude, its rate, and the corresponding scalar and vector fields were generated from a patient case. Compared with filtered backprojection method and sparsity regularized iterative method for the phase-by-phase reconstruction, the proposed 5D motion model based method yielded improved image quality. Conclusion: Based on 5D respiratory motion model, we have developed a new iterative reconstruction method for 4D CBCT that has the potential for improving image quality while providing needed on-table motion information.

60 APPLIED LIFE SCIENCES↗

Explicit Solution to a Certain Non-ELQG Risk-sensitive Stochastic Control Problem

A risk-sensitive stochastic control problem with finite/infinite horizon is studied with a 1-dimensional controlled process defined by a linear SDE with a linear control-term in the drift. In the criterion function, a non-linear/quadratic term is introduced by using the solution to a Riccati differential equation, and hence, the problem is not ELQG (Exponential Linear Quadratic Gaussian) in general. For the problem, optimal value and control are calculated in explicit forms and the set of admissible risk-sensitive parameters is given in a concrete form. As applications, two types of large deviations control problems, i.e., maximizing an upside large deviations probability and minimizing a downside large deviations probability, are mentioned.

97 MATHEMATICS AND COMPUTING↗

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↗

Incorporate day-ahead robustness and real-time incentives for electricity market design

In this paper, we propose a two-stage electricity market framework to explore the participation of distributed energy resources (DERs) in a day-ahead (DA) market and a real-time (RT) market. The objective is to determine the optimal bidding strategies of the aggregated DERs in the DA market and generate online incentive signals for DER-owners to optimize the social-welfare taking into account network operational constraints. Distributionally robust optimization is used to explicitly incorporate data-based statistical information of renewable forecasts into the supply/demand decisions in the DA market. We evaluate the conservativeness of bidding strategies distinguished by different risk aversion settings. In the RT market, a bi-level time-varying optimization problem is proposed to design the online incentive signals to tradeoff the RT imbalance penalty for distribution system operators (DSOs) and the costs of individual DER-owners. This enables tracking their optimal dispatch to provide fast balancing services, in the presence of time-varying network states while satisfying the voltage regulation requirement. Simulation results on both DA wholesale market and RT balancing market demonstrate the necessity of this two-stage design, and its robustness to uncertainties, the performance of convergence, the tracking ability and the feasibility of the resulting network operations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimization-Based Formulations for Short-Circuit Studies with Inverter-Interfaced Generation in PowerModelsProtection.jl

Protecting inverter-interfaced microgrids is challenging as conventional time-overcurrent protection becomes unusable due to the lack of fault current. There is a great need for novel protective relaying methods that enable the application of protection coordination on microgrids, thereby allowing for microgrids with larger areas and numbers of loads while not compromising reliable power delivery. Tools for modeling and analyzing such microgrids under fault conditions are necessary in order to help design such protective relaying and operate microgrids in a configuration that can be protected, though there is currently a lack of tools applicable to inverter-interfaced microgrids. This paper introduces the concept of applying an optimization problem formulation to the topic of inverter-interfaced microgrid fault modeling, and discusses how it can be employed both for simulating short-circuits and as a set of constraints for optimal microgrid operation to ensure protective device coordination.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Market mechanism to enable grid-aware dispatch of Aggregators in radial distribution networks

This paper presents a market-based optimization framework wherein Aggregators can compete for nodal capacity across a distribution feeder and guarantee that allocated flexible capacity cannot cause overloads or congestion. This mechanism, thus, allows Aggregators with allocated capacity to pursue a number of services at the whole-sale market level to maximize revenue of flexible resources. Based on Aggregator bids of capacity (MW) and network access price ($/MW), the distribution system operator (DSO) formulates an optimization problem that prioritizes capacity to the different Aggregators across the network while implicitly considering AC network constraints. This grid-aware allocation is obtained by incorporating a convex inner approximation into the optimization framework that prioritizes hosting capacity to different Aggregators. We adapt concepts from transmission-level capacity market clearing, utility demand charges, and Internet-like bandwidth allocation rules to distribution system operations by incorporating nodal voltage and transformer constraints into the optimization framework. Simulation based results on IEEE distribution networks showcase the effectiveness of the approach.

Nazir, Mohammad Nawaf↗

Multi-scale Simulation, Calibration, and Optimization of Calcium Carbonate Precipitation in Microbial Communities

Ensuring the efficient engineering of microbially induced calcium carbonate precipitation (MICP) is crucial for a variety of environmental and civil engineering applications, such as soil stabilization and carbon sequestration. Addressing this need, we present a comprehensive multi-scale workflow that begins with the isolation of calcium carbonate-producing microbes from soil samples, followed by metagenomic sequencing and metabolic reconstruction. We then characterize microbial growth phenotypes under diverse nutrient conditions, compare observed growth with metabolic model predictions, and apply the Consistent Reproduction of Phenotype (CROP) algorithm to refine these models. Furthermore, we analyze metabolite consumption and production, and develop a consumer-resource model that is calibrated using time-series measurements of growth rates, pH levels, and calcium carbonate precipitation. The primary benefit of our approach lies in its ability to predict and control MICP outcomes, facilitated by a Bayesian methodology that incorporates priors on initial conditions and parameters. This allows us to compute posteriors by integrating experimental data, and to solve a risk optimization problem under uncertainty to identify nutrient conditions that maximize calcium carbonate production. In contrast to non-Bayesian methods, which fail to quantify uncertainty accurately, our approach provides a more reliable pathway to optimizing nutrient conditions, enhancing the likelihood of achieving desired MICP outcomes. This positions our method as a superior alternative in the quest to improve MICP through engineered microbial consortia.

54 ENVIRONMENTAL SCIENCES↗

An active-set algorithm and a trust-region approach in constrained minimax problem

In this paper, we propose an algorithm to solve a finite minimax problem with side constraints. An active-set strategy is used in the algorithm to transform inequality constraints to equality constraints. This allows the use of the well-developed techniques for solving the equality constrained optimization problems. A trust-region globalization strategy is added to the proposed algorithm to ensure global convergence. A projected Hessian technique is used in the algorithm to overcome the difficulty of having an infeasible trust-region subproblem.A global convergence theory for the proposed algorithm is presented under standard assumptions. Finally, numerical experiments are reported to indicate that the new algorithm performs efficiently in practice.

97 MATHEMATICS AND COMPUTING↗

Impact of graph structures for QAOA on MaxCut

The quantum approximate optimization algorithm (QAOA) is a promising method of solving combinatorial optimization problems using quantum computing. QAOA on the MaxCut problem has been studied extensively on graphs with specific structure; however, little is known about the general performance of the algorithm on arbitrary graphs. Here, we investigate how different graph characteristics correlate with QAOA performance at depths at most three on the MaxCut problem for all connected non-isomorphic graphs with at most eight vertices. Some good predictors of QAOA success relate to graph symmetries, odd cycles, and density. For example, on eight vertex graphs, the average probability for selecting an optimal solution for graphs that contain no odd cycles after three iterations of QAOA is 60.6% compared to 48.2% for those that do. The data generated from these studies are shared in a publicly accessible database to serve as a benchmark for QAOA calculations and experiments. Knowing the relationship between structure and performance can be used to identify classes of combinatorial problems that are likely to exhibit a quantum advantage.

97 MATHEMATICS AND COMPUTING↗

Reduced-order modeling on a near-term quantum computer

Quantum computing is an advancing area of research in which computer hardware and algorithms are developed to take advantage of quantum mechanical phenomena. In recent studies, quantum algorithms have shown promise in solving linear systems of equations as well as systems of linear ordinary differential equations (ODEs) and partial differential equations (PDEs). Reducedorder modeling (ROM) algorithms for studying fluid dynamics have shown success in identifying linear operators that can describe flowfields, where dynamic mode decomposition (DMD) is a particularly useful method in which a linear operator is identified from data. In this work, DMD is reformulated as an optimization problem to propagate the state of the linearized dynamical system on a quantum computer. This reformulation was chosen as a means of facilitating implementation on a near-term quantum computer. Quadratic unconstrained binary optimization (QUBO), a technique for optimizing quadratic polynomials in binary variables, allows for quantum annealing algorithms to be applied. A quantum circuit model (quantum approximation optimization algorithm, QAOA) is utilized to obtain predictions of the state trajectories. Results are shown for the quantum-ROM predictions for flow over a 2D cylinder at Re = 220 and flow over a NACA0009 airfoil at Re = 500 and α = 15°. The quantum-ROM predictions are found to depend on the number of bits utilized for a fixed point representation and the truncation level of the DMD model. Comparisons with DMD predictions from a classical computer algorithm are made, as well as an analysis of the computational complexity and prospects for future, more fault-tolerant quantum computers.

97 MATHEMATICS AND COMPUTING↗

Optimal Regulation of Virtual Power Plants

This paper develops a real-time algorithmic framework for aggregations of distributed energy resources (DERs) in distribution networks to provide regulation services in response to transmission-level requests. Leveraging online primal-dual-type methods for time-varying optimization problems and suitable linearizations of the nonlinear AC power-flow equations, we believe this work establishes the system-theoretic foundation to realize the vision of distribution-level virtual power plants. The optimization framework controls the output powers of dispatchable DERs such that, in aggregate, they respond to automatic-generation-control and/or regulation-services commands. This is achieved while concurrently regulating voltages within the feeder and maximizing customers' and utility's performance objectives. Convergence and tracking capabilities are analytically established under suitable modeling assumptions. Simulations are provided to validate the proposed approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗