Search NASA⌕ Search

SEARCH · Search NASA

Results for “objective function”

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

Including the vacuum energy in stellarator coil design

Being three-dimensional, stellarators have the advantage that plasma currents are not essential for creating rotational-transform; however, the external current-carrying coils in stellarators can have strong geometrical shaping, which can complicate the construction. Reducing the inter-coil electromagnetic forces acting on strongly shaped 3D coils and the stress on the support structure while preserving the favorable properties of the magnetic field is a design challenge. In this work, we recognize that the inter-coil forces are the gradient of the vacuum magnetic energy. We introduce an objective functional built on the usual quadratic flux on a prescribed target surface together with a weighed penalty on the vacuum energy. The Euler–Lagrange equation for stationary states is derived, and numerical illustrations are computed using a modern stellarator optimization framework. A study of the effect of the energy functional on the inter-coil forces is conducted and the energy is shown to be a promising quantity in producing coils with low forces.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Quantum model learning agent: characterisation of quantum systems through machine learning

Accurate models of real quantum systems are important for investigating their behaviour, yet are difficult to distil empirically. Here, we report an algorithm—the quantum model learning agent (QMLA)—to reverse engineer Hamiltonian descriptions of a target system. We test the performance of QMLA on a number of simulated experiments, demonstrating several mechanisms for the design of candidate Hamiltonian models and simultaneously entertaining numerous hypotheses about the nature of the physical interactions governing the system under study. QMLA is shown to identify the true model in the majority of instances, when provided with limited a priori information, and control of the experimental setup. Our protocol can explore Ising, Heisenberg and Hubbard families of models in parallel, reliably identifying the family which best describes the system dynamics. We demonstrate QMLA operating on large model spaces by incorporating a genetic algorithm to formulate new hypothetical models. The selection of models whose features propagate to the next generation is based upon an objective function inspired by the Elo rating scheme, typically used to rate competitors in games such as chess and football. In all instances, our protocol finds models that exhibit F 1 score ≥ 0.88 when compared with the true model, and it precisely identifies the true model in 72% of cases, whilst exploring a space of over 250 000 potential models. By testing which interactions actually occur in the target system, QMLA is a viable tool for both the exploration of fundamental physics and the characterisation and calibration of quantum devices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

An Unsteady Actuator Line Solver to Enable Adjoint Sensitivity Studies for Wake Steering

This study demonstrates the sensitivity of wind turbine wake steering performance to blade design. An actuator line model was implemented within an unsteady adjoint solver that enables efficient execution of gradient-based optimization and sensitivity studies. After first confirming the feasibility of wake steering by controlling actuator line chord profiles and formulating a suitable objective function for wake position, a sensitivity study was conducted to determine the relative importance of chord length as a function of spanwise position on the resulting turbine wake deflection. The results presented here support the idea that blade design choices play a role in wake control. In a larger context, this study demonstrates a computational framework in which turbine and blade designs can be studied at the individual and farm-wide level to enhance wind plant controllability and manage power output.

17 WIND ENERGY↗
DOE OSTI2020

Optimization-based calibration of hydrodynamic drag coefficients for a semisubmersible platform using experimental data of an irregular sea state

For the simulation of the coupled dynamic response of floating offshore wind turbines, it is crucial to calibrate the hydrodynamic damping with experimental data. The aim of this work is to find a set of hydrodynamic drag coefficients for the semisubmersible platform of the Offshore Code Comparison Collaboration, Continuation, with Correlation and unCertainity (OC6) project which provides suitable results for an irregular sea state. Due to the complex interaction of several degrees of freedom (DOF), it is common to calibrate drag coefficients with the time series of decay tests. However, applying these drag coefficients for the simulation of an irregular sea state results in misprediction of the motions. By using numerical optimization, it is possible to calibrate multiple drag coefficients simultaneously and effectively, while also considering several DOF. This work considers time series of structural displacements from wave tank tests of the OC6 project and from simulations of the same load cases in OpenFAST. Results are transferred into the frequency domain and the deviation between power spectral densities of surge, pitch and heave from experiment and numerical simulation is used as an objective function to obtain the best fitting drag coefficients. This novel numerical optimization approach enables finding one set of drag coefficients for different load cases, which is a major improvement compared to decay-test-tuned drag coefficients.

