SEARCH · Search NASA

Results for “constrained 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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 325 records · Page 18

All sources NASA NTRS DOE OSTI

NASA NTRS1980

OPDOT: A computer program for the optimum preliminary design of a transport airplane

A description of a computer program, OPDOT, for the optimal preliminary design of transport aircraft is given. OPDOT utilizes constrained parameter optimization to minimize a performance index (e.g., direct operating cost per block hour) while satisfying operating constraints. The approach in OPDOT uses geometric descriptors as independent design variables. The independent design variables are systematically iterated to find the optimum design. The technical development of the program is provided and a program listing with sample input and output are utilized to illustrate its use in preliminary design. It is not meant to be a user's guide, but rather a description of a useful design tool developed for studying the application of new technologies to transport airplanes.

Sliwa, S. M.↗

NASA NTRS1985

An Integrated Control and Minimum Mass Structural Optimization Algorithm for Large Space Structures

A new approach is discussed for solving dual structural control optimization problems for high-order flexible space structures, where reduced-order structural models are employed and minimum mass designs are sought. For a given initial structural design, a quadratic control cost is minimized subject to a constant-mass constraint. The sensitivity of the optimal control cost with respect to the structural design variables is then determined and used to obtain successive structural redesigns, using a constrained gradient optimization algorithm. This process is repeated until the constrained control cost sensitivity becomes negligible. The minimum mass design is obtained by solving a sequence of neighboring optimal constant mass designs, where the sequence of optimal performance indices has a minimum at the optimal minimum mass design. A numerical example is presented which demonstrates that this new approach effectively addresses the problem of dual optimization for potentially very high-order structures.

Messac, A.↗

DOE OSTI2025

Nonlinear Optimal Control of Electron Dynamics Within Hartree-Fock Theory

Consider the problem of determining the optimal applied electric field to drive a molecule from an initial state to a desired target state. For even moderately sized molecules, solving this problem directly using the exact equations of motion—the time-dependent Schrödinger equation (TDSE)—is numerically intractable. Here, we present a solution of this problem within time-dependent Hartree-Fock (TDHF) theory, a mean field approximation of the TDSE. Optimality is defined in terms of minimizing the total control effort while maximizing the overlap between desired and achieved target states. We frame this problem as an optimization problem constrained by the nonlinear TDHF equations; we solve it using trust region optimization with gradients computed via a custom-built adjoint state method. For three molecular systems, we show that with very small neural network parametrizations of the control, our method yields solutions that achieve desired targets within acceptable constraints and tolerances.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1991

Wing design code using three-dimensional Euler equations and optimization

This paper describes a new wing design code which is based on the Euler equations and a constrained numerical optimization technique. The geometry modification is based on a set of fundamental modes define on the unit interval. A design example involving a high speed civil transport wing is presented to demonstrate the usefulness of the design code. It is shown that the use of an Euler solver in the direct numerical optimization procedures is affordable on the current generation of supercomputers.

Chang, I-Chung↗

NASA NTRS1994

Optimizations on Designing High-Resolution Finite-Difference Schemes

We describe a general optimization procedure for both maximizing the resolution characteristics of existing finite differencing schemes as well as designing finite difference schemes that will meet the error tolerance requirements of numerical solutions. The procedure is based on an optimization process. This is a generalization of the compact scheme introduced by Lele in which the resolution is improved for single, one-dimensional spatial derivative, whereas in the present approach the complete scheme, after spatial and temporal discretizations, is optimized on a range of parameters of the scheme and the governing equations. The approach is to linearize and Fourier analyze the discretized equations to check the resolving power of the scheme for various wave number ranges in the solution and optimize the resolution to satisfy the requirements of the problem. This represents a constrained nonlinear optimization problem which can be solved to obtain the nodal weights of discretization. An objective function is defined in the parametric space of wave numbers, Courant number, Mach number and other quantities of interest. Typical criterion for defining the objective function include the maximization of the resolution of high wave numbers for acoustic and electromagnetic wave propagations and turbulence calculations. The procedure is being tested on off-design conditions of non-uniform mesh, non-periodic boundary conditions, and non-constant wave speeds for scalar and system of equations. This includes the solution of wave equations and Euler equations using a conventional scheme with and without optimization and the design of an optimum scheme for the specified error tolerance.

