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 955 records · Page 53

A trust region algorithm for PDE-constrained optimization with bound constraints using reduced order modeling

This paper presents a novel trust region algorithm that relies on proper orthogonal de-composition techniques to construct accurate reduced order models during optimization.The algorithm samples high fidelity snapshots to compute the POD functions that are used to generate reduced order models. The reduced order models are used to replace the computationally intensive high fidelity finite element evaluations during optimization.The proposed algorithm employs a trust region framework to detect loss in predictive ac-curacy in the reduced order model and automatically update the POD functions during optimization. The trust region framework allows the algorithm to use sound mathematical metrics to effectively improve the accuracy and robustness of the reduced order models during optimization. The algorithm also employs a projected gradient algorithm to model bound constraints and compute optimal and feasible controls.This paper also presents an accurate Hessian formulation for topology optimization problems. The proposed trust region framework relies on a quadratic model to update the control. This quadratic model needs reliable second order derivative information to predict the behavior of the objective function within a suitable trust region. If a nonlinear Hessian formulation is used, the computational effort increases due to additional finite element evaluations. The proposed linear Hessian formulation reduces the computational effort and enables the calculation of the second order derivative information without additional finite element model evaluations. Examples in topology optimization are presented to demonstrate the applicability of the proposed algorithm and linear Hessian formulation for large-scale PDE-constrained optimization.

bound constraints↗

Net Present Value Optimization of a Natural Gas Combined Cycle Plant with CO 2 Capture using a Water-Lean Solvent Considering Transient Electricity Price for Multiple Regions

Global CO 2 emissions are increasing at about a 1.5% rate per year. Fossil fuel-based plants are one of the main contributors to this rise. In the power generation industry, fossil fuel plants are dominant, and many plants are under development. In this study, a natural gas combined cycle (NGCC) power plant with postcombustion capture using a leading water-lean solvent is considered. For optimal design and operating schedule, large-scale dynamic optimization is undertaken for net present value (NPV) optimization. The first principle dynamic model of NGCC is developed, including a model of the highly efficient H-class gas turbines. For computational tractability of the dynamic optimization problem, a reduced-order model is developed by using the Hankel singular value decomposition. A waterlean solvent, N-(2-ethoxyethyl)-3-morpholinopropan-1-amine, is used for carbon capture. A model of the capture system is developed in Aspen Plus, which is used to develop a reduced-order model by using ALAMO, a machine learning software. In addition, a reduced model of the CO 2 compression system with a dehydration unit is also considered. The integrated system is used for NPV optimization by using the Python-based PYOMO platform. The PCC process is analyzed for three configurations-conventional packed bed, rotating packed bed (RPB), and a combination of RPB and direct contact cooler. The NPV optimization is performed for 14 regional markets by considering year-long clustered and continuous locational marginal price data with a 1 h interval. Optimization results show that the PCC can achieve 90% CO 2 capture with a positive NPV for six regions. Sensitivity studies conducted by using the PCC configurations indicate that the process is economically feasible for 9 regions out of 14 regional electricity markets with NPV values in the range of 33−540 $MM.

cabon capture↗

Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs

We extend and improve recent results given by Singh and Watson on using classical bounds on the union of sets in a chance-constrained optimization problem. Specifically, we revisit the so-called Dawson and Sankoff bound that provided one of the best approximations of a chance constraint in the previous analysis. Next, we show that our work is a generalization of the previous work, and in fact the inequality employed previously is a very relaxed approximation with assumptions that do not generally hold. Computational results demonstrate on average over a 43% improvement in the bounds. As a byproduct, we provide an exact reformulation of the floor function in optimization models.

97 MATHEMATICS AND COMPUTING↗

Newton-based optimization for Kullback-Leibler nonnegative tensor factorizations

Tensor factorizations with nonnegativity constraints have found application in analysing data from cyber traffic, social networks, and other areas. We consider application data best described as being generated by a Poisson process (e.g. count data), which leads to sparse tensors that can be modelled by sparse factor matrices. In this paper, we investigate efficient techniques for computing an appropriate canonical polyadic tensor factorization based on the Kullback–Leibler divergence function. We propose novel subproblem solvers within the standard alternating block variable approach. Our new methods exploit structure and reformulate the optimization problem as small independent subproblems. We employ bound-constrained Newton and quasi-Newton methods. Finally, we compare our algorithms against other codes, demonstrating superior speed for high accuracy results and the ability to quickly find sparse solutions.

