Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimized”

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 739 records · Page 41
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Optimal Design and Operation of Intensified Absorbers with 3D-Printed Packing for Solvent-Based CO 2 Capture

Many potential solvent-based carbon capture processes suffer from a high heat of absorption of CO 2 that adversely affects the thermodynamic driving force. While interstage coolers are often used for removing a portion of the generated heat by removing the solvent or a portion of the solvent from a stage and cooling and returning it back to the absorber, they can be placed only at discrete locations in the tower. This work investigates intensified absorbers with 3D-printed packing that includes an internal cooler and therefore can be potentially used for maximizing the operational efficiency of the absorbers for CO 2 capture. The intensified absorber is modeled by using a generic, first-principles, equation-oriented absorber column model. Since the placement of these intensified packings would cause a loss of area/volume used for mass transfer, optimization of the proposed intensified absorber is performed by optimally selecting the locations at which to place these devices and designing them such that the trade-off due to the addition of the heat removal area and the resulting loss in the mass transfer area is accounted for. Results show that optimally placed and designed intensified packings can lead to a significant increase in the capture efficiency of the process in comparison to a similar column with no internal cooling. It is also observed that by optimally placing and designing intensified packings, the lean solvent flow rate to the absorber can be decreased, and the CO 2 lean loading can be increased while still maintaining the same capture efficiency. These process changes can lead to a substantial reduction in the cost of capture.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Optimizing the HSX stellarator for microinstability by coil-current adjustments

Abstract The optimization of helically symmetric experiment (HSX) for reduced microinstability has been achieved by examining a large set of configurations within a neighborhood of the standard operating configuration. This entailed generating a database of more than 10 6 magnetic-field configurations for HSX by varying the currents in external coils. Using a set of volume-averaged metrics and gyrokinetic simulations, this database has helped to identify a set of configurations that can be used to regulate trapped-electron-mode stability in HSX. This set of configurations is also found to correlate flux-surface elongation and triangularity with an increase in magnetic-well depth, an increase in rotational transform, and low neoclassical heat-flux relative to the standard quasi-helically-symmetric configuration. These results demonstrate sensitivity of plasma behavior in response to changes in a 3D magnetic field to both neoclassical and gyrokinetic models, and the experimental potential in HSX to explore turbulence optimization. This perturbative optimization approach is not unique to HSX, and can readily be deployed on existing fusion devices to identify novel magnetic-fields to be used in turbulence-optimization experiments.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Comparing three generations of D-Wave quantum annealers for minor embedded combinatorial optimization problems

Abstract Quantum annealing (QA) is a novel type of analog computation that aims to use quantum mechanical fluctuations to search for optimal solutions of Ising problems. QA in the transverse Ising model, implemented on D-Wave quantum processing units, are available as cloud computing resources. In this study we report concise benchmarks across three generations of D-Wave quantum annealers, consisting of four different devices, for the NP-hard discrete combinatorial optimization problems unweighted maximum clique and unweighted maximum cut on random graphs. The Ising, or equivalently quadratic unconstrained binary optimization, formulation of these problems do not require auxiliary variables for order reduction, and their overall structure and weights are not highly variable, which makes these problems simple test cases to understand the sampling capability of current D-Wave quantum annealers. All-to-all minor embeddings of size 52, with relatively uniform chain lengths, are used for a direct comparison across the Chimera, Pegasus, and Zephyr device topologies. A grid-search over annealing times and the minor embedding chain strengths is performed in order to determine the level of reasonable performance for each device and problem type. Experiment metrics that are reported are approximation ratios for non-broken chain samples, chain break proportions, and time-to-solution for the maximum clique problem instances. How fairly the quantum annealers sample optimal maximum cliques, for instances which contain multiple maximum cliques, is quantified using entropy of the measured ground state distributions. The newest generation of quantum annealing hardware, which has a Zephyr hardware connectivity, performed the best overall with respect to approximation ratios and chain break frequencies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Robust Optimization for the Day-Ahead Scheduling of Cascaded Hydroelectric Systems

Uncertain electricity prices resulting from the re-structuring of electricity market have brought new opportu-nities and challenges for hydroelectric producers. This paper presents a data-driven robust optimization approach for the day-ahead scheduling of cascaded hydroelectric systems (CHS) with electricity price uncertainty. In this paper, a minimum volume enclosing ellipsoid (MVEE) is adopted to construct an ellipsoidal uncertainty set that fully identifies and exploits the historical characteristics data. Here, a second-order conic optimization formulation of the robust counterpart is derived for efficient computation. A real-world case study is conducted to demonstrate the capability of the proposed optimization approach compared with the traditional robust optimization approach.

