Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mathematical optimization”

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 487 records · Page 27
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Automatic Loss Factor Modeling and Attribution on Unlabeled PV Energy Data

We present a novel approach for modeling the loss factors of photovoltaic power generation systems (PV systems). This method is a white-box machine learning model built on convex optimization that is fast, interpretable, and auditable. It takes as an input the measured daily energy produced by the system, over a multi-year period, and returns a multiplicative decomposition model of the daily energy signal and full attribution of the total energy loss to each feature. The methods section of this paper has two major components: (1) the description of the signal decomposition (SD) model, expressed in the SD framework, and (2) the attribution of total energy losses via Shapley values. We validate the method on synthetic and open-source data sets and compare to similar methods from the literature.

artificial intelligence↗
DOE OSTI2025

Flexibility Options: A Proposed Product for Managing Imbalance Risk

The presence of variable renewable energy resources with uncertain outputs in day-ahead electricity markets results in additional balancing needs in real-time. Addressing those needs cost-effectively and reliably within a competitive market with unbundled products is challenging as both the demand for and the availability of flexibility depends on day-ahead energy schedules. Existing approaches for reserve procurement usually rely either on oversimplified demand curves that do not consider how system conditions that particular day affect the value of flexibility, or on bilateral trading of hedging instruments that are not co-optimized with day-ahead schedules. This article proposes a new product, ‘Flexibility Options', to address these two limitations. The demand for this product is endogenously determined in the day-ahead market and it is met cost-effectively by considering real-time supply curves for product providers, which are co-optimized with the energy supply. As we illustrate with numerical examples and mathematical analysis, the product addresses the hedging needs of participants with imbalances cost-effectively, provides a less intermittent revenue stream for participants with flexible outputs, promotes value-driven pricing of flexibility, and ensures that the system operator is revenue-neutral. This article provides a comprehensive design that can be further tested and applied in large-scale systems.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2025

Landscaper v1

Understanding the inner workings of machine learning models through their loss landscapes offers crucial insights into model properties, optimization dynamics, and generalizability. However, accessing these insights has traditionally required specialized mathematical expertise, limiting broader adoption. Landscaper is an open-source Python package designed to bridge this gap. Landscaper seamlessly integrates a suite of multi-dimensional loss landscape analyses with cutting-edge topological data analysis (TDA) methods. This powerful combination makes both fundamental loss landscape analysis and advanced TDA techniques accessible to the broader scientific ML community, without requiring deep pre-existing mathematical knowledge. Landscaper offers three key functionalities: * Construction: Builds detailed loss landscape representations through versatile low and high-dimensional sampling techniques. * Quantification: Applies advanced metrics, including a novel topological data analysis (TDA) based smoothness metric, enabling new perspectives on model behavior. * Visualization: Offers intuitive tools to visualize and interpret loss landscapes, providing actionable insights beyond traditional performance metrics.