97 MATHEMATICS AND COMPUTING↗

Resilient Reinforcement in Secure State Estimation against Sensor Attacks with a priori Information

This paper deals with the state estimation problem in the presence of malicious sensor attacks. Unlike the existing work, in this paper, we address the problem with a priori information of the state to be estimated. Specifically, we address three prior knowledge: the sparsity information, (alpha, n_0)-sparsity information, and side information, and in each scenario, we show that the state can be reconstructed even if more sensors are compromised. This implies that the prior information reinforces the system resilience against sensor attacks. Then, an estimator under sensor attacks considering the information is developed and, under a certain condition, the estimator can be relaxed into a tractable convex optimization problem. Further, we extend this analysis to systems in presence of measurement noises, and it is shown that the prior information reduces the state-estimation error caused by the noise. Here, the numerical simulations in a diffusion process finally illustrate the reinforcement and error-reduction results with the information.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Data-driven Minimum Entropy Control for Stochastic Nonlinear Systems using the Cumulant-Generating Function

Here, we present a novel minimum entropy control algorithm for a class of stochastic nonlinear systems subjected to non-Gaussian noises. The entropy control can be considered as an optimization problem for the system randomness attenuation, but the mean value has to be considered separately. To overcome this disadvantage, a new representation of the system stochastic properties was given using the cumulant-generating function based on the moment-generating function, in which the mean value and the entropy was reflected by the shape of the cumulant-generating function. Based on the samples of the system output and control input, a time-variant linear model was identified, and the minimum entropy optimization was transformed to system stabilization. Then, an optimal control strategy was developed to achieve the randomness attenuation, and the boundedness of the controlled system output was analyzed. The effectiveness of the presented control algorithm was demonstrated by a numerical example. In this paper, a data-driven minimum entropy design is presented without pre-knowledge of the system model; entropy optimization is achieved by the system stabilization approach in which the stochastic distribution control and minimum entropy are unified using the same identified structure; and a potential framework is obtained since all the existing system stabilization methods can be adopted to achieve the minimum entropy objective.

42 ENGINEERING↗

SU-E-T-368: Evaluating Dosimetric Outcome of Modulated Photon Radiotherapy (XMRT) Optimization for Head and Neck Patients

Purpose: The dosimetric outcome of optimized treatment plans obtained by modulating the photon beamlet energy and fluence on a small cohort of four Head and Neck (H and N) patients was investigated. This novel optimization technique is denoted XMRT for modulated photon radiotherapy. The dosimetric plans from XMRT for H and N treatment were compared to conventional, 6 MV intensity modulated radiotherapy (IMRT) optimization plans. Methods: An arrangement of two non-coplanar and five coplanar beams was used for all four H and N patients. Both XMRT and IMRT were subject to the same optimization algorithm, with XMRT optimization allowing both 6 and 18 MV beamlets while IMRT was restricted to 6 MV only. The optimization algorithm was based on a linear programming approach with partial-volume constraints implemented via the conditional value-at-risk method. H and N constraints were based off of those mentioned in the Radiation Therapy Oncology Group 1016 protocol. XMRT and IMRT solutions were assessed using metrics suggested by International Commission on Radiation Units and Measurements report 83. The Gurobi solver was used in conjunction with the CVX package to solve each optimization problem. Dose calculations and analysis were done in CERR using Monte Carlo dose calculation with VMC{sub ++}. Results: Both XMRT and IMRT solutions met all clinical criteria. Trade-offs were observed between improved dose uniformity to the primary target volume (PTV1) and increased dose to some of the surrounding healthy organs for XMRT compared to IMRT. On average, IMRT improved dose to the contralateral parotid gland and spinal cord while XMRT improved dose to the brainstem and mandible. Conclusion: Bi-energy XMRT optimization for H and N patients provides benefits in terms of improved dose uniformity to the primary target and reduced dose to some healthy structures, at the expense of increased dose to other healthy structures when compared with IMRT.

60 APPLIED LIFE SCIENCES↗

Optimization of Energy Storage System Economics and Controls by Incorporating Battery Degradation Costs in REopt

