Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization methods”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

A Three-Stage Enhanced Reactive Power and Voltage Optimization Method for High Penetration of Solar

This paper presents a three-stage enhanced volt/var optimization method to stabilize voltage fluctuations in transmission networks by optimizing the usage of reactive power control devices. In contrast with existing volt/var optimization algorithms, the proposed method optimizes the voltage profiles of the system, while keeping the voltage and real power output of the generators as close to the original scheduling values as possible. This allows the method to accommodate realistic power system operation and market scenarios, in which the original generation dispatch schedule will not be affected. The proposed method was tested and validated on a modified IEEE 118-bus system with photovoltaic data.

photovoltaic, Volt/Var Control, indexes, simulatio↗
DOE OSTI2023

An energy-optimization method to study gel-swelling in confinement

Using our open-source programming environment Morpho, an energy-optimization method is developed to compute equilibrium shapes of an arbitrarily confined swollen hydrogel. The internal strains and contact forces are measured, probing its mechanics.

Joshi, Chaitanya↗
DOE OSTI2022

A Solar-assisted Voltage Optimization Method for Transmission Solar Network Power System

This paper proposes a new formulation and solution algorithm that uses transmission level solar inverters to address the security-constrained optimal power flow (SCOPF) problem. The goal is to stabilize voltage fluctuations in transmission networks in base case and contingency scenarios, by using bulk solar power plant with a minimal number of post-contingency corrections. To achieve this goal, a two-stage volt/var optimization method is proposed to first correct all voltage violations with the volt-var alternating current optimal power flow (ACOPF) algorithm for a base case. Then a linearized SCOPF volt-var control algorithm is proposed to identify the corrective actions for all potential voltage violations in all contingency scenarios. The proposed method was tested and validated on a modified IEEE 118-bus system with solar photovoltaic (PV) data.

Photovoltaic, Volt/Var Control↗
DOE OSTI2023

A comparison of eight optimization methods applied to a wind farm layout optimization problem

Abstract. Selecting a wind farm layout optimization method is difficult. Comparisons between optimization methods in different papers can be uncertain due to the difficulty of exactly reproducing the objective function. Comparisons by just a few authors in one paper can be uncertain if the authors do not have experience using each algorithm. In this work we provide an algorithm comparison for a wind farm layout optimization case study between eight optimization methods applied, or directed, by researchers who developed those algorithms or who had other experience using them. We provided the objective function to each researcher to avoid ambiguity about relative performance due to a difference in objective function. While these comparisons are not perfect, we try to treat each algorithm more fairly by having researchers with experience using each algorithm apply each algorithm and by having a common objective function provided for analysis. The case study is from the International Energy Association (IEA) Wind Task 37, based on the Borssele III and IV wind farms with 81 turbines. Of particular interest in this case study is the presence of disconnected boundary regions and concave boundary features. The optimization methods studied represent a wide range of approaches, including gradient-free, gradient-based, and hybrid methods; discrete and continuous problem formulations; single-run and multi-start approaches; and mathematical and heuristic algorithms. We provide descriptions and references (where applicable) for each optimization method, as well as lists of pros and cons, to help readers determine an appropriate method for their use case. All the optimization methods perform similarly, with optimized wake loss values between 15.48 % and 15.70 % as compared to 17.28 % for the unoptimized provided layout. Each of the layouts found were different, but all layouts exhibited similar characteristics. Strong similarities across all the layouts include tightly packing wind turbines along the outer borders, loosely spacing turbines in the internal regions, and allocating similar numbers of turbines to each discrete boundary region. The best layout by annual energy production (AEP) was found using a new sequential allocation method, discrete exploration-based optimization (DEBO). Based on the results in this study, it appears that using an optimization algorithm can significantly improve wind farm performance, but there are many optimization methods that can perform well on the wind farm layout optimization problem, given that they are applied correctly.

17 WIND ENERGY↗
DOE OSTI2025

Advanced Method Optimization with Categorical and Constrained Continuous Parameters