Liu, Yen↗

NASA NTRS1985

On optimal strategies in event-constrained differential games

Combat games are formulated as zero-sum differential games with unilateral event constraints. An interior penalty function approach is employed to approximate optimal strategies for the players. The method is very attractive computationally and possesses suitable approximation and convergence properties.

Heymann, M.↗

NASA NTRS1994

Optimization of Wing-Body Configurations by the Euler Equations

This paper describes a new wing-body design procedure which is based on the Euler equations and a constrained numerical optimization technique. The geometry modification is based on a set of fundamental modes defined on the unit interval. A design example involving a generic wing-body model is presented to demonstrate the usefulness of the design program. It is shown that the use of an Euler solver coupled with a direct numerical optimization procedure is affordable on the current generation of supercomputers.

Chang, I.-Chung↗

DOE OSTI2025

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↗

NASA NTRS1980

A new method for optimizing multiple flyby trajectories

A new procedure has been developed which minimizes total impulsive Delta V for multiple flyby trajectories with constraints on flyby parameters and maneuver times. The method involves solving a bounds-constrained parameter optimization problem with a Newton algorithm utilizing analytic first and second derivatives. Each trajectory segment connecting consecutive maneuver points is found by first targeting from the preceding maneuver point to the parameters of the upcoming flyby and then propagating the resulting trajectory to the next maneuver point. Multi-conic techniques are used for trajectory propagation and for computation of the state transition matrix. This procedure has successfully optimized Galileo satellite tours containing up to 11 flybys.

Damario, L. A.↗

DOE OSTI2025

Constrained or unconstrained? Neural-network-based equation discovery from data

Throughout many fields, practitioners often rely on differential equations to model systems. Yet, for many applications, the theoretical derivation of such equations and/or the accurate resolution of their solutions may be intractable. Instead, recently developed methods, including those based on parameter estimation, operator subset selection, and neural networks, allow for the data-driven discovery of both ordinary and partial differential equations (PDEs), on a spectrum of interpretability. The success of these strategies is often contingent upon the correct identification of representative equations from noisy observations of state variables and, as importantly and intertwined with that, the mathematical strategies utilized to enforce those equations. Specifically, the latter has been commonly addressed via unconstrained optimization strategies. Representing the PDE as a neural network, we propose to discover the PDE (or the associated operator) by solving a constrained optimization problem and using an intermediate state representation similar to a physics-informed neural network (PINN). The objective function of this constrained optimization problem promotes matching the data, while the constraints require that the discovered PDE is satisfied at a number of spatial collocation points. We present a penalty method and a widely used trust-region barrier method to solve this constrained optimization problem, and we compare these methods on numerical examples. Our results on several example problems demonstrate that the latter constrained method outperforms the penalty method, particularly for higher noise levels or fewer collocation points. This work motivates further exploration into using sophisticated constrained optimization methods in scientific machine learning, as opposed to their commonly used, penalty-method or unconstrained counterparts. For both of these methods, we solve these discovered neural network PDEs with classical methods, such as finite difference methods, as opposed to PINNs-type methods relying on automatic differentiation. Here, we briefly highlight how simultaneously fitting the data while discovering the PDE improves the robustness to noise and other small, yet crucial, implementation details.

Data-driven discovery↗

DOE OSTI2024

Gains in operational flexibility, safety margins, and cost efficiencies via integrated Plant Reload Optimization platform