42 ENGINEERING↗
DOE OSTI2021

Progress toward favorable landscapes in quantum combinatorial optimization

The performance of variational quantum algorithms relies on the success of using quantum and classical computing resources in tandem. Here, we study how these quantum and classical components interrelate. In particular, we focus on algorithms for solving the combinatorial optimization problem MaxCut, and study how the structure of the classical optimization landscape relates to the quantum circuit used to evaluate the MaxCut objective function. In order to analytically characterize the impact of quantum features on the critical points of the landscape, we consider a family of quantum circuit ansätze composed of mutually commuting elements. We identify multiqubit operations as a key resource and show that overparameterization allows for obtaining favorable landscapes. Namely, we prove that an ansatz from this family containing exponentially many variational parameters yields a landscape free of local optima for generic graphs. However, we further prove that these ansätze do not offer superpolynomial advantages over purely classical MaxCut algorithms. Here, we then present a series of numerical experiments illustrating that noncommutativity and entanglement are important features for improving algorithm performance.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Bayesian optimization algorithms for accelerator physics

Accelerator physics relies on numerical algorithms to solve optimization problems in online accelerator control and tasks such as experimental design and model calibration in simulations. The effectiveness of optimization algorithms in discovering ideal solutions for complex challenges with limited resources often determines the problem complexity these methods can address. The accelerator physics community has recognized the advantages of Bayesian optimization algorithms, which leverage statistical surrogate models of objective functions to effectively address complex optimization challenges, especially in the presence of noise during accelerator operation and in resource-intensive physics simulations. In this review article, we offer a conceptual overview of applying Bayesian optimization techniques toward solving optimization problems in accelerator physics. We begin by providing a straightforward explanation of the essential components that make up Bayesian optimization techniques. We then give an overview of current and previous work applying and modifying these techniques to solve accelerator physics challenges. Finally, we explore practical implementation strategies for Bayesian optimization algorithms to maximize their performance, enabling users to effectively address complex optimization challenges in real-time beam control and accelerator design. Published by the American Physical Society 2024

43 PARTICLE ACCELERATORS↗
DOE OSTI2020

Probabilistic neural networks for fluid flow surrogate modeling and data recovery

We consider the use of probabilistic neural networks for fluid flow surrogate modeling and data recovery. This framework is constructed by assuming that the target variables are sampled from a Gaussian distribution conditioned on the inputs. Consequently, the overall formulation sets up a procedure to predict the hyperparameters of this distribution which are then used to compute an objective function given training data. We demonstrate that this framework has the ability to provide for prediction confidence intervals based on the assumption of a probabilistic posterior, given an appropriate model architecture and adequate training data. The applicability of the present framework to cases with noisy measurements and limited observations is also assessed. To demonstrate the capabilities of this framework, we consider canonical regression problems of fluid dynamics from the viewpoint of reduced-order modeling and spatial data recovery for four canonical data sets. The examples considered in this study arise from (i) the shallow-water equations, (ii) a two-dimensional cylinder flow, (iii) the wake of a NACA0012 airfoil with a Gurney flap, and (iv) the NOAA sea surface temperature data set. Furthermore, the present results indicate that the probabilistic neural network not only produces a machine-learning-based fluid flow surrogate model but also systematically quantifies the uncertainty therein to assist with model interpretability.

42 ENGINEERING↗
DOE OSTI2021

Embedded training of neural-network subgrid-scale turbulence models

