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 253 records · Page 14

4-Clique network minor embedding for quantum annealers

Quantum annealing is a quantum algorithm for computing solutions to combinatorial optimization problems. This study proposes a method for minor embedding optimization problems onto sparse quantum annealing hardware graphs called 4-clique network minor embedding. This method is in contrast to the standard minor embedding technique of using a path of linearly connected qubits in order to represent a logical variable state. The 4-clique minor embedding is possible on Pegasus graph connectivity, which is the native hardware graph for some of the current D-Wave quantum annealers. The Pegasus hardware graph contains many cliques of size 4, making it possible to form a graph composed entirely of paths of connected 4-cliques on which a problem can be minor-embedded. The 4-clique chains come at the cost of additional qubit usage on the hardware graph, but they allow for stronger coupling within each chain, thereby increasing chain integrity, reducing chain breaks, and allow for greater usage of the available energy scale for programming logical problem coefficients on current quantum annealers. The 4-clique minor embedding technique is compared with the standard linear path minor embedding with experiments on two D-Wave quantum annealing processors with Pegasus hardware graphs. We show proof-of-concept experiments where the 4-clique minor embeddings can use weak chain strengths while successfully carrying out the computation of minimizing random all-to-all spin glass problem instances. Published by the American Physical Society 2024

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

SNoGloDe: A Structured Nonlinear Global Decomposition Solver

Large-scale optimization problems often require decomposition strategies and customized algorithms to achieve optimal solutions within a reasonable time. Building on the work of Cao and Zavala (2019) for solving nonlinear two-stage stochastic programs to global optimality, we implement and extend their approach. We generalize to optimization problems reformulated with a block-angular constraint structure (e.g., temporal decomposition). Our framework, written in Python using Pyomo, is highly customizable and enables parallel execution of the decomposition. SNoGloDe allows tailored branching strategies, lower bounding problems, and candidate generators to leverage problem-specific knowledge. To demonstrate effectiveness, we compare SNoGloDe’s performance with Gurobi on a temporally decomposed produced water case study.

algorithms↗

Economic Dispatch With Distributed Energy Resources: Co-Optimization of Transmission and Distribution Systems

The increasing penetration of distributed energy resources (DERs) in the distribution networks has turned the conventionally passive load buses into active buses that can provide grid services for the transmission system. To take advantage of the DERs in the distribution networks, this letter formulates a transmission-and-distribution (T&D) systems co-optimization problem that achieves economic dispatch at the transmission level and optimal voltage regulation at the distribution level by leveraging large generators and DERs. A primal-dual gradient algorithm is proposed to solve this optimization problem jointly for T&D systems, and a distributed market-based equivalent of the gradient algorithm is used for practical implementation. Finally, the results are corroborated by numerical examples with the IEEE 39-Bus system connected with 7 different distribution networks.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Alpert multi-wavelets for functional inverse problems: direct optimization and deep learning

Computational engineering models often contain unknown entities (e.g. parameters, initial and boundary conditions) that require estimation from other measured observable data. Estimating such unknown entities is challenging when they involve spatio-temporal fields because such functional variables often require an infinite-dimensional representation. Here, we address this problem by transforming an unknown functional field using Alpert wavelet bases and truncating the resulting spectrum. Hence the problem reduces to the estimation of few coefficients that can be performed using common optimization methods. We apply this method on a one-dimensional heat transfer problem where we estimate the heat source field varying in both time and space. The observable data is comprised of temperature measured at several thermocouples in the domain. This latter is composed of either copper or stainless steel. The optimization using our method based on wavelets is able to estimate the heat source with an error between 5% and 7%. We analyze the effect of the domain material and number of thermocouples as well as the sensitivity to the initial guess of the heat source. Finally, we estimate the unknown heat source using a different approach based on deep learning techniques where we consider the input and output of a multi-layer perceptron in wavelet form. We find that this deep learning approach is more accurate than the optimization approach with errors below 4%.

97 MATHEMATICS AND COMPUTING↗

JEGA V 2.3

JEGA is a software package that implements a multi-objective genetic algorithm (MOGA) for solution to multi-objective optimization problems (MOPS) and a single objective genetic algorithm (SOGA) for solution to single objective optimization problems (SOPS). JEGA is highly configurable and provides a rich set of algorithmic components for tailored optimization. It has been used successfully on many problems by users both internal and external to Sandia. By employing object-oriented design to implement abstractions of the key components making up the algorithms, JEGA provides a flexible and extensible problem-solving environment for design and performance analysis of computational models.

EDDY, JOHN↗

Probing for quantum speedup in spin-glass problems with planted solutions

