Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimization problems”

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

Bayesian Optimization for Reactor Design Optimization

This study present a test case in which the Bayesian Optimization method is applied to a simulation-based reactor core design optimization problem. The test case aims to showcase the potential of an automated design optimization algorithm for reactor designs by streamlining the reactor core design workflow, given the high computational cost of simulations. The contributions of this work are threefold. First, the existing HTGR model is converted into a simulation-based design optimization test case by developing a pipeline that enables modification of key design parameters and evaluates design performance based on simulation outputs. Second, Bayesian Optimization is implemented and adapted to demonstrate the feasibility of automatic design optimization for nuclear reactor core. Proposed approach leverages Gaussian Process models to characterize the relationship between design variables and performance metrics, while incorporating novel acquisition functions that balance exploration of the design space with exploitation of promising configurations. This implementation lays the foundation for the future developments of reactor design optimization algorithms.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2026

Distributed Quantum-Enhanced Optimization: A Topographical Preconditioning Approach for High-Dimensional Search

Optimization problems become fundamentally challenging as the number of variables increases. Because the volume of the search space grows exponentially, classical algorithms frequently fail to locate the global minimum of non-convex functions. While quantum optimization offers a potential alternative, mapping continuous problems onto near-term quantum hardware introduces severe scaling limits and barren plateaus. To bridge this gap, we propose the Distributed Quantum-Enhanced Optimization (D-QEO) framework. Instead of forcing the quantum processor to find the exact minimum, we use it simply as a topographical preconditioner. The QPU maps the landscape to locate the most promising basin of attraction, generating high-quality seed points for a classical GPU-accelerated solver to refine. To make this approach viable for utility-scale problems, we exploit the mathematical structure of separable functions. This allows us to cut a 50-qubit (i.e., $2^{50}$) global search space into independent and manageable sub-spaces using 5-qubit subcircuits. By executing these fragments concurrently with CUDA-Q, we completely bypass the overhead of cross-register entanglement and classical tensor knitting for separable functions. Benchmarks on the 10-dimensional Rastrigin and Ackley functions show that D-QEO prevents the exponential failure rates observed in purely classical algorithms. Furthermore, this quantum warm-start significantly reduces the number of classical BFGS iterations required to converge, providing a highly practical blueprint for utilizing near-term quantum resources in complex global search.

Soos, Dominik [Old Dominion U.]↗
NASA NTRS1973

First-order corrections to approximate solutions to two-point boundary-condition problems

A method, applicable to real time guidance, is developed for accurate solution to exo-atmospheric space flight optimization problems. In principle the method is applicable to many other two-point boundary-condition (TPBC) problems. The first step of the method is the iterative solution (using a shooting method) of a TPBC problem with differential equations simplified so that they may be solved analytically by means of a single closed-form solution over each stage of the flight. The second step is the addition of a closed-form correction to the solution to the TPBC problem obtained in the first step. The correction accounts (to first-order accuracy) for the errors due to the aforementioned simplifications. Numerical results are given for several orbital injection problems.

Andrus, J. F.↗
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.↗
DOE OSTI2025

Decision-Dependent Uncertainty-Aware Distribution System Planning Under Wildfire Risk

The interaction between power systems and wildfires can be dangerous and costly. Distribution grids can be liable for the outbreak of wildfires during extreme weather. In wildfire-prone areas, investment planning should consider the impact of operational actions on wildfire-related uncertainties affecting line failure likelihood. Here, in this case, endogenous-based uncertainty modeling should comprise the backbone of the investment planning model viz-a-viz the inability of standard exogenous-based uncertainty modeling. Therefore, we propose a decision-dependent uncertainty (DDU) aware methodology to optimize investment portfolios for distribution systems, considering that high power-flow levels in high-threat areas can ignite wildfires and increase line failure probability. The methodology identifies the best combination of upgrades (new lines, hardening existing lines, and placing switching devices). Methodologically, we propose a two-stage distributionally robust planning optimization problem with DDU that considers the distribution system's multiperiod operation. The first stage determines optimal switching actions and line investments, and the second stage evaluates the worst-case expected operational cost under a DDU framework designed to account for the endogenous impact of power-flow levels and hardening investment decisions in the line failure probabilities. An iterative method is tailored to handle the problem and numerical experiments demonstrate a more prepared grid to deal with wildfire risk.

Power systems investment planning↗
NASA NTRS2024

Accelerating Continuous Variable Coherent Ising Machines Via Momentum

