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 433 records · Page 24
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Convex Optimization with Smart Grid Examples

In this talk, we give an overview of the field of convex optimization and work through four canonical problems that relate to electrical power systems and smart grids. The purpose of these examples is to demonstrate the breadth of applications of convex optimization in energy research and to show that toy versions of these problems can be solved in just a few lines of code, indicating the scale and complexity of problems that can be tackled with a more detailed treatment. We emphasize the cvxpy modeling language as a foundational technology that enables rapid development and prototyping of convex optimization problems, allowing researchers to focus on model development rather than get caught in the weeds of numerical and code implementation.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1989

Real-Time Optimization Of Receiver Bandwidth

Estimates of signal and noise spectra enhance reception of weak signals. Carrier-tracking phase-locked loop represented by linear mathematical model at small rms phase errors. Loop continuously generates estimates of received phase. Bandwidth (in effect, scale of complex-frequency variable p) optimized to minimize rms phase error. Minimum signals tracked 5 to 15 dB below those tracked by current receivers. Improvement accomplished by use of bandwidths of 0.1 to 1.0 Hz, in contrast with 3-Hz bandwidth in current use. Principle of real-time optimization of bandwidth adapted to other situations to enhance reception of weak signals otherwise "buried" in noise.

Vilnrotter, V. A.↗
NASA NTRS1978

Optimized solar module design

The minimum cost per unit of power output from flat plate solar modules can most likely be achieved through efficient packaging of higher efficiency solar cells. This paper outlines a module optimization method which is broadly applicable, and illustrates the potential results achievable from a specific high efficiency tandem junction (TJ) cell. A mathematical model is used to assess the impact of various factors influencing the encapsulated cell and packing efficiency. The optimization of the packing efficiency is demonstrated. The effect of encapsulated cell and packing efficiency on the module add-on cost is shown in a nomograph form.

Santala, T.↗
DOE OSTI2024

Targeted Adaptive Design

Modern advanced manufacturing and advanced materials design often require searches of relatively high-dimensional process control parameter spaces for settings that result in optimal structure, property, and performance parameters. The mapping from the former to the latter must be determined from noisy experiments or from expensive simulations. Here, we abstract this problem to a mathematical framework in which an unknown function from a control space to a design space must be ascertained by means of expensive noisy measurements, which locate control settings generating desired design features within specified tolerances, with quantified uncertainty. We describe targeted adaptive design (TAD), a new algorithm that performs this sampling task efficiently. TAD creates a Gaussian process surrogate model of the unknown mapping at each iterative stage, proposing a new batch of control settings to sample experimentally and optimizing the updated expected log-predictive probability density of the target design. TAD either stops upon locating a solution with uncertainties that fit inside the tolerance box or uses a measure of expected future information to determine that the search space has been exhausted with no solution. TAD thus embodies the exploration-exploitation tension in a manner that recalls, but is essentially different from, Bayesian optimization and optimal experimental design.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Toward computing bounds for Ramsey numbers using quantum annealing

Quantum annealing is a powerful tool for solving and approximating combinatorial optimization problems, such as graph partitioning, community detection, centrality, routing problems, and more. In this paper we explore the use of quantum annealing as a tool for use in exploring combinatorial mathematics research problems. We consider the monochromatic triangle problem and the Ramsey number problem, both examples of graph coloring. Conversion to quadratic unconstrained binary optimization (QUBO) form is required to run on quantum hardware. While the monochromatic triangle problem is quadratic by nature, the Ramsey number problem requires the use of order reduction methods for a quadratic formulation. The goal is to provide a method for producing special colorings of graphs which if successful would provide lower bounds for certain Ramsey numbers. We discuss implementations, limitations, and results when running on the D-Wave Advantage quantum annealer.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Dual Representations and H ∞ -Optimal Control of Partial Differential Equations