The availability of quantum annealing devices with hundreds of qubits has made the experimental demonstration of a quantum speedup for optimization problems a coveted, albeit elusive goal. Going beyond earlier studies of random Ising problems, here we introduce a method to construct a set of frustrated Ising-model optimization problems with tunable hardness. We study the performance of a D-Wave Two device (DW2) with up to 503 qubits on these problems and compare it to a suite of classical algorithms, including a highly optimized algorithm designed to compete directly with the DW2. The problems are generated around predetermined ground-state configurations, called planted solutions, which makes them particularly suitable for benchmarking purposes. The problem set exhibits properties familiar from constraint satisfaction (SAT) problems, such as a peak in the typical hardness of the problems, determined by a tunable clause density parameter. We bound the hardness regime where the DW2 device either does not or might exhibit a quantum speedup for our problem set. While we do not find evidence for a speedup for the hardest and most frustrated problems in our problem set, we cannot rule out that a speedup might exist for some of the easier, less frustrated problems. Our empirical findings pertain to the specific D-Wave processor and problem set we studied and leave open the possibility that future processors might exhibit a quantum speedup on the same problem set.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal well placement and brine extraction for pressure management during CO 2 sequestration

Large-scale pressure increases resulting from carbon dioxide (CO 2 ) injection in the subsurface can potentially impact caprock integrity, induce reactivation of critically stressed faults, and drive CO 2 or brine through conductive features into shallow groundwater. Pressure management involving the extraction of native fluids from storage formations can be used to reduce such pressure increases. However, dealing with large volumes of extracted brine can be technically challenging and expensive. Selection of optimal well locations and pumping rates are critical for maximizing CO 2 storage and minimizing brine extraction during geologic CO 2 sequestration (GCS). Robust and efficient computerized algorithms combining reservoir models and optimization methods are needed to make proper decisions on well placement and pumping rates. This work presents a constrained differential evolution (CDE) algorithm for solving global optimization problems involving pressure management of GCS projects. Application of the CDE optimization methodology was demonstrated for a hypothetical CO 2 storage scenario in a deep sandstone reservoir in the Southern San Joaquin Basin in California, USA. Industrial-scale storage of CO 2 would generate significant pressure buildup in this formation, which in turn would raise concerns about induced seismicity due to presence of multiple faults surrounding the injection site. Through the CDE optimization algorithm coupled to a vertically-averaged reservoir simulator, we successfully estimated optimal solutions for brine extraction wells in the reservoir that would limit the local pressure along the faults to a prescribed threshold. Multiple realizations of the reservoir permeability field were created to understand the impact of reservoir heterogeneity on optimization results. Our results indicate that the reservoir slope and heterogeneity have significant impact on optimum extraction rates. Reservoir heterogeneity is also a significant factor for extraction well locations, suggesting that in practice decisions about extraction well placement through optimization should be made at later project stages when data from a few years of CO 2 injection have allowed iterative updating and refining of the reservoir forward models. Although the study focused on optimization of brine extraction, the CDE optimization methodology presented in this paper has also potential to solve other complex optimization problems related to GCS, such as increasing storage efficiency by enhancing injectivity and capillary and dissolution trapping.

58 GEOSCIENCES↗

Metric Learning to Accelerate Convergence of Operator Splitting Methods

Recent developments in machine learning have led to promising advances in accelerating the solution of constrained optimization problems. Increasing demand for real-time decision-making capabilities in applications such as artificial intelligence and optimal control has led to a variety of proposed strategies for learning to produce fast solutions to optimization problems. For example, recent works have shown that it is possible to accelerate the convergence of optimization algorithms by learning to select their parameters, such as gradient descent stepsizes. This work proposes a new approach, in which the underlying metric spaces of proximal operator splitting algorithms are learned to maximize convergence rate. While prior works in optimization theory have derived optimal metrics in simple cases, no such result exists for many practical problem forms including general Quadratic Programming (QP). This paper shows how differentiable optimization can enable the end-to-end learning of proximal metrics, enhancing the convergence of proximal algorithms for QP problems beyond what is possible based on known theory. Additionally, the results illustrate a strong connection between the learned proximal metrics and active constraints at the optima, leading to an interpretation in which the predicted proximal metrics can be viewed as a form of active set prediction.

King, Ethan [BATTELLE (PACIFIC NW LAB)]↗

Optipack

Used to solve basic unconstrained optimization problems that can produce smooth accurate gradients. These are standard published unconstrained optimization such as are described in the book Nocedal and Wright Numerical Optimization: 2nd edition, 2006. This software is generic to any mathematical optimization problem where smooth derivatives exist. There is no specific connection or mention whatsoever to any specific application, period. You cannot find more general mathematical software.OptiPack contains some simple optimization algorithms built on Thyra. Currently, only a few different nonlinear conjugate gradient methods are implemented.

Bartlett, Roscoe↗

Optipack