The use of stationary electrochemical energy storage systems utilizing lithium-ion batteries has increased rapidly as the production scale and price for lithium-ion batteries has decreased. These energy storage systems are crucial for maintaining grid resiliency, especially for grids operating with high penetration of renewable energy generation assets or for with a variety of distributed energy generation and storage systems. One challenging factor for the development of battery energy storage systems is estimating the proper sizing, in terms of both power and energy, that minimizes total costs over the lifetime of the systems; this calculation is difficult in simple cases, where a battery is costed independently, but is extremely challenging when building loads and electrical generation by photovoltaic resources are also considered. REopt is a techoeconomic optimization tool developed by NREL to address these challenges. Previously, battery degradation has been priced by simply assuming a 10-year replacement schedule for battery systems. However, this does not account for varying degradation trends observed across real-world batteries, or allow for batteries to be operated in a degradation-aware manner that optimizes battery dispatch based on operating costs. This work incorporates a battery life model into REopt. This battery life model is simple, so that it may be solvable within the constrains of a mixed-integer linear optimization problem, but is fit to accelerated aging data recorded in the lab. To achieve the best possible accuracy for lifetime estimates given these constraints, parameters for the battery life model in REopt are estimated by fitting 20-year simulations of battery life after identifying state-space battery degradation model from accelerated aging data. Comparisons of battery life predicted in REopt and from the state-space battery degradation model to ensure validity of lifetime estimates made by REopt. Battery life and cost is optimized by controlling three decision to minimize system life cost: battery sizing, daily state-of-charge, and daily energy-throughput. The cost of battery degradation as a function of these control variables is then estimated assuming two possible maintenance strategies: replacement, where the entire battery system is replaced if cell reach an end-of-life capacity threshold; and augmentation, which establishes a fund to pay for continual purchase of new batteries to maintain the initial energy capacity of the system. These two strategies offer conservative (for replacement) and optimistic (for augmentation) bounds for total system cost. The degradation cost incurred by these strategies is then used to control battery dispatch decisions, operating the battery in a degradation-aware manner that maximizes battery lifetime while also providing energy when favorable. Because the mixed-integer linear program has perfect foresight of future energy needs, batteries with degradation costs are always operated using 'just-in-time' charging, which is unrealistic, as no energy is left in the storage system to perform other energy services or to serve as emergency back-up power. To combat this, an inequality constraint on the average annual state-of-charge is imposed, and the sensitivity of system cost to average stored energy, e.g., the cost of system resiliency, can be quantified. Analysis of results has several conclusions, for instance, oversizing of battery storage systems is not a cost burden when battery storage is an optimal solution, as any additional battery capacity can simply be utilized to avoid costs of purchasing energy from a utility.

battery↗

On the Convergence of the Inexact Running Krasnosel'skii-Mann Method

This letter leverages a framework based on averaged operators to tackle the problem of tracking fixed points associated with maps that evolve over time. In particular, this letter considers the Krasnosel'skii-Mann (KM) method in a settings where: 1) the underlying map may change at each step of the algorithm, thus leading to a 'running' implementation of the KM method, and 2) an imperfect information of the map may be available. An imperfect knowledge of the maps can capture cases where processors feature a finite precision or quantization errors, or the case where (part of) the map is obtained from measurements. The analytical results are applicable to inexact running algorithms for solving optimization problems, whenever the algorithmic steps can be written in the form of (a composition of) averaged operators; examples are provided for inexact running gradient methods and the forward-backward splitting method. Convergence of the average fixed-point residual is investigated for the non-expansive case; linear convergence to a unique fixed-point trajectory is showen in the case of inexact running algorithms emerging from contractive operators.

97 MATHEMATICS AND COMPUTING↗

Performance Evaluations of Noisy Approximate Quantum Fourier Arithmetic

The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route towards a numerical quantum-computational paradigm. In this paper, we utilize efficient techniques to implement QFT-based integer addition and multiplications. These operations are fundamental to various quantum applications including Shor’s algorithm, weighted sum optimization problems in data processing and machine learning and quantum algorithms requiring inner products. We carry out performance evaluations of these implementations based on IBM’s superconducting qubit architecture using different compatible noise models. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, and the number of the arithmetic operands’ superposed integer states. We analyze performance, and identify the most effective approximation depths for quantum add and quantum multiply within the given context. We observe significant dependency of the optimal approximation depth on the degree of machine noise and the number of superposed states in certain performance regimes. Finally, we elaborate on the algorithmic challenges - relevant to signed, unsigned, modular and non-modular versions - that could also be applied to current implementations of QFT-based subtraction, division, exponentiation, and their potential tensor extensions. Here, we analyze performance trends in our results and speculate on possible future development within this computational paradigm.

97 MATHEMATICS AND COMPUTING↗