We consider H ∞ -optimal state-feedback control of the class of linear Partial Differential Equations (PDEs) which admit a Partial Integral Equation (PIE) representation. While linear matrix inequalities are commonly used for optimal control of Ordinary Differential Equations (ODEs), the absence of a universal state-space representation and suitable dual form prevents such methods from being applied to optimal control of PDEs. Specifically, for ODEs, the controller synthesis problem is defined in state-space, and duality is used to resolve the bilinearity of that synthesis problem. Recently, the PIE representation was proposed as a universal state-space representation for linear PDE systems. In this paper, we show that any PDE system represented by a PIE admits a dual PIE with identical stability and I/O properties. This result allows us to reformulate the stabilizing and optimal state-feedback control problems as convex optimization over the cone of positive Partial Integral (PI) operators. Operator inversion formulae then allow us to construct feedback gains for the original PDE system. The results are verified through application to several canonical problems in optimal control of PDEs and indicate the resulting bounds on H ∞ norm are not conservative.

42 ENGINEERING↗
DOE OSTI2025

Reliable and Efficient Machine Learning (Final Technical Report)

Modern scientific experiments generate massive amounts of data at a pace much faster than humans can manually analyze. While machine learning has revolutionized commercial data analysis (such as recommending movies or recognizing faces), applying these tools to complex scientific discovery is challenging because scientific answers must be precise, interpretable, and adhere to physical laws. The research under this project aims to develop new mathematical tools and computer algorithms specifically designed for scientific applications. Major progress has been made in automatically cleaning and deconstructing messy experimental data, analyzing the visual information of physical phenomena, determining the underlying physical variables, and providing rig orous mathematical analysis of interesting algorithms and concepts widely used in machine learning. This project addressed the critical gap between our ability to generate massive scientific data and our ability to extract interpretable information from it. We established mathematical foundations for Scientific Machine Learning (SciML) aimed at effective data analytics and automated discovery. Our work focused on three core objectives: (1) developing reliable feature extraction methods for dynamic high-dimensional data, (2) establishing mathematical foundations for discovering dynamics via neural networks, and (3) creating rigorous optimization techniques for these models. Key outcomes come from two fronts. On the practical side, they include the development of algorithms that significantly enhance the extraction of signals from field data, as well as the capability to handle situations that exhibit smooth variations or physical stretching due to temperature changes. They also include the creation of an automated framework for discovering fundamental state variables from raw experimental data, demonstrating the ability to identify intrinsic physical dimensions without prior knowledge of the governing laws. On the theoretical front, the research results in theoretical advances in Optimal Transport, a widely used notion in SciML, specifically regarding functions with fixed-size nodal sets, provide sharp bounds relevant to uncertainty quantification. Meanwhile, the outcomes also include the establishment of convergence theories for nonlocal gradient descent methods, enabling robust optimization with noisy data in high-dimensional settings commonly encountered in scientific modeling. The project also helps creating opportunities to train the next generation of researchers, equipping them with the necessary technical skills for today’s workplace and preparing them for future advances.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Multistart algorithm for identifying all optima of nonconvex stochastic functions

Here, we propose a multistart algorithm to identify all local minima of a constrained, nonconvex stochastic optimization problem. The algorithm uniformly samples points in the domain and then starts a local stochastic optimization run from any point that is the "probabilistically best" point in its neighborhood. Under certain conditions, our algorithm is shown to asymptotically identify all local optima with high probability; this holds even though our algorithm is shown to almost surely start only finitely many local stochastic optimization runs. We demonstrate the performance of an implementation of our algorithm on nonconvex stochastic optimization problems, including identifying optimal variational parameters for the quantum approximate optimization algorithm.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1971

Optimization of life support systems and their systems reliability

The identification, analysis, and optimization of life support systems and subsystems have been investigated. For each system or subsystem that has been considered, the procedure involves the establishment of a set of system equations (or mathematical model) based on theory and experimental evidences; the analysis and simulation of the model; the optimization of the operation, control, and reliability; analysis of sensitivity of the system based on the model; and, if possible, experimental verification of the theoretical and computational results. Research activities include: (1) modeling of air flow in a confined space; (2) review of several different gas-liquid contactors utilizing centrifugal force: (3) review of carbon dioxide reduction contactors in space vehicles and other enclosed structures: (4) application of modern optimal control theory to environmental control of confined spaces; (5) optimal control of class of nonlinear diffusional distributed parameter systems: (6) optimization of system reliability of life support systems and sub-systems: (7) modeling, simulation and optimal control of the human thermal system: and (8) analysis and optimization of the water-vapor eletrolysis cell.

Fan, L. T.↗
DOE OSTI2024

Acid–base concentration swing for direct air capture of carbon dioxide