Weber, Gunther [Lawrence Berkeley National Laborat↗
NASA NTRS1983

Structural optimization - Challenges and opportunities

A review of developments in structural optimization techniques and their interface with growing computer capabilities is presented. Structural design steps comprise functional definition of an object, an evaluation phase wherein external influences are quantified, selection of the design concept, material, object geometry, and the internal layout, and quantification of the physical characteristics. Optimization of a fully stressed design is facilitated by use of nonlinear mathematical programming which permits automated definition of the physics of a problem. Design iterations terminate when convergence is acquired between mathematical and physical criteria. A constrained minimum algorithm has been formulated using an Augmented Lagrangian approach and a generalized reduced gradient to obtain fast convergence. Various approximation techniques are mentioned. The synergistic application of all the methods surveyed requires multidisciplinary teamwork during a design effort.

Sobieszczanski-Sobieski, J.↗
NASA NTRS1983

Optimal mistuning for enhanced aeroelastic stability of transonic fans

An inverse design procedure was developed for the design of a mistuned rotor. The design requirements are that the stability margin of the eigenvalues of the aeroelastic system be greater than or equal to some minimum stability margin, and that the mass added to each blade be positive. The objective was to achieve these requirements with a minimal amount of mistuning. Hence, the problem was posed as a constrained optimization problem. The constrained minimization problem was solved by the technique of mathematical programming via augmented Lagrangians. The unconstrained minimization phase of this technique was solved by the variable metric method. The bladed disk was modelled as being composed of a rigid disk mounted on a rigid shaft. Each of the blades were modelled with a single tosional degree of freedom.

Hall, K. C.↗
NASA NTRS1984

Structural optimization: Challenges and opportunities

A review of developments in structural optimization techniques and their interface with growing computer capabilities is presented. Structural design steps comprise functional definition of an object, an evaluation phase wherein external influences are quantified, selection of the design concept, material, object geometry, and the internal layout, and quantification of the physical characteristics. Optimization of a fully stressed design is facilitated by use of nonlinear mathematical programming which permits automated definition of the physics of a problem. Design iterations terminate when convergence is acquired between mathematical and physical criteria. A constrained minimum algorithm has been formulated using an Augmented Lagrangian approach and a generalized reduced gradient to obtain fast convergence. Various approximation techniques are mentioned. The synergistic application of all the methods surveyed requires multidisciplinary teamwork during a design effort.

Sobieszczanski-Sobieski, J.↗
NASA NTRS1984

Design of helicopter rotor blades for desired placement of natural frequencies

The mass and stiffness distributions for helicopter rotor blades are to be tailored in such a way to give a predetermined placement of blade natural frequencies. This optimization problem is addressed in a methodical, step-by-step process in which each aspect of the optimization is studied in detail. Careful consideration is also given to the mathematical formulation of the problem and to the introduction of appropriate constraints.

Peters, D. A.↗
NASA NTRS2024

Implementation of a First-Order Quadratic Program Solver in C

This paper details a translation of a first order quadratic program (QP) solver from MATLAB to C. NASA could use this QP solver to generate online flight path trajectories for powered descent vehicles during landing. Over 12 weeks, the team designed, implemented, and tested two iterations of the QP solver for accuracy and runtime on 104 benchmark QP tests. The final iteration was 541.07% faster than the first, handling most tests in under one second. Additionally, it solved four more QP tests for N≥1383, and all outputs for cost and D_x matched the MATLAB reference values.

Optimization↗
DOE OSTI2024

Modeling and Analysis of a Heat Pump Clothes Dryer with Thermal Energy Storage

Clothes drying is an energy-intensive process that causes significant electricity consumption and carbon emissions in the US. Approximately 83% of Households in the US own a tumble clothes dryer at home and 80% of dryers are electrical resistance dryers with low energy efficiency. Heat pump technology makes it possible for highly efficient and clean drying. Additionally, the ventless design of heat pump clothes dryers (HPCD) provides more installation flexibility. HPCD involves three primary mediums: wet clothes, a closed air loop, and a refrigerant circuit. The evaporator is used to dehumidify the wet air and the condenser is used to re-heat the dry air. One of the critical technological barriers to HPCD market penetration is its long drying time, primarily due to the relatively low discharging temperature and the slow response during the warm-up period. In this study, the thermal energy storage (TES) technology is adopted to address this challenge by providing pre-heating of air prior to the condenser to increase the operating temperature of the process air. The heat pump will charge the phase change material (PCM) in the TES device with heating energy during clothes washing and the PCM will discharge the stored heat to facilitate air heating during clothes drying. To analyze the optimal design and potential for energy saving and drying time reduction, a mathematical model of the HPCD system was developed. The HPCD is a highly dynamic system with a coupled heat and mass transfer and heat pumping cycle. This paper provides solutions to simulate the transient behavior of the system while maintaining low computational cost. The modeling result indicates reduced energy consumption and drying time by integrating TES with HPCD, as compared to electrical resistance dryers. The study can provide significant insights into improving building flexibility with TES and smart appliances.

Liu, Xiaoli↗
NASA NTRS1979

Mathematic modeling of the Earth's surface and the process of remote sensing

It is shown that real data from remote sensing of the Earth from outer space are not best suited to the search for optimal procedures with which to process such data. To work out the procedures, it was proposed that data synthesized with the help of mathematical modeling be used. A criterion for simularity to reality was formulated. The basic principles for constructing methods for modeling the data from remote sensing are recommended. A concrete method is formulated for modeling a complete cycle of radiation transformations in remote sensing. A computer program is described which realizes the proposed method. Some results from calculations are presented which show that the method satisfies the requirements imposed on it.

Balter, B. M.↗
DOE OSTI2026

Optimality of Gradient-MUSIC for Spectral Estimation

We introduce the Gradient-MUSIC algorithm for estimating the unknown frequencies and amplitudes of a nonharmonic signal from noisy time samples. While the classical MUSIC algorithm performs a computationally expensive search over a fine grid, Gradient-MUSIC is significantly more efficient and eliminates the need for discretization over a fine grid by using optimization techniques. It coarsely scans the 1D landscape to find initialization simultaneously for all frequencies followed by parallelizable local refinement via gradient descent. We also analyze its performance when the noise level is sufficiently small and the signal frequencies are separated by at least 8π/m, where π/m is the standard resolution of this problem. Even though the 1D landscape is nonconvex, we prove a global convergence result for Gradient-MUSIC: coarse scanning provably finds suitable initialization and gradient descent converges at a linear rate. In addition to convergence results, we also upper bound the error between the true signal frequencies and amplitudes with those found by Gradient-MUSIC. For example, if the noise has $\ell^\infty$ norm at most ϵ, then the frequencies and amplitudes are recovered up to error at most Cϵ/m and Cϵ respectively, which are minimax optimal in m and ϵ. Our theory can also handle stochastic noise with performance guarantees under nonstationary independent Gaussian noise. Our main approach is a comprehensive geometric analysis of the landscape, a perspective that has not been explored before.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Semiglobal Safety-Filtered Extremum Seeking With Unknown CBFs

We introduce a safe extremum-seeking (Safe ES) algorithm which achieves the minimization of an unknown objective function while ensuring that an unknown, yet measured, control barrier function (CBF) remains above an arbitrarily small negative value for all time. In other words, “practical safety” is maintained during the entire period of convergence to the constrained extremum. Our design is based on quadratic program (QP) CBF style filters for safety, which is applied in an average and estimated sense. Using nonsmooth analysis tools, we guarantee semiglobal practical asymptotic (SPA) stability of the global constrained optimum, practical convergence to the safe set if starting in a condition violating the CBF, and practical safety for all time—semiglobally—if starting in safe set. The safety result of the paper is analogous with modern notions of SPA stability, guaranteeing that, for any small violation of safety, there exist design coefficients which guarantee that such a small violation is not exceeded. The paper outlines a set of sufficient conditions on the barrier and objective functions, and by way of a Lyapunov argument, we demonstrate that nonconvex constrained optimization problems can be solved. We present these results in the setting of a static map and a dynamical system. A simulation example illustrates the results.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Topology optimization for the full-cell design of porous electrodes in electrochemical energy storage devices

In this paper, we introduce a density-based topology optimization framework to design porous electrodes for maximum energy storage. We simulate the full cell with a model that incorporates electronic potential, ionic potential, and electrolyte concentration. The system consists of three materials, namely pure liquid electrolyte and the porous solids of the anode and cathode, for which we determine the optimal placement. We use separate electronic potentials to model each electrode, which allows interdigitated designs. As a result, a penalization is required to ensure that the anode and cathode do not touch, i.e., causing a short circuit. We compare multiple 2D designs generated for different fixed conditions, e.g. material properties. A 3D design with complex channel and interlocked structure is also created. All optimized designs are far superior to the traditional monolithic electrode design with respect to energy storage metrics. We observe up to a 750% increase in energy storage for cases with slow effective ionic diffusion within the porous electrode.

25 ENERGY STORAGE↗
NASA NTRS1999

Integrated Design and Optimization of Microelectronic Devices

A genetic algorithm is used for design of infrared filters and in the understanding of the material structure of a resonant tunneling diode. These two components are examples of microdevices and nanodevices that can be numerically simulated using fundamental mathematical and physical models.

Microelectronic↗
DOE OSTI2024

Optimization of the artificial viscosity in Lagrangian staggered discretization codes. Modeling 1D stand-alone shock - case study

We have developed new measures of errors for numerical shock. The new approach is based on analysis of the structure function, and separation of the errors related to oscillations and shock width, which also include error in the position of the ”center” of the numerical shock. We have demonstrated that those measures correctly characterize the numerical solution. We introduced an objective function in, which both types of errors are weighted, and presented optimal values of the coefficients of the linear and quadratic viscosity for different weights and different Mach numbers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Structure-aware Initialization via Numerical Continuation and Informed Priors

Scientific machine learning (SciML) often operates in ill-conditioned, weakly identifiable regimes due to limited data or indirect observations. In such settings, optimization and inference are highly sensitive to the starting point, making initialization--often under-reported--a consequential degree of freedom. Random initialization is not a neutral default as it induces an implicit prior over candidate solutions and can systematically bias the result, producing large run-to-run variability. Here, we formalize this view by treating initialization as a hidden confounder in SciML and develop a unifying theory for structure-aware initialization via numerical continuation, constructing warm starts from related problem instances. Across representative tasks, including physics-informed neural networks, maximum likelihood estimation, and variational inference, warm starts have been shown to consistently reduce optimization effort and improve reliability.

Data integrity↗
DOE OSTI2026

Explainable physics-based constraints on reinforcement learning for accelerator optimization

We present a reinforcement learning (RL) framework for optimizing particle accelerator experiments that builds explainable physics-based constraints on agent behavior. The goal is to increase transparency and trust by letting users verify that the agent’s decision-making process incorporates suitable physics. Our algorithm uses a learnable surrogate function for physical observables, such as energy, and uses them to fine-tune how actions are chosen. This surrogate can be represented by a neural network or by an interpretable sparse dictionary model. We test our algorithm on a range of particle accelerator optimization environments designed to emulate the Continuous Electron Beam Accelerator Facility at Jefferson Lab. By examining the mathematical form of the learned constraint function, we are able to confirm the agent has learned to use the established physics of each environment. In addition, we find that the introduction of a physics-based surrogate enables our RL algorithms to reliably converge for difficult high-dimensional accelerator optimization environments.

explainability↗