13 HYDRO ENERGY↗
DOE OSTI2021

Network-Level Optimization for Unbalanced Power Distribution System: Approximation and Relaxation

The nonlinear programming (NLP) problem to solve distribution-level optimal power flow (D-OPF) poses convergence issues and does not scale well for unbalanced distribution systems. The existing scalable D-OPF algorithms either use approximations that are not valid for an unbalanced power distribution system, or apply relaxation techniques to the nonlinear power flow equations that do not guarantee a feasible power flow solution. In this paper, we propose scalable D-OPF algorithms that simultaneously achieve optimal and feasible solutions by solving multiple iterations of approximate, or relaxed, D-OPF subproblems of low complexity. The first algorithm is based on a successive linear approximation of the nonlinear power flow equations around the current operating point, where the D-OPF solution is obtained by solving multiple iterations of a linear programming (LP) problem. The second algorithm is based on the relaxation of the nonlinear power flow equations as conic constraints together with directional constraints, which achieves optimal and feasible solutions over multiple iterations of a second-order cone programming (SOCP) problem. Finally, it is demonstrated that the proposed algorithms are able to reach an optimal and feasible solution while significantly reducing the computation time as compared to an equivalent NLPD-OPF model for the same distribution system.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

GOOML Big Kahuna Forecast Modeling and Genetic Optimization Files

This submission includes example files associated with the Geothermal Operational Optimization using Machine Learning (GOOML) Big Kahuna fictional power plant, which uses synthetic data to model a fictional power plant. A forecast was produced using the GOOML data model framework and fictional input data, and a genetic optimization is included which determines optimal flash plant parameters. The inputs and outputs associated with the forecast and genetic optimization are included. The input and output files consist of data, configuration files, and plots. A link to the Physics-Guided Neural Networks (phygnn) GitHub repository is also included, which augments a traditional neural network loss function with a generic loss term that can be used to guide the neural network to learn physical or theoretical constraints. phygnn is used by the GOOML framework to help integrate its machine learning models into the relevant physics and engineering applications. Note that the data included in this submission are intended to provide a demonstration of GOOML's capabilities. Additional files that have not been released to the public are needed for users to run these models and reproduce these results. Units can be found in the readme data resource.

15 GEOTHERMAL ENERGY↗
DOE OSTI2020

Demand Response Optimization and Management System for Real-TIme (DROMS-RT)

To design and demonstrate DROMS-RT, a highly distributed Demand Response Optimization and Management System for Real-Time (DROMS-RT) power flow control to support large scale integration of distributed renewable generation into the grid. AutoGrid developed a novel control and communications platform to allow highly dispatchable demand response (DR) services in time frames suitable for providing ancillary services to the transmission grid. These services will be substantially less expensive and more efficient than other forms of ancillary services options currently available to manage the intermittency associated with large-scale renewable integration. DROMSRT successfully leveraged Automated Demand Response (ADR) by fundamentally re-thinking the architecture of the DR platform from the ground up and by developing innovative new technologies in a number of areas related to DR. DROMS-RT leveraged the low-cost, open, interoperable DR signaling technology, OpenADR, and low-cost, internet-protocol based telemetry solutions to reduce the cost of hardware. This allowed DROMS-RT to provide dynamic price signals to millions of OpenADR clients. Statistically rigorous signal processing techniques were developed to reliably detect even small load reductions in the presence of noisy baseline profiles. Novel forecasting engines based on modern online machine learning algorithms enabled accurate individualized forecasts for customer loads in the presence of dynamic pricing signals, and a real-time decision engines enabled continuous optimization and optimal dispatch of DR resources across a large portfolio of heterogeneous loads that respond at varying time-scales. Moreover, the real-time optimization conducted by the decision engine can utilize grid physics to maximize load reduction at the transmission system in addition to the distribution sites, for more efficient grid operation. Finally, the Software-as-a-Service (SaaS) availability of the DROMS-RT platform has reduced the cost of deployment and enable participation of small commercial and residential customers in DR who otherwise would not be able to do so.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

MethodOpt: a Shiny-based graphical user interface for multivariate optimization of sampling and analytical instrumentation

Method optimization is an important step in producing useful data in various experimental settings involving the use of sampling and analytical instrumentation, such as gas-chromatography mass-spectrometry or other analytical techniques. However, traditional optimization techniques often lack the sophistication of more modern optimization techniques developed in areas of applied mathematics. A graphical user interface has been developed that implements a multivariate, multi-objective optimization technique for spectra-generating sampling and analytical instrumentation, which saves substantial time and resources compared to the more traditional approaches to method development.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

Reductive Analysis with Compiler-Guided Large Language Models for Input-Centric Code Optimizations