Traditional approaches to analytical method optimization (e.g., univariate and “guess-and-check”) can be time-consuming, costly, and often fail to identify true optima within the parameter space. Previous work defined and implemented a generalized technique for method optimization for continuous method parameters, but a knowledge gap remains for the incorporation of categorical variables into these advanced method optimization schemes. This work presents and validates a generalized optimization approach that incorporates both continuous and categorical variables while also utilizing a multivariate, multiobjective optimization scheme with Karush–Kuhn–Tucker conditions to bound the optimization space to solutions within the physical limitations of the parameter space. Method optimization from a case study using GC–MS for the analysis of 11 analytical standards with objectives to minimize peak width and maximize peak height resulted in a 3 orders of magnitude improvement in the average peak height and a 2 orders of magnitude improvement in the average peak width compared to the least optimal (but reasonable) instrumental parameters utilized in this study. This approach to optimization allows for a customizable method optimization in which users can include both continuous and categorical variables to achieve objectives specific to their analytical goals. This approach significantly reduces the labor and cost associated with traditional method development approaches and can be applied in a variety of scientific fields across a range of laboratory techniques (e.g., instrument method development, sample preparation, and extraction techniques).

Amorphous materials↗
DOE OSTI2024

Advanced Method Optimization for Sampling and Analysis Instrumentation

This work presents a generalized approach for analytical method optimization that branches the gap between techniques historically employed and accurate modern optimization techniques suitable for various applications. The novelty of the described strategy is the utilization of multivariate, multiobjective optimization with Karush-Kuhn-Tucker conditions to bound the optimization space to solutions within the physical limitations of instrumentation. Briefly, the basic steps outlined in this paper are to (1) determine the objective(s) that should be maximized or minimized based on the goals of the analytical application, (2) conduct a screening experiment, (3) perform ANOVA to determine the parameters which have a statistically significant effect on the objective, (4) conduct an experiment (e.g., Box-Behnken design) to collect data for fitting the objective equation, and (5) determine the physical constraints of the parameters and solve the Lagrangian to determine the optimal method parameters. A broad approach to optimization target selection allows for robust method tuning to develop improved data sets amenable for chemometrics and machine learning algorithm development. Gas chromatography-mass spectrometry was selected as a use case due to its broad use across scientific fields and time-consuming method development involving numerous parameters. In conclusion, this strategy can reduce the cost of research, improve data quality, and enable the rapid development of new analytical technique.

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

A critical evaluation of worst case optimization methods for robust intensity-modulated proton therapy planning

Purpose: To critically evaluate and compare three worst case optimization methods that have been previously employed to generate intensity-modulated proton therapy treatment plans that are robust against systematic errors. The goal of the evaluation is to identify circumstances when the methods behave differently and to describe the mechanism behind the differences when they occur. Methods: The worst case methods optimize plans to perform as well as possible under the worst case scenario that can physically occur (composite worst case), the combination of the worst case scenarios for each objective constituent considered independently (objectivewise worst case), and the combination of the worst case scenarios for each voxel considered independently (voxelwise worst case). These three methods were assessed with respect to treatment planning for prostate under systematic setup uncertainty. An equivalence with probabilistic optimization was used to identify the scenarios that determine the outcome of the optimization. Results: If the conflict between target coverage and normal tissue sparing is small and no dose-volume histogram (DVH) constraints are present, then all three methods yield robust plans. Otherwise, they all have their shortcomings: Composite worst case led to unnecessarily low plan quality in boundary scenarios that were less difficult than the worst case ones. Objectivewise worst case generally led to nonrobust plans. Voxelwise worst case led to overly conservative plans with respect to DVH constraints, which resulted in excessive dose to normal tissue, and less sharp dose fall-off than the other two methods. Conclusions: The three worst case methods have clearly different behaviors. These behaviors can be understood from which scenarios that are active in the optimization. No particular method is superior to the others under all circumstances: composite worst case is suitable if the conflicts are not very severe or there are DVH constraints whereas voxelwise worst case is advantageous if there are severe conflicts but no DVH constraints. The advantages of composite and voxelwise worst case outweigh those of objectivewise worst case.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2021