Coastal Community Resiliency Enhancement Using Marine Hydrokinetic (MHK) Resources and Networked Microgrids

Enormous challenges are inherent in the operation of modern distribution grids. In particular, distribution feeders can be severely compromised under extreme conditions such as large-scale weather events (e.g., hurricanes, floods, and other types of natural disasters). To combat this problem, they turn to local energy support from distributed energy resources, such as solar and wind, marine hydrolinetic (MHK), and other types of energy. In this report, we investigate the actual characteristics of MHK resources to enhance coastal community resiliency. Two typical types of MHK resources (i.e., wave and tidal resources) illustrate the coastal resilience enhancement framework. By identifying their operational characteristics, such as target time-scales and potential power generation variations, we detail a holistic coastal community resiliency enhancement framework that integrates both optimization and control efforts. The optimization problem is formulated to significantly minimize the power outage time at the critical infrastructures in coastal communities by implementing multiple autonomous and dynamic microgrids around MHK resources. Therefore, during severe power outages caused by natural disasters (e.g., floods, hurricanes), the coastal community load profiles can be satisfied using local MHK resources in each microgrid with limited or no power support from upstream power grids.

16 TIDAL AND WAVE POWER↗

Deep kernel methods learn better: from cards to process optimization

Abstract The ability of deep learning methods to perform classification and regression tasks relies heavily on their capacity to uncover manifolds in high-dimensional data spaces and project them into low-dimensional representation spaces. In this study, we investigate the structure and character of the manifolds generated by classical variational autoencoder (VAE) approaches and deep kernel learning (DKL). In the former case, the structure of the latent space is determined by the properties of the input data alone, while in the latter, the latent manifold forms as a result of an active learning process that balances the data distribution and target functionalities. We show that DKL with active learning can produce a more compact and smooth latent space which is more conducive to optimization compared to previously reported methods, such as the VAE. We demonstrate this behavior using a simple cards dataset and extend it to the optimization of domain-generated trajectories in physical systems. Our findings suggest that latent manifolds constructed through active learning have a more beneficial structure for optimization problems, especially in feature-rich target-poor scenarios that are common in domain sciences, such as materials synthesis, energy storage, and molecular discovery. The Jupyter Notebooks that encapsulate the complete analysis accompany the article.

97 MATHEMATICS AND COMPUTING↗

Deep Learning–Assisted Multiobjective Optimization of Geological CO 2 Storage Performance under Geomechanical Risks

In geological CO 2 storage, designing the optimal well control strategy for CO 2 injection to maximize CO 2 storage while minimizing the associated geomechanical risks is not trivial. This challenge arises due to pressure buildup, CO 2 plume migration, the highly nonlinear nature of geomechanical responses to rock-fluid interaction, and the high computational cost associated with coupled flow and geomechanics simulations. In this paper, we introduce a novel optimization framework to address these challenges. The optimization problem is formulated as follows: maximize total CO 2 storage while minimizing geomechanical risks by adjusting the injection schedules within bounded constraints. The geomechanical risks are primarily driven by injection-induced pressure build-up, which is characterized by ground displacement and the induced microseismicity. We used the Fourier neural operator (FNO)-based deep learning model to construct surrogate models, replacing the time-consuming coupled flow and geomechanics simulations for evaluating the aforementioned objective functions. The developed surrogate models have been incorporated into a multiobjective optimization framework through a genetic algorithm to reduce the computational burden. The proposed optimization framework reduces the computational cost from approximately 2,400 hours, when using objective function evaluations based on physics-based simulations, to around 20 minutes. A set of Pareto-optimal solutions of the proposed workflow yields nontrivial optimal decisions, reducing the microseismicity potential and the vertical displacement. This Pareto front highlights the optimal trade-offs between CO 2 storage amount, safety, and ground displacement, emphasizing the need for careful optimization and management of injection strategies to achieve a balanced outcome. The novelty of this work is twofold. First, we demonstrate the importance of incorporating the minimization of the geomechanical risks as objective functions into the CO 2 storage optimization workflow to mitigate the potential risk of induced microseismicity and ground displacement. Second, we leverage the FNO-based surrogate models to optimize a real-field CO 2 storage operation.

42 ENGINEERING↗

Topology optimization of additively manufactured fluidic components free of internal support structures