We report that the weights of a deep neural-network model are optimized in conjunction with the governing flow equations to provide a model for subgrid-scale stresses in a temporally developing plane turbulent jet at Reynolds number Re 0 = 6000 . The objective function for training is first based on the instantaneous filtered velocity fields from a corresponding direct numerical simulation, and the training is by a stochastic gradient descent method, which uses the adjoint Navier-Stokes equations to provide the end-to-end sensitivities of the model weights to the velocity fields. In-sample and out-of-sample testing on multiple dual-jet configurations show that its required mesh density in each coordinate direction for prediction of mean flow, Reynolds stresses, and spectra is half that needed by the dynamic Smagorinsky model for comparable accuracy. The same neural-network model trained directly to match filtered subgrid-scale stresses, without the constraint of being embedded within the flow equations during the training, fails to provide a qualitatively correct prediction. The coupled formulation is generalized to train based only on mean-flow and Reynolds stresses, which are more readily available in experiments. The mean-flow training provides a robust model, which is important, though a somewhat less accurate prediction for the same coarse meshes, as might be anticipated due to the reduced information available for training in this case. The anticipated advantage of the formulation is that the inclusion of resolved physics in the training increases its capacity to extrapolate. This is assessed for the case of passive scalar transport, for which it outperforms established models due to improved mixing predictions.

42 ENGINEERING↗
DOE OSTI2023

Unified, Geometric Framework for Nonequilibrium Protocol Optimization

Controlling thermodynamic cycles to minimize the dissipated heat is a long-standing goal in thermodynamics, and more recently, a central challenge in stochastic thermodynamics for nanoscale systems. Here, we introduce a theoretical and computational framework for optimizing nonequilibrium control protocols that can transform a system between two distributions in a minimally dissipative fashion. These protocols optimally transport a system along paths through the space of probability distributions that minimize the dissipative cost of a transformation. Furthermore, we show that the thermodynamic metric—determined via a linear response approach—can be directly derived from the same objective function that is optimized in the optimal transport problem, thus providing a unified perspective on thermodynamic geometries. As a result, we investigate this unified geometric framework in two model systems and observe that our procedure for optimizing control protocols is robust beyond linear response.

36 MATERIALS SCIENCE↗
DOE OSTI2024

A science-driven approach to optimize the design for a biological small-angle neutron scattering instrument

Biological small-angle neutron scattering (SANS) instruments facilitate critical analysis of the structure and dynamics of complex biological systems. However, with the growth of experimental demands and the advances in optical systems design, a new neutron optical concept is necessary to overcome the limitations of current instruments. This work presents an approach to include experimental objectives ( i.e. the science to be supported by a specific neutron scattering instrument) in the optimization of the neutron optical concept. The approach for a proposed SANS instrument at the Second Target Station of the Spallation Neutron Source at Oak Ridge National Laboratory, USA, is presented here. Further, the instrument is simulated with the McStas software package. The optimization process is driven by an evolutionary algorithm using McStas output data, which are processed to calculate an objective function designed to quantify the expected performance of the simulated neutron optical configuration for the intended purpose. Each McStas simulation covers the complete instrument, from source to detector, including realistic sample scattering functions. This approach effectively navigates a high-dimensional parameter space that is otherwise intractable; it allows the design of next-generation SANS instruments to address specific scientific cases and has the potential to increase instrument performance compared with traditional design approaches.

47 OTHER INSTRUMENTATION↗
DOE OSTI2025

A Near-Real-Time Model for Predicting Electricity Disruptions in Texas During Winter Storms