Input-centric program optimization aims to optimize code by considering the relations between program inputs and program behaviors. Despite its promise, a long-standing barrier for its adoption is the difficulty of automatically identifying critical features of complex inputs. This paper introduces a novel technique, reductive analysis through compiler-guided Large Language Models (LLMs), to solve the problem through a synergy between compilers and LLMs. It uses a reductive approach to overcome the scalability and other limitations of LLMs in program code analysis. The solution, for the first time, automates the identification of critical input features without heavy instrumentation or profiling, cutting the time needed for input identification by 44× (or 450× for local LLMs), reduced from 9.6 hours to 13 minutes (with remote LLMs) or 77 seconds (with local LLMs) on average, making input characterization possible to be integrated into the workflow of program compilations. Optimizations on those identified input features show similar or even better results than those identified by previous profiling-based methods, leading to optimizations that yield 92.6% accuracy in selecting the appropriate adaptive OpenMP parallelization decisions, and 20-30% performance improvement of serverless computing while reducing resource usage by 50-60%.

Input-Centric Optimization↗
DOE OSTI2025

McCormick envelopes in mixed-integer PDE-constrained optimization

McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear programs but have not gained much attention in PDE-constrained optimization so far. This lack of attention may be due to the distributed nature of such problems, which on the one hand leads to infinitely many linear constraints (generally state constraints that may be difficult to handle) in addition to the state equation for a pointwise formulation of the McCormick envelopes and renders bound-tightening procedures that successively improve the resulting convex relaxations computationally intractable. We analyze McCormick envelopes for a model problem class that is governed by a semilinear PDE involving a bilinearity and integrality constraints. We approximate the nonlinearity and in turn the McCormick envelopes by averaging the involved terms over the cells of a partition of the computational domain on which the PDE is defined. This yields convex relaxations that underestimate the original problem up to an a priori error estimate that depends on the mesh size of the discretization. These approximate McCormick relaxations can be improved by means of an optimization-based bound-tightening procedure. We show that their minimizers converge to minimizers to a limit problem with a pointwise formulation of the McCormick envelopes when driving the mesh size to zero. We provide a computational example, for which we certify all of our imposed assumptions. The results point to both the potential of the methodology and the gaps in the research that need to be closed. Our methodology provides a framework first for obtaining pointwise underestimators for nonconvexities and second for approximating them with finitely many linear inequalities in an infinite-dimensional setting.

Approximations and Expansions↗
DOE OSTI2020

Detailed modeling of the video signal and optimal readout of charge-coupled devices

This paper provides a practical design methodology to calculate an optimal filter for noise reduction in the readout of charge-coupled devices (CCDs) taking into account the charge transfer and feedthroughs due to capacitive coupling in the CCD. A detailed analysis of the dynamics of the video signal and charge transfer is presented, including the circuital modeling of the output stage of the CCD and the dynamics of the electronics in the video chain before the analog-to-digital (AD) converter. This model is used to compute an optimal filter that minimizes the variance of the pixel noise and uses the samples of the charge transfer, before the charge is fully settled. This is necessary to enhance the performance of previous results that also use optimal filters but do not use the transition samples, while also reducing the pixel readout time, resulting in faster readouts. As a proof of concept for the optimal filter, we present in this paper novel experimental results using a Skipper CCD, which has a floating sense node that allows to measure the charge packet an arbitrary number of times. However, this technique can be applied to any CCD that has a readout system that digitally samples the video signal.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
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 OSTI2021

Plastic work constrained elastoplastic topology optimization

An elastoplastic topology optimization framework for limiting plastic work generation while maximizing stiffness is presented. The kinematics and constitutive model are based on finite strain linear isotropic hardening plasticity, and the balance laws are solved using a total Lagrangian finite element formulation. Aggregation of the specific plastic work combined with an adaptive normalization scheme efficiently constrains the maximum specific plastic work. The optimization problem is regularized using an augmented partial differential equation filter, and is solved by the method of moving asymptotes where path-dependent sensitivities are derived using the adjoint method. The numerical examples show a clear dependence on the optimized maximum stiffness structures for different levels of constrained specific plastic work. It is also shown that due to the history dependency of the plasticity, the load path significantly influences the structural performance and optimized topology.

42 ENGINEERING↗
DOE OSTI2025

Bayesian D‐Optimal Designs for Gaussian Process Surrogate Models

