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 1,225 records · Page 68

Applicability study of Bayesian optimization in core neutronic design using a toy model

At the Japan Atomic Energy Agency (JAEA), an innovative design approach named ARKADIA (Advanced Reactor Knowledge- and AI-aided Design Integration Approach through the whole plant life cycle) for advanced nuclear reactors is currently under development. One task in ARKADIA is to build a system that automatically optimizes core and fuel designs by conducting core neutronic and thermal-hydraulic calculations, fuel integrity evaluations, and plant dynamic analyses. This system will be implemented to automatically find an optimal design that minimizes (or maximizes) objective function defined by core performance while varying the core and fuel design parameters such as fuel pin diameter, core height and diameter. In this study, as the first step of system development, we focused only on core neutronic design and conducted a study of automatic optimization. As the optimization algorithm, Bayesian optimization (BO), an effective method for optimization problems with expensive computational cost of objective function, was utilized. The applicability of BO was studied based on single- and two-objective optimization examples of core neutronic design in a toy model. As a result, in the former, it was shown that BO can give the optimal solution, which matches the reference solution calculated by a brute force calculation well, with a small number of required calculations. Usability on core neutronic designs, where the computational cost per case is high, was confirmed. In the latter, it was found that BO can give a Pareto solutions-set that shows good agreement with the reference solution. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Application of A Dual-Quaternion Six Degree-of-Freedom Guidance to Human-Scale Mars Entry, Descent, and Landing

Landing humans on Mars comes with many challenges, including the execution of a safe and precise entry, descent, and landing (EDL) sequence. Various NASA studies have shown that there are a variety of EDL guidance methods that potentially offer solutions to the human-scale EDL precision landing problem and work is ongoing to assess new and novel methods. As part of these ongoing studies, a dual-quaternion-based six degree-of-freedom guidance algorithm was implemented in the Program to Optimize Simulated Trajectories II (POST2), a NASA-and industry-standard spacecraft trajectory and vehicle design tool. This algorithm considers both translational and rotational dynamics and casts the trajectory optimization problem as a quadratically constrained quadratic program (QCQP) with various constraints at discrete nodes throughout the trajectory. The QCQP problem is solved via an alternating direction method of multipliers (ADMM) approach, and the output is a discretized optimal trajectory. The guidance is applied to a NASA reference human-scale Mars EDL system, and results are compared and discussed.

Optimization↗

Application of A Dual-Quaternion Six Degree-of-Freedom Guidance to Human-Scale Mars Entry, Descent, and Landing

Landing humans on Mars comes with many challenges, including the execution of a safe and precise entry, descent, and landing (EDL) sequence. Various NASA studies have shown that there are a variety of EDL guidance methods that potentially offer solutions to the human-scale EDL precision landing problem and work is ongoing to assess new and novel methods. As part of these ongoing studies, a dual-quaternion-based six degree-of-freedom guidance algorithm was implemented in the Program to Optimize Simulated Trajectories II (POST2), a NASA-and industry-standard spacecraft trajectory and vehicle design tool. This algorithm considers both translational and rotational dynamics and casts the trajectory optimization problem as a quadratically constrained quadratic program (QCQP) with various constraints at discrete nodes throughout the trajectory. The QCQP problem is solved via an alternating direction method of multipliers (ADMM) approach, and the output is a discretized optimal trajectory. The guidance is applied to a NASA reference human-scale Mars EDL system, and results are compared and discussed.

Optimization↗

Guidance and flight control law development for hypersonic vehicles

During the third reporting period our efforts were focused on a reformulation of the optimal control problem involving active state-variable inequality constraints. In the reformulated problem the optimization is carried out not with respect to all controllers, but only with respect to asymptotic controllers leading to the state constraint boundary. Intimately connected with the traditional formulation is the fact that when the reduced solution for such problems lies on a state constraint boundary, the corresponding boundary layer transitions are of finite time in the stretched time scale. Thus, it has been impossible so far to apply the classical asymptotic boundary layer theory to such problems. Moreover, the traditional formulation leads to optimal controllers that are one-sided, that is, they break down when a disturbance throws the system on the prohibited side of the state constraint boundary.

Calise, A. J.↗

Capacitated p -hub approach for park-and-ride facility location problem under nested logit demand function: polyhedral approaches