Modeling and Optimization Methods for Controlling and Sizing Grid-connected Energy Storage: A Review

Purpose of Review Energy storage is capable of providing a variety of services and solving a multitude of issues in today's rapidly evolving electric power grid. This paper reviews recent research on modeling and optimization methods for optimally controlling and sizing grid-connected battery energy storage systems (BESSs). Open issues and promising research directions are discussed. Recent Findings Recent studies on BESS dispatch, evaluation, and sizing focus on advanced modeling and optimization methods to maximize stacked value streams from multiple services. BESS models have been improved to better represent operational characteristics or capture degradation effects. Different solution methods and optimization techniques have been proposed to improve the benefits and cost-effectiveness of BESSs, using deterministic approaches prevalently but with impressive progress in capturing and addressing uncertainties. Summary Recent progress in BESS scheduling and sizing better supports planning and operational decision-making in different use cases, which is highly important to advance the deployment of BESSs. Additional research is required to properly model the trade-off between short-term benefits and service life with multiple degradation effects explicitly considered in the decision-making process. Advanced methods are to be developed for effectively determining optimal BESS sizes that maximize overall benefits within a varying lifetime considering diversified system, conditions as well as uncertainties at planning and operational stages.

Wu, Di↗
DOE OSTI2019

Derivative-free optimization methods

In many optimization problems arising from scientific, engineering and artificial intelligence applications, objective and constraint functions are available only as the output of a black-box or simulation oracle that does not provide derivative information. Such settings necessitate the use of methods for derivative-free, or zeroth-order, optimization. We provide a review and perspectives on developments in these methods, with an emphasis on highlighting recent developments and on unifying treatment of such problems in the non-linear optimization and machine learning literature. We categorize methods based on assumed properties of the black-box functions, as well as features of the methods. We first overview the primary setting of deterministic methods applied to unconstrained, non-convex optimization problems where the objective function is defined by a deterministic black-box oracle. We then discuss developments in randomized methods, methods that assume some additional structure about the objective (including convexity, separability and general non-smooth compositions), methods for problems where the output of the black-box oracle is stochastic, and methods for handling different types of constraints.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

A Flexible Quasi-Static Mooring Design Optimization Method for Floating Structures

This paper presents a flexible and efficient design method for optimizing the mooring systems of floating structures. Mooring system optimization is challenging because of the strong nonlinearity of mooring system behavior and the many technical constraints that must be satisfied. Furthermore, different mooring configurations can have very different design spaces. While some successful examples of mooring design optimization exist in the literature, developing an optimization approach that can work across various mooring design problems is a larger challenge. We present such a method based on a flexible parameterization that allows a wide variety of mooring designs to be described by a list of variables, a quasi-static mooring model that provides efficient evaluation of a mooring design without directly considering mooring system dynamics, and an optimization framework that generates, evaluates, and adjusts the mooring design while considering user-specified constraints such as offset limits, strength safety factors, and seabed contact limits. We demonstrate the design optimization framework on four mooring design problems, each for a different type of mooring system. We compare the use of different design modes to simplify the optimization problem, showing that they can reduce the computation time by up to 75%. We also compare different optimization algorithms and find that the resulting computational speed can vary by up to 51 times. We perform a sensitivity study on one design and find that the local sensitivity of anchoring radius to water depth has a positive correlation of 0.29, but the global sensitivity shows large nonlinearities. Lastly, we perform a coupled dynamic analysis on one of the optimized designs and find that the predicted mean platform motions and mooring line tensions are within 1% of dynamic results and the extreme motions and tensions are within 14%. Lastly, we show that a DEA-Chain-Polyester mooring configuration is cost-optimal for the given design problem of the demonstrations, which aligns with general industry practice.

16 TIDAL AND WAVE POWER↗
DOE OSTI2018

An optimization method for flexural bearing design for high-stroke high-frequency applications