This report integrates projection-based approaches for implementing overhang constraints with fluid topology optimization to design additively manufactured fluidic components that do not require internal support structures. Internal support structures are challenging, potentially impossible to remove in complex fluid networks, yet would degrade fluidic performance if left within the part. This presents a major challenge in coupling topology optimization with additive manufacturing in the design of fluid components. The proposed approach leverages past work in overhang constraints for solid mechanics, including projection formulations and adjoint sensitivity analysis, and considers incompressible Navier–Stokes equations for laminar fluid flow. The approach is demonstrated on 2D and 3D fluid topology optimization problems to minimize pressure drop and constrain mass flow rates in pipes and manifolds. Resulting designs are crisp, logical, satisfy performance constraints, and satisfy overhang constraints, eliminating the need for internal support structures.

42 ENGINEERING↗

Managing Wildfire Risk and Promoting Equity through Optimal Configuration of Networked Microgrids

As climate change increases the risk of large-scale wildfires, wildfire ignitions from electric power lines are a growing concern. To mitigate the wildfire ignition risk, many electric utilities de-energize power lines to prevent electric faults and failures. These preemptive power shutoffs are effective in reducing ignitions, but they could result in wide-scale power outages. Advanced technology, such as networked microgrids, can help reduce the size of the resulting power outages; however, even microgrid technology might not be sufficient to supply power to everyone, thus forcing hard questions about how to prioritize the provision of power among customers. In this paper, we present an optimization problem that configures networked microgrids to manage wildfire risk while maximizing the power served to customers; however, rather than simply maximizing the amount of power served in kilowatts, our formulation also considers the ability of customers to cope with power outages, as measured by social vulnerability, and it discourages the disconnection of particularly vulnerable customer groups. To test our model, we leverage a synthetic but realistic distribution feeder, along with publicly available social vulnerability indices and satellite-based wildfire risk map data, to quantify the parameters in our optimal decision-making model. Our case study results demonstrate the benefits of networked microgrids in limiting load shed and promoting equity during scenarios with high wildfire risk.

distribution systems↗

Quantum adiabatic machine learning by zooming into a region of the energy surface

Recent work has shown that quantum annealing for machine learning, referred to as QAML, can perform comparably to state-of-the-art machine learning methods with a specific application to Higgs boson classification. Here, we propose QAML-Z, an algorithm that iteratively zooms in on a region of the energy surface by mapping the problem to a continuous space and sequentially applying quantum annealing to an augmented set of weak classifiers. Results on a programmable quantum annealer show that QAML-Z matches classical deep neural network performance at small training set sizes and reduces the performance margin between QAML and classical deep neural networks by almost 50% at large training set sizes, as measured by area under the receiver operating characteristic curve. The significant improvement of quantum annealing algorithms for machine learning and the use of a discrete quantum algorithm on a continuous optimization problem both opens a class of problems that can be solved by quantum annealers and suggests the approach in performance of near-term quantum machine learning towards classical benchmarks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Automating Genetic Algorithm Mutations for Molecules Using a Masked Language Model

Inspired by the evolution of biological systems, genetic algorithms have been applied to generate solutions for optimization problems in a variety of scientific and engineering disciplines. For a given problem, a suitable genome representation must be defined along with a mutation operator to generate subsequent generations. Unlike natural systems which display a variety of complex rearrangements (e.g. mobile genetic elements), mutation for genetic algorithms commonly utilizes only random point-wise changes. Furthermore, generalizing beyond point-wise mutations poses a key difficulty as useful genome rearrangements depend on the representation and problem domain. To move beyond the limitations of manually defined point-wise changes, here we propose the use of techniques from masked language models to automatically generate mutations. As a first step, common subsequences within a given population are used to generate a vocabulary. The vocabulary is then used to tokenize each genome. A masked language model is trained on the tokenized data in order to generate possible rearrangements (i.e. mutations). In order to illustrate the proposed strategy, we use string representations of molecules and use a genetic algorithm to optimize for drug-likeness and synthesizability. Finally, our results show that moving beyond random point-wise mutations accelerates genetic algorithm optimization.

59 BASIC BIOLOGICAL SCIENCES↗

Quantum key distribution with finite resources: Secret key rates via Renyi entropies

A realistic quantum key distribution (QKD) protocol necessarily deals with finite resources, such as the number of signals exchanged by the two parties. We derive a bound on the secret key rate which is expressed as an optimization problem over Renyi entropies. Under the assumption of collective attacks by an eavesdropper, a computable estimate of our bound for the six-state protocol is provided. This bound leads to improved key rates in comparison to previous results.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