Used to solve basic unconstrained optimization problems that can produce smooth accurate gradients. These are standard published unconstrained optimization such as are described in the book Nocedal and Wright Numerical Optimization: 2nd edition, 2006. This software is generic to any mathematical optimization problem where smooth derivatives exist. There is no specific connection or mention whatsoever to any specific application, period. You cannot find more general mathematical software.OptiPack contains some simple optimization algorithms built on Thyra. Currently, only a few different nonlinear conjugate gradient methods are implemented.

Bartlett, Roscoe↗

SU-F-BRD-08: Guaranteed Epsilon-Optimal Treatment Plans with Minimum Number of Beams for SBRT Using RayStation

Purpose: To efficiently find quality-guaranteed treatment plans with the minimum number of beams for stereotactic body radiation therapy using RayStation. Methods: For a pre-specified pool of candidate beams we use RayStation (a treatment planning software for clinical use) to identify the deliverable plan which uses all the beams with the minimum dose to organs at risk (OARs) and dose to the tumor and other structures in specified ranges. Then use the dose matrix information for the generated apertures from RayStation to solve a linear program to find the ideal plan with the same objective and constraints allowing use of all beams. Finally we solve a mixed integer programming formulation of the beam angle optimization problem (BAO) with the objective of minimizing the number of beams while remaining in a predetermined epsilon-optimality of the ideal plan with respect to the dose to OARs. Since the treatment plan optimization is a multicriteria optimization problem, the planner can exploit the multicriteria optimization capability of RayStation to navigate the ideal dose distribution Pareto surface and select a plan of desired target coverage versus OARs sparing, and then use the proposed technique to reduce the number of beams while guaranteeing quality. For the numerical experiments two liver cases and one lung case with 33 non-coplanar beams are considered. Results: The ideal plan uses an impractically large number of beams. The proposed technique reduces the number of beams to the range of practical application (5 to 9 beams) while remaining in the epsilon-optimal range of 1% to 5% optimality gap. Conclusion: The proposed method can be integrated into a general algorithm for fast navigation of the ideal dose distribution Pareto surface and finding the treatment plan with the minimum number of beams, which corresponds to the delivery time, in epsilon-optimality range of the desired ideal plan. The project was supported by the Federal Share of program income earned by Massachusetts General Hospital on C06 CA059267, Proton Therapy Research and Treatment Center and partially by RaySearch Laboratories.

60 APPLIED LIFE SCIENCES↗

Frequency Analysis of Solar PV Power to Enable Optimal Building Load Control

In this paper, we present a flexibility estimation mechanism for buildings’ thermostatically controlled loads (TCLs) to enable the distribution level consumption of the majority of solar photovoltaic (PV) generation by local building TCLs. The local consumption of PV generation provides several advantages to the grid operation as well as the consumers, such as reducing the stress on the distribution network, minimizing voltage fluctuations and two-way power flows in the distribution network, and reducing the required battery storage capacity for PV integration. This would result in increasing the solar PV generation penetration levels. The aims of this study are twofold. First, spectral (frequency) analyses of solar PV power generation together with the power consumption of multiple building TCLs (such as heating, ventilation, and air conditioning (HVAC) systems, water heaters, and refrigerators) are performed. These analyses define the bandwidth over which these TCLs can operate and also describe the PV generation frequency bandwidth. Such spectral analyses, in frequency domain, can help identify the flexible components of PV generation that can be consumed by the various TCLs through optimal building load utilization. Second, a quadratic optimization problem based on model predictive control is formulated to allow consuming most of the low and medium frequency content of the PV power locally by building TCLs, while maintaining occupants’ comfort and TCLs’ physical constraints. The solution to the proposed optimization problem is achieved using optimal control strategies. Numerical results show that most of the low and medium frequency content of the PV generation can be consumed locally by building TCLs. The remaining high-frequency content of the PV generation can then be stored/offset using energy storage systems.

14 SOLAR ENERGY↗

Coordination of Wind Farm and Pumped-Storage Hydro for a Self-Healing Power Grid

The increasing penetration of wind energy poses great challenges to the operation of power systems in normal and emergency states. However, energy storage technologies can help accommodate wind power uncertainty and variability due to their flexible characteristics. This paper focuses on the restoration phase, and provides a novel coordination strategy of wind and pumped-storage hydro (PSH) units for a faster and reliable self-healing process. The wind-PSH assisted power system restoration is formulated as a two-stage adaptive robust optimization problem. The first-stage problem determines the start-up sequence of generators and the energization times of transmission paths; and the second-stage problem decides load pickup sequences, wind power dispatch levels, and PSH units' operating modes. The column-and-constraint generation decomposition algorithm is applied to solve the two-stage adaptive robust optimization problem, which has a mixed-integer optimization in the inner-level problem. The developed coordination strategy is tested on the modified IEEE 39-bus system. Numerical results demonstrate that the coordinated wind and PSH units can increase the total energy served, enhance wind power dispatchability, and reduce wind power curtailment.