A method for optimization of a high-stroke, high-frequency flexural bearing was completed. The main goal was to design a flexural bearing system as the energy restoration component of a one kW free piston linear engine alternator (LEA) operating at 90 Hz and maximum targeted displacement of 22 mm. Defined electricity output of 1 kW, with more than 30% efficiency, required engine operation under high speed and high stroke conditions. Under such challenging stroke and frequency requirements, a method of design was required to select between a wide range of parameters in flexural bearing design. A parametric CAD model was prepared and used in the optimization package of a finite element analysis (FEA) software. Four main parameters of flexural bearing geometry were identified and included the outer diameter, thickness, number of arms, and sweep angle of spiral cuts. Other design parameters including spiral gap width, shape factor and spiral start points angle were shown to be less important compared to these four main parameters in primary design and were examined separately. A neural network algorithm was used to investigate the interactions and effects of design parameters. The sensitivity of each parameter on output criteria such as maximum stress and natural frequency was examined and design charts developed. Methods for further modification of the spiral curve at end points were introduced to reduce the maximum stress level by up to 20%. Several steel alloys and a titanium-based alloy were identified as proper material candidates for high cycle applications and the final designed spring was manufactured and tested to validate the FEA results of axial stiffness and strain level throughout the flexure arms. The percent of the flexure’s moving mass was estimated to be 29% with FEA analysis and compared well with the experimental value of 31%. The stress/strain results of the FEA analysis matched with the experimental results – within ±5%.

42 ENGINEERING↗
DOE OSTI2017

COMPARISON OF NONLINEAR DYNAMICS OPTIMIZATION METHODS FOR APS-U

Many different objectives and genetic algorithms have been proposed for storage ring nonlinear dynamics performance optimization. These optimization objectives include nonlinear chromaticities and driving/detuning terms, on-momentum and off-momentum dynamic acceptance, chromatic detuning, local momentum acceptance, variation of transverse invariant, Touschek lifetime, etc. In this paper, the effectiveness of several different optimization methods and objectives are compared for the nonlinear beam dynamics optimization of the Advanced Photon Source upgrade (APS-U) lattice. The optimized solutions from these different methods are preliminarily compared in terms of the dynamic acceptance, local momentum acceptance, chromatic detuning, and other performance measures.

APS-U∗↗
DOE OSTI2026

Augmenting subspace optimization methods with linear bandits

In this work, we consider the framework of methods for unconstrained minimization that are, in each iteration, restricted to a model that is only a valid approximation to the objective function on some affine subspace containing an incumbent point. These methods are of practical interest in computational settings where derivative information is either expensive or impossible to obtain. Recent attention has been paid in the literature to employing randomized matrix sketching for generating the affine subspaces within this framework. We consider a relatively straightforward, deterministic augmentation of such a generic subspace optimization method. In particular, we consider a sequential optimization framework where actions consist of one-dimensional linear subspaces and rewards consist of (approximations to) the magnitudes of directional derivatives computed in the direction of the action subspace. Reward maximization in this context is consistent with maximizing lower bounds on descent guaranteed by first-order Taylor models. This sequential optimization problem can be analysed through the lens of dynamic regret. We modify an existing linear upper confidence bound (UCB) bandit method and prove sublinear dynamic regret in the subspace optimization setting. We demonstrate the efficacy of employing this linear UCB method in a setting where forward-mode algorithmic differentiation can provide directional derivatives in arbitrary directions and in a derivative-free setting. For the derivative-free setting, we propose SS-POUNDers, an extension of the derivative-free optimization method POUNDers that employs the linear UCB mechanism to identify promising subspaces. Our numerical experiments suggest a preference, in either computational setting, for employing a linear UCB mechanism within a subspace optimization method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods

We explore novel approaches for solving nonlinear optimization problems with unrelaxable bound constraints, which must be satisfied before the objective function can be evaluated. Our method reformulates the unrelaxable bound-constrained problem as an unconstrained optimization problem that is amenable to existing unconstrained optimization methods. The reformulation relies on a domain warping to form a merit function; the choice of the warping determines the level of exactness with which the unconstrained problem can be used to find solutions to the bound-constrained problem, as well as key properties of the unconstrained formulation such as smoothness. We develop theory when the domain warping is a multioutput sigmoidal warping, and we explore the practical elements of applying unconstrained optimization methods to the formulation. Here, we develop an algorithm that exploits the structure of the sigmoidal warping to guarantee that unconstrained optimization algorithms applied to the merit function will find a stationary point to the desired tolerance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Optimization methods of the net emission computation applied to cylindrical sodium vapor plasma

An optimization method based on a physical analysis of the temperature profile and different terms in the radiative transfer equation is developed to reduce the time computation of the net emission. This method has been applied for the cylindrical discharge in sodium vapor. Numerical results show a relative error of spectral flux density values lower than 5% with an exact solution, whereas the computation time is about 10 orders of magnitude less. This method is followed by a spectral method based on the rearrangement of the lines profile. Results are shown for Lorentzian profile and they demonstrated a relative error lower than 10% with the reference method and gain in computation time about 20 orders of magnitude.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Comparison of multiobjective optimization methods for the $\mathrm{LCLS-II}$ photoinjector

Particle accelerators are among some of the largest science experiments in the world and can consist of thousands of components with a wide variety of input ranges. These systems can easily become unwieldy optimization problems during design and operations studies. Starting in the early 2000s, searching for better beam dynamics configurations became synonymous with heuristic optimization methods in the accelerator physics community. Genetic algorithms and particle swarm optimization are currently the most widely used. These algorithms can take thousands of simulation evaluations to find optimal solutions for one machine prototype. For large facilities such as the Linac Coherent Light Source (LCLS) and others, this equates to a limited exploration of many possible design configurations. In this paper, the LCLS-II photoinjector is optimized with three optimization algorithms. All optimizations were started from both a uniform random and Latin hypercube sample. In all cases, the optimizations started from Latin hypercube samples outperformed optimizations started from uniform samples. All three algorithms were able to optimize the photoinjector, with the model-based methods approximating the Pareto front in fewer simulation evaluations. This work, in combination with previous optimization observations, indicates objective penalties have a strong impact on the efficiency of such methods. In general, we recommend heuristic methods for initial optimizations and model-based methods when information about the objective space is available.

43 PARTICLE ACCELERATORS↗
DOE OSTI2020

Decentralized Voltage optimization Method for Distribution Networks with Distributed PVs

In order to solve the voltage violations caused by high penetration distributed photovoltaics (PVs), this paper proposes a decentralized voltage optimization method for distribution networks. Through the optimal dispatch of distributed PVs and reactive power resources, it realizes the voltage security and economic operation of distribution systems and facilitates the integration of massive distributed PVs. The proposed method is inspired by the idea of locational marginal price (LMP) and feasible cutting plane. It separates the optimization of boundary bus voltage and power flow in adjacent regions and uses the interaction of boundary variables’ marginal prices to obtain the optimal solution. The effectiveness and accuracy of the proposed method are demonstrated via simulation test on a practical l0kV feeder in China.

Xue, Yaosuo↗
DOE OSTI2025

Benchmarking optimization methods for materials research: Gradient descent and Bayesian optimization for lithium-ion battery aging diagnostics

Accurate and efficient parameter estimation is essential for battery diagnostics and aging analysis. Here, in this study, we compare two optimization-based approaches—gradient descent and Bayesian optimization—for extracting parameters from differential voltage analysis in lithium-ion batteries. While these techniques are widely used, their relative strengths and limitations for this application are not well understood. The study evaluates the trade-offs between these methods in terms of result quality, computational cost, and reliability within this specific application. The diagnostic results from our battery data suggest adopting gradient descent as an initial method for rapid and efficient analysis, while employing more stable optimization techniques, such as Bayesian optimization, as a verification step to mitigate potential instability. Comparing the two methods provides information on algorithmic choice, while inspiring further discussions on selecting appropriate techniques for specific research tasks.

Zhao, Ziqing [Boston Univ., MA (United States)] (O↗