By generalizing the unconstrained p-hub approach for the park-and-ride (P&R) facility location problem under the multinomial logit demand function, the capacitated p-hub approach for the problem under the nested logit demand function captures a broader range of real-world cases. To solve this problem optimally, we introduce a mixed-integer linear program and accelerate its solution by enhancing the branch-and-cut procedure. To address the problem at a large scale, we introduce two other polyhedral approaches: variable neighborhood search (VNS) and adaptive randomized rounding (ARR). Downtown areas in Seoul have a high modal share of public transportation and congested road traffic, yet P&R has not been widely implemented. Therefore, we apply the ARR procedure to solve a real-world problem using traffic and geographic data from the Seoul metropolitan area. ARR performs better than VNS and addresses real-world cases. The solutions obtained by ARR present a phased expansion plan that encourages policymakers to start installing a small number of P&Rs immediately.

Capacitated p-hub approach↗

Architecture for Quantum-in-the Loop Real-Time Simulations for Designing Resilient Smart Grids

With the power grid growing more complex every day with the inclusion of new sensors and regulatory approvals that enable end-users and small local developers to participate in the grid, it is becoming challenging for conventional smart grid simulation, emulation, and testing technologies to keep up. In this work, we propose that quantum-encoded real-time simulations can be helpful under the new paradigm and operational circumstances to solve optimization problems for power grids. By leveraging the principles of quantum mechanics, the proposed quantum-in-loop (QIL) framework will enable better and faster optimization solutions based on real-world, real-time data streams, facilitating the real-time planning and operations of electrical grids that rely on millions of distributed sensors and controllers. Furthermore, QIL will allow researchers and engineers to assist utilities in designing, developing, and de-risking algorithms to optimize power grid operation and resilience by considering inputs from millions of grid-connected devices. QIL framework is being developed to have a self-limiting triage mechanism, which will help engineers and practitioners identify fundamental physical limits on quantum processors, revealing what quantum algorithms can and cannot do in utility-specific use cases and must continue to count on classical high-performance computing infrastructure.

digital real-time simulation↗

Algebraic distance on graphs.

Measuring the connection strength between a pair of vertices in a graph is one of the most important concerns in many graph applications. Simple measures such as edge weights may not be sufficient for capturing the effects associated with short paths of lengths greater than one. In this paper, we consider an iterative process that smooths an associated value for nearby vertices, and we present a measure of the local connection strength (called the algebraic distance; see [D. Ron, I. Safro, and A. Brandt, Multiscale Model. Simul., 9 (2011), pp. 407-423]) based on this process. The proposed measure is attractive in that the process is simple, linear, and easily parallelized. An analysis of the convergence property of the process reveals that the local neighborhoods play an important role in determining the connectivity between vertices. We demonstrate the practical effectiveness of the proposed measure through several combinatorial optimization problems on graphs and hypergraphs.

99 GENERAL AND MISCELLANEOUS↗

Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations

In this article, we focus on the communication costs of three symmetric matrix computations: (i) multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK) (ii) adding the result of the multiplication of a matrix with the transpose of another matrix and the transpose of that result, known as a symmetric rank-2k update (SYR2K) (iii) performing matrix multiplication with a symmetric input matrix (SYMM). All three computations appear in the Level 3 Basic Linear Algebra Subroutines (BLAS) and have wide use in applications involving symmetric matrices. We establish communication lower bounds for these kernels using sequential and distributed-memory parallel computational models, and we show that our bounds are tight by presenting communication-optimal algorithms for each setting. Our lower bound proofs rely on applying a geometric inequality for symmetric computations and analytically solving constrained nonlinear optimization problems. As a result, the symmetric matrix and its corresponding computations are accessed and performed according to a triangular block partitioning scheme in the optimal algorithms.