There has been an increase in extreme weather events, posing a threat to power grid systems, potentially influenced by factors such as population growth, changes in ecosystems, land cover, and land use in the service area, as well as the growth of certain vegetation types. This research seeks to develop a predictive model to mitigate potential damages caused by future winter storms. This research utilizes the Light Gradient Boosting Machine (LightGBM), incorporating the number of power outages experienced at the county level, geographic details, weather information, and lagged outage and lagged weather data. The developed models were broadly divided into two groups, with six models in each group - one group without optimization and another with optimization, totaling 12 trained models. For model optimization, Bayesian optimization was employed using Root Mean Squared Error (RMSE) as the objective function. In results, when comparing Group 2 (the optimized group) with Group 1 (the non-optimized group), it was found that optimization did not always lead to a reduction in RMSE and Mean Absolute Error (MAE). However, in terms of Mean Directional Accuracy (MDA), while all results in Group 1 were below the baseline accuracy of 0.33, all results in Group 2 exceeded 0.33, with some cases showing an increase of more than three times the baseline. The results indicated that, in the optimized model group, Population and Pressure were the most influential factors when using current weather data and geographical information. When using lagged data, lagged recorded outages and lagged Pressure emerged as the most significant factors. Among the 12 developed models, the L-1-2-O model showed the lowest RMSE and MAE, as well as the highest accuracy, with values of 390.62 households and 168.13 households, respectively. To normalize the RMSE and MAE values, each metric was divided by the average number of households among the counties in Texas. For the L-1-2-O model, the scaled RMSE was 0.88% and the scaled MAE was 0.38%. In terms of MDA, which indicates the accuracy of the prediction direction, the L-1-O model achieved the highest score of 0.41. Although this study focused on Texas, which suffered the greatest impact from the winter storms in 2021, with additional validation, the methodology used in this research could be applied to other regions.