Computer experiments often employ space-filling strategies to create surrogate models with strong predictive performance. The impact of model parameter estimation for Gaussian process surrogates, however, is often overlooked. Obtaining a better initial estimate of the covariance lengthscale parameter, θ, can greatly improve the resulting Gaussian process fit through more effective sequential acquisitions during active learning. In this work, we propose a novel initial design maximizing the Bayesian D-optimality criterion of the Gaussian process lengthscale parameter. Previously published results have shown the emphasis on lengthscale estimation to be promising, but relied on an empirically driven design creation process. Our Bayesian D-optimal designs are rooted in information theory and lead to more informative sequential acquisitions by improving lengthscale estimation. In many cases, these gains eventually result in better surrogates than those seeded with space-filling initial designs. Furthermore, Bayesian D-optimal designs can be tailored to either isotropic or anisotropic covariance structures, and the Bayesian framework enables the inclusion of prior knowledge in the design process, offering greater flexibility and adaptability. Through several simulation studies, we demonstrate the advantages of Bayesian D-optimal designs in terms of both lengthscale estimation accuracy and predictive performance during active learning.

Bayesian experimental design↗
DOE OSTI2022

Manufacturing and stiffness constraints for topology optimized periodic structures

Topology optimization (TO) is commonly applied to design the unit cells of periodic structures. For example, metamaterials, lattice structures, phononic crystals (PhC), and photonic crystals (PC) have all been previously designed via TO. Unfortunately, the optimal structures for certain design objectives, e.g., bandgaps, are often impossible to manufacture as they have disconnected regions or “islands” of solid material (ISM) that are not self-supporting. Additionally, designs with enclosed void space (EVS) are problematic for additive manufacturing (AM) since support material or pre-sintered powder cannot be removed after manufacturing. We present a series of constraints that may be incorporated into any TO framework to ensure structures are self-supporting without enclosed voids. Additionally, we employ homogenization-based constraints that allow the designer to tune the elastic stiffness and isotropy of the optimized design. The proposed constraints are evaluated on example microstructures and utilized in a simple optimization test problem to highlight their abilities and limitations so that guidelines for appropriate combinations of constraints may be proposed. Effective constraint combinations are demonstrated on the design of 3D photonic crystals for maximum bandgap subject to manufacturing and stiffness constraints.

42 ENGINEERING↗
DOE OSTI2022

Combining Simulation and Optimization to Derive Operating Policies for a Concentrating Solar Power Plant

Optimizing short-term decisions over a rolling horizon and/or using deterministic penalties to capture system stochasticity can lead to myopic policies that fail to consider unplanned events and their long-term adverse effects. We present a methodology that integrates an off-line optimization model with a simulation procedure to determine the profitability of different operating strategies; specifically, the latter is used to generate additional constraints for the former when failures occur according to system component operating lifetimes that (i) are subject to exogenous uncertainty, and (ii) may degrade more quickly under specific operating conditions. We use the feedback provided by the simulation model in a parametric analysis to obtain penalties that can be used in short-term operations scheduling to maximize the long-term revenues obtained by the optimization model. We apply this research to a concentrating solar power plant; our results show that the methodology can be used to choose an operating policy that balances maximizing profit while accounting for maintenance costs. Integrating the optimization model with a simulation procedure reveals that aggressive prices for cycling yield about 55% fewer startups and 30% fewer failures compared to using a more typical start-up operating strategy, and can save hundreds of thousands to millions of dollars in repair costs over the lifetime of the plant.

concentrating solar power↗
DOE OSTI2025

Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms

The quantum approximate optimization algorithm (QAOA) has the potential to approximately solve complex combinatorial optimization problems in polynomial time. However, current noisy quantum devices cannot solve large problems due to hardware constraints. In this work, we develop an algorithm that decomposes the QAOA input problem graph into a smaller problem and solves MaxCut using QAOA on the reduced graph. The algorithm requires a subroutine that can be classical or quantum—in this work, we implement the algorithm twice on each graph. One implementation uses the classical solver Gurobi in the subroutine and the other uses QAOA. We solve these reduced problems with QAOA. On average, the reduced problems require only approximately 1/10 of the number of vertices than the original MaxCut instances. Furthermore, the average approximation ratio of the original MaxCut problems is 0.75, while the approximation ratios of the decomposed graphs are on average of 0.96 for both Gurobi and QAOA. With this decomposition, we are able to measure optimal solutions for ten 100-vertex graphs by running single-layer QAOA circuits on the Quantinuum trapped-ion quantum computer H1-1, sampling each circuit only 500 times. This approach is best suited for sparse, particularly k-regular graphs, as k-regular graphs on n vertices can be decomposed into a graph with at most $\frac{nk}{k+1}$ vertices in polynomial time. Further reductions can be obtained with a potential trade-off in computational time. In conclusion, while this paper applies the decomposition method to the MaxCut problem, it can be applied to more general classes of combinatorial optimization problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

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↗