Al Daas, Hussam [Rutherford Appleton Laboratory, D↗

Investigation on the use of optimization techniques for helicopter airframe vibrations design studies

Results of the investigation of formal nonlinear programming-based numerical optimization techniques of helicopter airframe vibration reduction are summarized. The objective and constraint function and the sensitivity expressions used in the formulation of airframe vibration optimization problems are presented and discussed. Implementation of a new computational procedure based on MSC/NASTRAN and CONMIN in a computer program system called DYNOPT for optimizing airframes subject to strength, frequency, dynamic response, and dynamic stress constraints is described. An optimization methodology is proposed which is thought to provide a new way of applying formal optimization techniques during the various phases of the airframe design process. Numerical results obtained from the application of the DYNOPT optimization code to a helicopter airframe are discussed.

Sreekanta Murthy, T.↗

Mathematical Model of a Regenerative Fuel Cell for System Optimization

This thesis developed a system-level optimization model of a regenerative fuel cell (RFC) system for long-duration, off-world energy storage applications. Prior RFC design studies have typically been limited to reduced parameter sets and simplified constraints due to computational limitations relative to the number of relevant degrees of freedom. As a result, important nonlinear interactions between subsystems have not been fully captured. This work began to address that gap by developing a higher-fidelity, nonlinear optimization framework that incorporates a broader set of design variables and coupled constraints, enabling a multidimensional model that captures the coupled behavior of RFC subsystems and demonstrates the feasibility of applying optimization to such systems. An expanded system-level optimization approach was established that captures interactions between electrochemical performance, structural requirements, and storage design. This enabled a more comprehensive evaluation of trade-offs than conventional formulations. The model integrates four coupled subsystems: a fuel cell, an electrolyzer, reactant gas, and high-pressure storage tanks, and was formulated to accommodate a wide range of mission parameters, including operational time and required output power. It incorporates constraints on available solar array power, reactant mass balance between production and consumption, and pressure-dependent storage requirements. To enable reliable convergence, the optimization problem was reformulated to reduce dimensionality and improve numerical stability, with subsystem models organized for efficient evaluation. Problem dimensionality was reduced by consolidating lower-level design variables into higher-level representative quantities, and subsystem behavior was evaluated within the optimization loop. A multi-start initialization strategy was employed to mitigate sensitivity to local minima and improve solution quality, while nonlinear relationships were solved using robust numerical methods. The results showed that convergence was achieved across a range of required output power values. Specific energy reached a maximum at a critical mission power level, where the electrolyzer power matched the available solar input and operated near its voltage and current density limits. Beyond this point, further increases in required power resulted in less mass-efficient operation, increasing total system mass and reducing overall performance. The developed model represents an advancement in RFC system-level optimization by enabling analysis of a broader and more tightly coupled design space than previous considerations. While convergence behavior and computational cost remain challenges, the methods introduced improve solvability and allow inclusion of additional design variables with minimal loss of physical fidelity. However, the numerical results should not be interpreted as definitive design recommendations, as the model includes simplifying assumptions and omits several higher-order effects. Future work should extend this framework by incorporating additional subsystems and loss mechanisms, such as thermal management, parasitic power consumption, and reactant losses, to improve fidelity and ensure more representative design conclusions.

Electrochemistry↗

On the use of genetic algorithm to optimize industrial assets lifecycle management under safety and budget constraints

The purpose of this paper is to describe the method and tool dedicated to optimize investments planning for industrial assets. These investments may either be preventive maintenance tasks, asset enhancements or logistic investments such as spare parts purchases. The two methodological points to investigate in such an issue are: 1. The measure of the profitability of a portfolio of investments 2. The selection and planning of an optimal set of investments 3. The measure of the risk of a portfolio of investments The measure of the profitability of a set of investments in the IPOP tool is synthesised in the Net Present Value indicator. The NPV is the sum of the differences of discounted cash flows (direct costs, forced outages...) between the situations with and without a given investment. These cash flows are calculated through a pseudo-Markov reliability model representing independently the components of the industrial asset and the spare parts inventories. The component model has been widely discussed over the years but the spare part model is a new one based on some approximations that will be discussed. This model, referred as the NPV function, takes for input an investments portfolio and gives its NPV. The second issue is to optimize the NPV. If all investments were independent, this optimization would be an easy calculation, unfortunately there are two sources of dependency. The first one is introduced by the spare part model, as if components are indeed independent in their reliability model, the fact that several components use the same inventory induces a dependency. The second dependency comes from economic, technical or logistic constraints, such as a global maintenance budget limit or a safety requirement limiting the residual risk of failure of a component or group of component, making the aggregation of individual optimum not necessary feasible. The algorithm used to solve such a difficult optimization problem is a genetic algorithm. After a description of the features of the software a test case is presented showing the influence of the optimization algorithm parameters on its efficiency to find an optimal investments planning. (authors)

97 MATHEMATICS AND COMPUTING↗

Genetic Evolution of Shape-Altering Programs for Supersonic Aerodynamics

Two constrained shape optimization problems relevant to aerodynamics are solved by genetic programming, in which a population of computer programs evolves automatically under pressure of fitness-driven reproduction and genetic crossover. Known optimal solutions are recovered using a small, naive set of elementary operations. Effectiveness is improved through use of automatically defined functions, especially when one of them is capable of a variable number of iterations, even though the test problems lack obvious exploitable regularities. An attempt at evolving new elementary operations was only partially successful.

Kennelly, Robert A., Jr.↗

Computationally Efficient Motion Planning Algorithms for Agile Autonomous Vehicles in Cluttered Environments

Fast, real-time motion planning of an agile, autonomous vehicle in a cluttered environment, with many geometrically-fixed obstacles, is a very complex problem, especially because of the vehicle dynamics constraints and resource constrained computational capabilities onboard the vehicle. In this paper, we present computationally-efficient versions of our novel motion planning algorithm called the Spherical Expansion and Sequential Convex Programming (SE–SCP) algorithm. The SE–SCP algorithm first uses a spherical-expansion-based randomized sampling algorithm to explore the workspace. Oncea path is found from the start position to the goal position, the algorithm computes a locally optimal trajectory, within its homotopy class for a desired cost function, by solving a sequence of convex optimization problems. Thus, the SE–SCP algorithm is anytime locally optimal and the trajectory is globally optimal if the number of samples tends to infinity. In this paper, we further enhance the computational efficiency of the SE–SCP algorithm using uni-directional and bi-directional rewiring techniques. We also present a detailed proof of the local optimality characteristics of the new SE–SCP algorithms for aspecial case of vehicle dynamics. Simulation examples involving quadrotor and spacecraft help demonstrate the effectiveness of our new algorithms.

Bandyopadhyay, Saptarshi↗

Optimal Control of the Obstacle Problem in a Perforated Domain

We study the problem of optimally controlling the solution of the obstacle problem in a domain perforated by small periodically distributed holes. The solution is controlled by the choice of a perforated obstacle which is to be chosen in such a fashion that the solution is close to a given profile and the obstacle is not too irregular. We prove existence, uniqueness and stability of an optimal obstacle and derive necessary and sufficient conditions for optimality. When the number of holes increase indefinitely we determine the limit of the sequence of optimal obstacles and solutions. This limit depends strongly on the rate at which the size of the holes shrink.

97 MATHEMATICS AND COMPUTING↗

The computation of optimal control programmes using a modified successive sweep method.

A second-order method for numerically solving control optimization problems has been developed. The method, referred to as the modified sweep method (MSM), differs from the successive sweep method (SSM) proposed by McReynolds and Bryson (1965) in that the conditions for local control optimality are used to determine the control as an explicit function of the state variables and time. The control is eliminated from the problem and the solution to the resulting two-point boundary value problem can be obtained by linear perturbation methods. The modified sweep method proposed here uncouples the perturbation equations for the state variables and the Lagrange multipliers by using a generalized matrix-Riccati transformation of variables. The resulting algorithm for the numerical iteration process is concerned with determining the initial values of a set of Lagrange multipliers rather than correcting a numerical control programme over the entire time interval of interest.

Colunga, D.↗

Shape and Topology Optimization in Stokes Flow with a Phase Field Approach

In this paper we introduce a new formulation for shape optimization problems in fluids in a diffuse interface setting that can in particular handle topological changes. By adding the Ginzburg–Landau energy as a regularization to the objective functional and relaxing the non-permeability outside the fluid region by introducing a porous medium approach we hence obtain a phase field problem where the existence of a minimizer can be guaranteed. This problem is additionally related to a sharp interface problem, where the permeability of the non-fluid region is zero. In both the sharp and the diffuse interface setting we can derive necessary optimality conditions using only the natural regularity of the minimizers. We also pass to the limit in the first order conditions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

pnnl/Pathway_Controlled_Optimization

A method for prediction of cell regulation to maximize cell growth rate while maintaining the solvent capacity of the cell. Prediction is formulated as an optimization problem using a thermodynamic framework that can leverage experimental data. We develop a formulation and variable initialization procedure that allows for computing solutions of the optimization with an interior point method

Central, PNNL Developer↗

Q-OPT:Quantum Optimization Toolkit

SF-2025-003 Quantum computing has the potential to solve classical optimization problems. To bring these algorithms into practical use, a comprehensive, high-performance and user-friendly toolkit is essential. The Q-OPT: Quantum Optimization Toolkit is a collection of software tools designed to support complete end-to-end framework for quantum optimization.

Hovland, Paul [Argonne National Laboratory (ANL), ↗