This work demonstrates the first experimental evidence of the acid–base concentration swing (ABCS) for direct air capture of CO 2 . This process is based on the effect that concentrating particular acid–base chemical reactants will strongly acidify solution, through Le Chatelier's principle, and result in outgassing absorbed CO 2 . After collecting the outgassed CO 2 , diluting the solution will result in a reversal of the acid–base reaction, basifying the solution and allowing for atmospheric CO 2 absorption. The experimental study examines a system that includes sodium cation as the alkalinity carrier, boric acid, and a polyol complexing agent that reversibly reacts with boric acid to strongly acidify solution upon concentration. Though the tested experimental system faces absorption rate and water capacity limitations, the ABCS process described here provides a basis for further process optimization. A generalized theoretical ABCS reaction framework is developed and different reaction orders and conditions are studied mathematically. Higher order reactions yield favorable cycle output results, reaching volumetric cycle capacity above 50 mM for third-order and 80 mM for fourth-order reactions. Optimal equilibrium constants are determined in order to guide alternative chemical searches and synthetic chemistry design targets. There is a substantial energetic benefit for reaction orders above the first, with second- and third-order ABCS cycles exhibiting a thermodynamic minimum work for the concentrating and outgassing steps around 150 kJ per mole of CO 2 . A significant advantage of the ABCS is that it can be driven through well-developed and widely-deployed desalination technologies, such as reverse osmosis, with opportunities for energy recovery when recombining the concentrated and diluted streams, and extraction can occur directly from the liquid phase upon vacuum application.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS2005

Fitting Nonlinear Curves by use of Optimization Techniques

MULTIVAR is a FORTRAN 77 computer program that fits one of the members of a set of six multivariable mathematical models (five of which are nonlinear) to a multivariable set of data. The inputs to MULTIVAR include the data for the independent and dependent variables plus the user s choice of one of the models, one of the three optimization engines, and convergence criteria. By use of the chosen optimization engine, MULTIVAR finds values for the parameters of the chosen model so as to minimize the sum of squares of the residuals. One of the optimization engines implements a routine, developed in 1982, that utilizes the Broydon-Fletcher-Goldfarb-Shanno (BFGS) variable-metric method for unconstrained minimization in conjunction with a one-dimensional search technique that finds the minimum of an unconstrained function by polynomial interpolation and extrapolation without first finding bounds on the solution. The second optimization engine is a faster and more robust commercially available code, denoted Design Optimization Tool, that also uses the BFGS method. The third optimization engine is a robust and relatively fast routine that implements the Levenberg-Marquardt algorithm.

Hill, Scott A.↗
DOE OSTI2024

Multi-objective optimization of PWR core design using NSGA-II in RAVEN’s optimization framework

Designing an PWR loading pattern is a combinatorial problem challenging to solve by brute force or traditional methods due to the sheer amount of possible combination, and constraints. Nature-inspired algorithms, such as the genetic algorithm, have demonstrated the potential to tackle this problem. The goal of this work was to improve and demonstrate the capabilities for constrained, multi-objective optimization (MOO) of loading patterns using NSGA-II in RAVEN’s optimization framework.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2026

Energy-Transit Nexus Tools for Bus Fleet Electrification (NEXTBUS)

NEXTBUS is an open-source software project that integrates NLR's bus energy modeling and simulation tools with multi-objective optimization for fleet operations. NLR is collaborating with a transit technology startup, ReVolt, to commercialize these capabilities by deploying NEXTBUS in ReVolt's software platform. The goal is to manage the added complexities of running a heterogeneous fleet, encompassing battery electric and diesel buses, across a large, multi-depot transit network.

33 ADVANCED PROPULSION SYSTEMS↗
NASA NTRS1989

Adjusting Surfaces Of Large Antenna Reflectors

New approach more effective than traditional rms-surface-distortion approach. Optimization procedure for control of shape of reflector of large space antenna (LSA). Main feature is shape-controlling mathematical mechanism driven by need to satisfy explicit EM design requirements. Uses standard finite-element structural analysis, aperture-integration EM analysis, and constrained optimization techniques to predict set of actuator inputs that improves performance of antenna while minimizing applied control effort. Procedure applicable to wide variety of LSA concepts.

Padula, Sharon L.↗