The U.S. Department of Energy Light Water Reactor Sustainability Program Risk-Informed Systems Analysis Pathway Plant Reload Optimization Project aims to develop an integrated, comprehensive framework offering an all-in-one solution for reload evaluations with a special focus on optimizing core design. Optimizing the fuel loading pattern is one of the most important considerations in reducing the amount of new fuel used in the core. Due to thousands of possible core configuration options, finding optimal solutions is an unachievable task for a human. The Plant ReLoad Optimization platform, which supports artificial-intelligence-based reactor core designing, is now fully capable of handling realistic problems. The Plant ReLoad Optimization platform development project aims to build a reactor core design tool that includes reactor safety and fuel performance analyses and uses artificial intelligence to support the optimization of core design solutions. The NSGA-II (Non-dominated Sorting Genetic Algorithm II) optimizer was developed and tested within RAVEN (Risk Analysis and Virtual ENvironment) to handle many constraints by using an augmented objectives methodology. The demonstration was performed with constrained multiobjective optimization of a 17 × 17 pressurized-water reactor core loading patterns to minimize fuel cost and maximize fuel cycle length.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

DOE OSTI2024

A safe reinforcement learning algorithm for supervisory control of power plants

Traditional control theory-based methods require tailored engineering for each system and constant fine-tuning. In power plant control, one often needs to obtain a precise representation of the system dynamics and carefully design the control scheme accordingly. Model-free Reinforcement learning (RL) has emerged as a promising solution for control tasks due to its ability to learn from trial-and-error interactions with the environment. It eliminates the need for explicitly modeling the environment’s dynamics, which is potentially inaccurate. However, the direct imposition of state constraints in power plant control raises challenges for standard RL methods. To address this, we propose a chance-constrained RL algorithm based on Proximal Policy Optimization for supervisory control. Our method employs Lagrangian relaxation to convert the constrained optimization problem into an unconstrained objective, where trainable Lagrange multipliers enforce the state constraints. In conclusion, our approach achieves the smallest distance of violation and violation rate in a load-follow maneuver for an advanced Nuclear Power Plant design.

constrained optimization↗

NASA NTRS2016

Global Optimization of Low-Thrust Interplanetary Trajectories Subject to Operational Constraints

Low-thrust interplanetary space missions are highly complex and there can be many locally optimal solutions. While several techniques exist to search for globally optimal solutions to low-thrust trajectory design problems, they are typically limited to unconstrained trajectories. The operational design community in turn has largely avoided using such techniques and has primarily focused on accurate constrained local optimization combined with grid searches and intuitive design processes at the expense of efficient exploration of the global design space. This work is an attempt to bridge the gap between the global optimization and operational design communities by presenting a mathematical framework for global optimization of low-thrust trajectories subject to complex constraints including the targeting of planetary landing sites, a solar range constraint to simplify the thermal design of the spacecraft, and a real-world multi-thruster electric propulsion system that must switch thrusters on and off as available power changes over the course of a mission.

Design↗

NASA NTRS2016

Integrated Medical Model (IMM) Optimization Version 4.0 Functional Improvements

The IMMs ability to assess mission outcome risk levels relative to available resources provides a unique capability to provide guidance on optimal operational medical kit and vehicle resources. Post-processing optimization allows IMM to optimize essential resources to improve a specific model outcome such as maximization of the Crew Health Index (CHI), or minimization of the probability of evacuation (EVAC) or the loss of crew life (LOCL). Mass and or volume constrain the optimized resource set. The IMMs probabilistic simulation uses input data on one hundred medical conditions to simulate medical events that may occur in spaceflight, the resources required to treat those events, and the resulting impact to the mission based on specific crew and mission characteristics. Because IMM version 4.0 provides for partial treatment for medical events, IMM Optimization 4.0 scores resources at the individual resource unit increment level as opposed to the full condition-specific treatment set level, as done in version 3.0. This allows the inclusion of as many resources as possible in the event that an entire set of resources called out for treatment cannot satisfy the constraints. IMM Optimization version 4.0 adds capabilities that increase efficiency by creating multiple resource sets based on differing constraints and priorities, CHI, EVAC, or LOCL. It also provides sets of resources that improve mission-related IMM v4.0 outputs with improved performance compared to the prior optimization. The new optimization represents much improved fidelity that will improve the utility of the IMM 4.0 for decision support.