17 WIND ENERGY↗

SimCCS: An open-source tool for optimizing CO 2 capture, transport, and storage infrastructure

Commercial-scale carbon capture and storage (CCS) technology will involve deploying infrastructure on a massive and costly scale. This effort will require careful and comprehensive planning to ensure that capture locations, storage sites, and the dedicated CO 2 distribution pipelines are selected in a robust and cost-effective manner. Presented in 2009, SimCCS is an optimization model for integrated system design that enables researchers, stakeholders, and policy makers to design CCS infrastructure networks. SimCCS 2.0 is a complete, ground-up redesign that is now a portable software package, useable and shareable by the CCS research, industrial, policy, and public communities. SimCCS 2.0 integrates multiple new capabilities including a refined optimization model, novel candidate network generation techniques, and optional integration with high-performance computing platforms. Accessing user-provided CO 2 source, sink, and transportation data, SimCCS 2.0 creates candidate transportation routes and formalizes an optimization problem that determines the most cost-effective CCS system design. This optimization problem is further solved either through a high-performance computing interface, or through third-party software on a local desktop computing platform. Finally, SimCCS 2.0 employs an open-access geographic information system framework to enable analysis and visualization capabilities. SimCCS 2.0 is written in Java and is publicly available via GitHub to encourage collaboration, modification, and community development.

42 ENGINEERING↗

Remarks on Hierarchic Control for a Linearized Micropolar Fluids System in Moving Domains

We study a Stackelberg strategy subject to the evolutionary linearized micropolar fluids equations in domains with moving boundaries, considering a Nash multi-objective equilibrium (non necessarily cooperative) for the “follower players” (as is called in the economy field) and an optimal problem for the leader player with approximate controllability objective. We will obtain the following main results: the existence and uniqueness of Nash equilibrium and its characterization, the approximate controllability of the linearized micropolar system with respect to the leader control and the existence and uniqueness of the Stackelberg–Nash problem, where the optimality system for the leader is given.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

nPINNs: Nonlocal physics-informed neural networks for a parametrized nonlocal universal Laplacian operator. Algorithms and applications

Physics-informed neural networks (PINNs) are effective in solving inverse problems based on differential and integro-differential equations with sparse, noisy, unstructured, and multifidelity data. PINNs incorporate all available information, including governing equations (reflecting physical laws), initial-boundary conditions, and observations of quantities of interest, into a loss function to be minimized, thus recasting the original problem into an optimization problem. In this paper, we extend PINNs to parameter and function inference for integral equations such as nonlocal Poisson and nonlocal turbulence models, and we refer to them as nonlocal PINNs (nPINNs). The contribution of the paper is three-fold. First, we propose a unified nonlocal Laplace operator, which converges to the classical Laplacian as one of the operator parameters, the nonlocal interaction radius $\delta$ goes to zero, and to the fractional Laplacian as $\delta$ goes to infinity. This universal operator forms a super-set of classical Laplacian and fractional Laplacian operators and, thus, has the potential to fit a broad spectrum of data sets. We also provide theoretical convergence rates with respect to $\delta$ and verify them via numerical experiments. Second, we use nPINNs to estimate the two parameters, $\delta$ and $\alpha$, characterizing the kernel of the unified operator. The strong non-convexity of the loss function yielding multiple (good) local minima reveals the occurrence of the operator mimicking phenomenon, that is, different pairs of estimated parameters could produce multiple solutions of comparable accuracy. Third, we propose another nonlocal operator with spatially variable order $\alpha(y)$, which is more suitable for modeling turbulent Couette flow. Our results show that nPINNs can jointly infer this function as well as $\delta$. More importantly, these parameters exhibit a universal behavior with respect to the Reynolds number, a finding that contributes to our understanding of nonlocal interactions in wall-bounded turbulence.

97 MATHEMATICS AND COMPUTING↗

Stochastic and a posteriori optimization to mitigate coil manufacturing errors in stellarator design

Abstract It was recently shown in Wechsung et al (2022 Proc. Natl Acad. Sci. USA 119 e2202084119) that there exist electromagnetic coils that generate magnetic fields, which are excellent approximations to quasi-symmetric fields and have very good particle confinement properties. Using a Gaussian process-based model for coil perturbations, we investigate the impact of manufacturing errors on the performance of these coils. We show that even fairly small errors result in noticeable performance degradation. While stochastic optimization yields minor improvements, it is not possible to mitigate these errors significantly. As an alternative to stochastic optimization, we then formulate a new optimization problem for computing optimal adjustments of the coil positions and currents without changing the shapes of the coil. These a-posteriori adjustments are able to reduce the impact of coil errors by an order of magnitude, providing a new perspective for dealing with manufacturing tolerances in stellarator design.

Physics↗