The Coherent Ising Machine (CIM) is a non-conventional architecture that takes inspiration from physical annealing processes to solve Ising problems heuristically. Its dynamics are naturally continuous and described by a set of ordinary differential equations that have been proven to be useful for the optimization of continuous variables nonconvex quadratic optimization problems. The dynamics of such Continuous Variable CIMs (CV-CIM) encourage optimization via optical pulses whose amplitudes are determined by the negative gradient of the objective; however, standard gradient descent is known to be trapped by local minima and hampered by poor problem conditioning. In this work, we propose to modify the CV-CIM dynamics using more sophisticated pulse injections based on tried-and-true optimization techniques such as momentum and Adam. Through numerical experiments, we show that the momentum and Adam updates can significantly speed up the CV-CIM’s convergence and improve sample diversity over the original CV-CIM dynamics. We also find that the Adam-CV-CIM’s performance is more stable as a function of feedback strength, especially on poorly conditioned instances, resulting in an algorithm that is more robust, reliable, and easily tunable. More broadly, we identify the CIM dynamical framework as a fertile opportunity for exploring the intersection of classical optimization and modern analog computing.

Ising Model↗
NASA NTRS1973

Application of computer-aided aircraft design in a multidisciplinary environment.

Applications of a multidisciplinary system of computer programs to selected analytical and optimization problems encountered in an aircraft design are described. The depth of the analyses and optimizations permits such detailed output as individual stringer sizes and pressure distributions. Data flow from one program to another is performed in a hands-off manner in the modular and open-ended system. Numerical examples show how this automation permits multidisciplinary trade-off studies, typical of a preliminary design process to be based on such a level of detail in each discipline that normally would not be available at this stage of the process.

Fulton, R. E.↗
NASA NTRS1987

A combined stochastic feedforward and feedback control design methodology with application to autoland design

A combined stochastic feedforward and feedback control design methodology was developed. The objective of the feedforward control law is to track the commanded trajectory, whereas the feedback control law tries to maintain the plant state near the desired trajectory in the presence of disturbances and uncertainties about the plant. The feedforward control law design is formulated as a stochastic optimization problem and is embedded into the stochastic output feedback problem where the plant contains unstable and uncontrollable modes. An algorithm to compute the optimal feedforward is developed. In this approach, the use of error integral feedback, dynamic compensation, control rate command structures are an integral part of the methodology. An incremental implementation is recommended. Results on the eigenvalues of the implemented versus designed control laws are presented. The stochastic feedforward/feedback control methodology is used to design a digital automatic landing system for the ATOPS Research Vehicle, a Boeing 737-100 aircraft. The system control modes include localizer and glideslope capture and track, and flare to touchdown. Results of a detailed nonlinear simulation of the digital control laws, actuator systems, and aircraft aerodynamics are presented.

Halyo, Nesim↗
NASA NTRS2005

Reliability-Based Control Design for Uncertain Systems

This paper presents a robust control design methodology for systems with probabilistic parametric uncertainty. Control design is carried out by solving a reliability-based multi-objective optimization problem where the probability of violating design requirements is minimized. Simultaneously, failure domains are optimally enlarged to enable global improvements in the closed-loop performance. To enable an efficient numerical implementation, a hybrid approach for estimating reliability metrics is developed. This approach, which integrates deterministic sampling and asymptotic approximations, greatly reduces the numerical burden associated with complex probabilistic computations without compromising the accuracy of the results. Examples using output-feedback and full-state feedback with state estimation are used to demonstrate the ideas proposed.

Crespo, Luis G.↗
NASA NTRS2006

Implementing Scientific Simulation Codes Highly Tailored for Vector Architectures Using Custom Configurable Computing Machines

The motivation for this work comes from an observation that amidst the push for Massively Parallel (MP) solutions to high-end computing problems such as numerical physical simulations, large amounts of legacy code exist that are highly optimized for vector supercomputers. Because re-hosting legacy code often requires a complete re-write of the original code, which can be a very long and expensive effort, this work examines the potential to exploit reconfigurable computing machines in place of a vector supercomputer to implement an essentially unmodified legacy source code. Custom and reconfigurable computing resources could be used to emulate an original application's target platform to the extent required to achieve high performance. To arrive at an architecture that delivers the desired performance subject to limited resources involves solving a multi-variable optimization problem with constraints. Prior research in the area of reconfigurable computing has demonstrated that designing an optimum hardware implementation of a given application under hardware resource constraints is an NP-complete problem. The premise of the approach is that the general issue of applying reconfigurable computing resources to the implementation of an application, maximizing the performance of the computation subject to physical resource constraints, can be made a tractable problem by assuming a computational paradigm, such as vector processing. This research contributes a formulation of the problem and a methodology to design a reconfigurable vector processing implementation of a given application that satisfies a performance metric. A generic, parametric, architectural framework for vector processing implemented in reconfigurable logic is developed as a target for a scheduling/mapping algorithm that maps an input computation to a given instance of the architecture. This algorithm is integrated with an optimization framework to arrive at a specification of the architecture parameters that attempts to minimize execution time, while staying within resource constraints. The flexibility of using a custom reconfigurable implementation is exploited in a unique manner to leverage the lessons learned in vector supercomputer development. The vector processing framework is tailored to the application, with variable parameters that are fixed in traditional vector processing. Benchmark data that demonstrates the functionality and utility of the approach is presented. The benchmark data includes an identified bottleneck in a real case study example vector code, the NASA Langley Terminal Area Simulation System (TASS) application.