Lee, Jangjae [Texas A & M Univ., College Station, ↗
DOE OSTI2022

Skew-Symmetric adjacency matrices for clustering directed graphs

Graph clustering methods often critically rely on the symmetry of graph matrices. Developing analogous methods for digraphs often proves more challenging, because digraph matrices are typically asymmetric and not orthogonally diagonalizable. However, researchers have recently proposed several complex-valued Hermitian digraph matrices. In particular, one such representation has been utilized as an input to an algorithm for finding imbalanced cuts. In this work, we establish an algebraic relationship between this matrix and an associated real-valued matrix. We show using this real-valued matrix for imbalanced cut-finding algorithms is not only sufficient but advantageous. Our algorithm uses less memory and asymptotically less computation while provably preserving solution quality. We also show our method can be easily implemented using standing computational building blocks, possesses better numerical properties, and loans itself to a natural interpretation via an objective function relaxation argument. We empirically demonstrate these advantages on real world data sets and show how our algorithm can uncover meaningful cluster structure.

Hayashi, Koby↗
DOE OSTI2022

Reduced Switching Frequency Finite Control Set Model Predictive Control (FCS-MPC) for DFIG

An enhanced Finite Control Set Model Predictive Control (FCS-MPC) strategy with a two-step prediction horizon for a Doubly-Fed Induction Generator (DFIG) is the focus of this paper. The DFIG and RL filter's discrete-time model is used in the proposed control scheme for a two-step prediction horizon of rotor and filter currents for the converter's eight possible switching states. Afterward, the control algorithm selects the ideal switching state, which minimizes currents' objective function. The proposed control scheme does not require a modulation stage for internal controllers. We use Lagrange extrapolations to predict the dynamic changes in currents. The switching frequency reduction is achieved by integrating an optimization constraint in the algorithm's cost function. Furthermore, the Total Harmonic Distortion level of currents is kept below 5%, according to IEEE Std 519-14. Obtained results reveal that the switching frequency of the DFIG converters is considerably reduced without losing control; it is reduced by 13.89KHz for the Grid Side Converter (GSC) and by 1.78KHz for the Rotor Side Converter (RSC).

doubly-fed induction generator↗
DOE OSTI2023

An Edge Alignment-Based Orientation Selection Method for Neutron Tomography

Neutron computed tomography (nCT) is a 3D char-acterization technique used to image the internal morphology or chemical composition of samples in biology and materials sciences. A typical workflow involves placing the sample in the path of a neutron beam, acquiring projection data at a predefined set of orientations, and processing the resulting data using an analytic reconstruction algorithm. Typical nCT scans require hours to days to complete and are then processed using conventional filtered back-projection (FBP), which performs poorly with sparse views or noisy data. Hence, the main methods in order to reduce overall acquisition time are the use of an improved sampling strategy combined with the use of advanced reconstruction methods such as model-based iterative reconstruction (MBIR). In this paper, we propose an adaptive orientation selection method in which an MBIR reconstruction on previously-acquired measurements is used to define an objective function on orientations that balances a data-fitting term promoting edge alignment and a regularization term promoting orientation diversity. Using simulated and experimental data, we demonstrate that our method produces high-quality reconstructions using significantly fewer total measurements than the conventional approach.

Yang, Diyu↗
DOE OSTI2021

Versatile feature learning with graph convolutions and graph structures

Graphs represent real world relationships, and graph embedding projects nodes in a graph to a latent space that can help simplify downstream tasks. Recent development of graph convolutions in deep learning significantly improves the performance of many learning tasks on graphs. Unfortunately, prior embedding methods either do not embed graphs with node features, or fail to produce high-quality embeddings for downstream learning tasks that result in large performance gap in comparison to direct learning on graphs.We present a versatile and effective embedding method, Conv2Vec, for embedding graphs with or without node features. It is based on graph convolutions with objective functions motivated by concepts and structures from classical graph algorithms. Conv2Vec produce high-quality embedding for both plain graphs and graphs with node features for downstream tasks.We evaluate the embeddings generated by Conv2Vec with a transductive node classification task. With the generated embeddings and very simple machine learning approaches, we are able to achieve accuracies similar to those achieved by direct learning with graph convolutions. Interestingly, if we strip the node features from the graph and thus learning an embedding has to rely entirely on the graph topology, node classification with our embedding significantly outperforms direct learning with various graph convolutions. This suggests that structures from classical graph algorithms may play an important role in learning on graphs.

Cong, Guojing↗
DOE OSTI2020

An Interior-Point Solver for Optimal Power Flow Problem Considering Distributed FACTS Devices

In this paper, we propose an AC optimal power flow (ACOPF) model considering distributed flexible AC transmission system (D-FACTS) devices, in which the reactance of D-FACTS equipped lines are introduced as decision variables. This is motivated by increasing interests in using D-FACTS devices to address system operational and cyber-security concerns. First, D-FACTS devices can be incorporated in real-time operations for economic benefits such as managing power congestions and reducing system losses. Second, D-FACTS devices can be utilized by moving target defense (MTD), an emerging concept against cyber-attacks, to prevent attackers from knowing true system configurations. Therefore, system operators can use the proposed ACOPF model to achieve economic benefits and provide the setpoints of D-FACTS devices for MTD at the same time. In addition, we rigorously derive the gradient and Hessian matrices of the objective function and constraints, which are further used to build an interior-point solver of the proposed ACOPF. Numerical results on the IEEE 118-bus transmission system show the validity of the proposed ACOPF model as well as the efficacy of the interior-point solver in minimizing system losses and generation costs.

Liu, Bo↗
DOE OSTI2021

Agent-Supervisor Coordination for Decentralized Event-Triggered Optimization

This letter proposes decentralized resource-aware coordination schemes for solving network optimization problems defined by objective functions that combine locally evaluable costs with network-wide coupling components. These methods are well suited for a group of supervised agents trying to solve an optimization problem under mild coordination requirements. Each agent has information on its local cost and coordinates with the network supervisor for information about the coupling term of the cost. The proposed approach is feedback-based and asynchronous by design, guarantees anytime feasibility, and ensures the asymptotic convergence of the network state to the desired optimizer. Numerical simulations on a power system example illustrate our results.

decentralized algorithms↗
DOE OSTI2023

Grid Optimization Competition on Synthetic and Industrial Power Systems

This paper summarizes a grid optimization (GO) competition effort in the United States to find the best solution strategies for up to interconnect-scale power system networks with around 32,000 buses. The optimization problem is a mixedinteger, non-convex non-linear problem, (MINLP) and includes discrete variables such as unit commitment and line switching, control settings (transformer taps and phase shifters with impedance correction tables), and bus shunts. The case study includes six actual industry grids as well as 16 realistic synthetic grids created by three different dataset teams. The winners are selected and ranked based on scoring criteria, which consider the solution quality (such as objective functions) within time limits. Nine winner teams are selected from 26 competitor teams. The results achieved by different teams are described and the performance of different algorithms on synthetic grids and actual industry grids are compared and analyzed.

mixed-integer non-linear programming↗