risk assessment↗

NASA NTRS1990

Optimization of linear, controlled structures

An approach to the integrated design of linear controlled structures, which is being investigated as part of NASA's controlled structures interaction (CSI) methodology development program, is presented. The approach is integrated in the sense that the structure and its controller are simultaneously designed. The design methodology uses constrained nonlinear optimization procedures based on analytically obtained gradients of the structural responses. Design of the controller is based on the so-called Q-parameterization theory, which parameterizes all closed-loop input/output maps achievable with stabiizing linear controllers. Very general objective and constraint functions are possible, and structural shape can be included in the design variables. This method has been partially implemented and demonstrated; early findings are reported.

Hunziker, K. Scott↗

NASA NTRSDate not supplied

Strategic Planning with Unscented Optimal Guidance for Urban Air Mobility

This study proposes a strategic trajectory planning framework to support development of Urban Air Mobility (UAM) traffic networks and optimization of UAM aircraft trajectories that are robust to uncertain wind fields. The development of UAM traffic networks considers static aviation constraints and dynamic weather constraints in urban airspace and the connections to ground transportation networks for preliminary selection of feasible time-optimal routes. The trajectory optimization of UAM aircraft utilizes an unscented optimal guidance approach to generate cost-optimal trajectories constrained on the selected sigma values of probability distribution of uncertain wind fields while ensuring that the end-point constraints are met for reducing wind-induced trajectory uncertainty. Unscented guidance commands are assessed based on trajectory perturbations at subsequent end-points in various wind fields by conducting Monte Carlo simulations.An example of wind-optimal UAM corridor and the associated trajectory-based operation volume is created utilizing the perturbations of the unscented trajectories for preliminary assessment of required aircraft separation minima without knowledge of aircraft navigation performance.

Strategic Planning↗

NASA NTRS2006

Scheduling Aircraft Landings under Constrained Position Shifting

Optimal scheduling of airport runway operations can play an important role in improving the safety and efficiency of the National Airspace System (NAS). Methods that compute the optimal landing sequence and landing times of aircraft must accommodate practical issues that affect the implementation of the schedule. One such practical consideration, known as Constrained Position Shifting (CPS), is the restriction that each aircraft must land within a pre-specified number of positions of its place in the First-Come-First-Served (FCFS) sequence. We consider the problem of scheduling landings of aircraft in a CPS environment in order to maximize runway throughput (minimize the completion time of the landing sequence), subject to operational constraints such as FAA-specified minimum inter-arrival spacing restrictions, precedence relationships among aircraft that arise either from airline preferences or air traffic control procedures that prevent overtaking, and time windows (representing possible control actions) during which each aircraft landing can occur. We present a Dynamic Programming-based approach that scales linearly in the number of aircraft, and describe our computational experience with a prototype implementation on realistic data for Denver International Airport.

Balakrishnan, Hamsa↗

DOE OSTI2025

Domain Decomposition for Integer Optimal Control with Total Variation Regularization

Total variation integer optimal control problems admit solutions and necessary optimality conditions via geometric variational analysis. In spite of the existence of said solutions, algorithms which solve the discretized objective suffer from high numerical cost associated with the combinatorial nature of integer programming. Hence, such methods are often limited to small and medium-sized problems. We propose a globally convergent, coordinate descent–inspired algorithm that allows tractable subproblem solutions restricted to a partition of the domain. Our decomposition method solves relatively small trust-region subproblems that modify the control variable on a subdomain only. Given nontrivial subdomain overlap, we prove that a global first-order necessary optimality condition is equivalent to a first-order necessary optimality condition per subdomain. We additionally show that a sufficient decrease is achieved on a single subdomain by way of a trust-region subproblem solver using geometric measure–theoretic arguments, which we integrate with a greedy patch selection to prove convergence of our algorithm. In conclusion, we demonstrate the practicality of our algorithm on a benchmark large-scale, PDE-constrained integer optimal control problem and find that our method is faster than the state of the art.

domain decomposition↗