Rutishauser, David↗
DOE OSTI2025

Alternative mixed integer linear programming optimization for joint job scheduling and data allocation in grid computing

This paper presents a novel approach to the joint optimization of job scheduling and data allocation in grid computing environments. We formulate this joint optimization problem as a mixed integer quadratically constrained program. To tackle the nonlinearity in the constraint, we alternatively fix a subset of decision variables and optimize the remaining ones via Mixed Integer Linear Programming (MILP). We solve the MILP problem at each iteration via an off-the-shelf MILP solver. Our experimental results show that our method significantly outperforms existing heuristic methods, employing either independent optimization or joint optimization strategies. We have also verified the generalization ability of our method over grid environments with various sizes and its high robustness to the algorithm setting.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1976

First order impulsive solutions

A mathematically rigorous derivation is given of first order corrections to multi-impulse approximations to the solutions to space flight optimization problems with bang-bang control. The rocket was subjected to an inverse square gravitational force and to a thrust force with constant magnitude. The mass decreased linearly with time. An optimal impulsive solution was obtained for a problem with given initial and final conditions. The method was then used to obtain first-order corrections to the initial values of the costate variables. Indications are given on how the theory may be extended to higher order corrections. The theory was applied to intercept and rendezvous problems.

Andrus, J. F.↗
DOE OSTI2025

Advancing the STS Neutron Moderator Design with an Automated Optimization Workflow and Unstructured Mesh Modeling

With the Second Target Station approaching its final design phase, a detailed neutronics evaluation of its critical components is necessary. Optimizing the dimensions of the two cold-source moderators that are at the heart of this facility presents a multi-objective optimization problem for which an accurate geometric description is crucial. We have applied a fully automated optimization workflow in which a detailed unstructured mesh geometry is automatically generated with Attila4MC, starting from a parametrized CREO geometry followed by preprocessing with SpaceClaim. With this geometry, a MCNP run is performed to calculate the brightness metrics, which are subsequently provided to the optimization algorithm in DAKOTA that provides new parameters and drives the optimization loop until convergence. In this paper, we show the results of the analysis that are used for the final design of the cylindrical and tube moderator. The optimization simulations provide a refinement to and confirmation of the conclusions of the previous design iteration. Additional to the optimization, a sensitivity study is performed to study the effect of minor geometry changes, which is important for the final engineering design. In conclusion, with these studies, we demonstrate that the automated workflow and high-fidelity unstructured mesh modeling are efficient tools for a thorough design evaluation.

DAKOTA↗
DOE OSTI2025

Closed-Form Approximation of the Total Variation Proximal Operator

Total variation (TV) is a widely used function for regularizing imaging inverse problems that is particularly appropriate for images whose underlying structure is piecewise constant. TV regularized optimization problems are typically solved using proximal methods, but the way in which they are applied is constrained by the absence of a closed-form expression for the proximal operator of the TV function. A closed-form approximation of the TV proximal operator has previously been proposed, but its accuracy was not theoretically explored in detail. Here, we address this gap by making several new theoretical contributions, proving that the approximation leads to a proximal operator of some convex function, it is equivalent to a gradient descent step on a smoothed version of TV, and that its error can be fully characterized and controlled with its scaling parameter. We experimentally validate our theoretical results on image denoising and sparse-view computed tomography (CT) image reconstruction.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Optimization Layers for Pyomo [SWR-25-132]

Optimization Layers for Pyomo solves an optimization problem using Pyomo and IPOPT during the forward pass. It computes the gradient of the optimal solution with respect to the parameters based on the KKT conditions in the backward pass. It is a Python library for constructing differentiable optimization layers in PyTorch from Pyomo optimization models.

Chen, Kejun [National Laboratory of the Rockies (N↗