Search NASA⌕ Search

SEARCH · Search NASA

Results for “Partial 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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Optimal Control Allocation for Distributed Electric Propulsion in A Series/Parallel Partial Hybrid Powertrain

The SUbsonic Single Aft eNgine (SUSAN) Electrofan is a NASA concept transport aircraft representative of technology anticipated for a 2040 entry-into-service date. The powertrain consists of a single thrust-producing geared turbofan engine with generators driving a series/parallel partial hybrid power/propulsion system. The architecture includes 16 underwing contrarotating fans, eight on each side. The distributed fans can be used by the flight control system to augment or replace the rudder function. This paper sets up the optimal control problem of setpoint determination for individual wingfans in the distributed propulsion system, accounting for electrical string efficiencies, saturations, and failures. The solution minimizes power consumption while maintaining thrust and torque on the airframe for maneuvering. Additionally, thrust that would have been lost due to temporary fan speed or power saturation is optimally redistributed to maintain overall desired thrust and torque on the aircraft. A simulation of a coordinated turn utilizing the distributed electric propulsion for yaw rate control in a multiple wingfan failure scenario demonstrates the robustness of the powertrain design to failures and helps define its limitations.

Distributed Electric Propulsion↗
NASA NTRSDate not supplied

Optimal Control Allocation for Distributed Electric Propulsion in A Series/Parallel Partial Hybrid Powertrain

The SUbsonic Single Aft eNgine (SUSAN) Electrofan is a NASA concept transport aircraft representative of technology anticipated for a 2040 entry-into-service date. The powertrain consists of a single thrust-producing geared turbofan engine with generators driving a series/parallel partial hybrid power/propulsion system. The architecture includes 16 underwing contrarotating fans, eight on each side. The distributed fans can be used by the flight control system to augment or replace the rudder function. This paper sets up the optimal control problem of setpoint determination for individual wingfans in the distributed propulsion system, accounting for electrical string efficiencies, saturations, and failures. The solution minimizes power consumption while maintaining thrust and torque on the airframe for maneuvering. Additionally, thrust that would have been lost due to temporary fan speed or power saturation is optimally redistributed to maintain overall desired thrust and torque on the aircraft. A simulation of a coordinated turn utilizing the distributed electric propulsion for yaw rate control in a multiple wingfan failure scenario demonstrates the robustness of the powertrain design to failures and helps define its limitations.

Distributed Electric Propulsion↗
DOE OSTI2025

Assimilating partial observation to enhance feedback control of stochastic dynamical systems

Here, in this paper, we present a novel methodology to tackle feedback optimal control problems in scenarios where the exact state of the controlled process is unknown. It integrates data assimilation techniques and optimal control solvers to manage partial observation of the state process, a common occurrence in practical scenarios. Traditional stochastic optimal control methods assume full state observation, which is often not feasible in real-world fluid dynamics control problems. Our approach underscores the significance of utilizing observational data to inform control policy design. Specifically, we introduce a kernel learning backward stochastic differential equation (SDE) filter to enhance data assimilation efficiency and propose a sample-wise stochastic optimization method within the stochastic maximum principle framework. We demonstrate the efficacy and accuracy of our method in the control of advection-diffusion-reaction flow problem and the Dubins airplane maneuvering problem with model uncertainty.

data driven↗
NASA NTRS1982

Introduction to SIMRAND: Simulation of research and development project

SIMRAND: SIMulation of Research ANd Development Projects is a methodology developed to aid the engineering and management decision process in the selection of the optimal set of systems or tasks to be funded on a research and development project. A project may have a set of systems or tasks under consideration for which the total cost exceeds the allocated budget. Other factors such as personnel and facilities may also enter as constraints. Thus the project's management must select, from among the complete set of systems or tasks under consideration, a partial set that satisfies all project constraints. The SIMRAND methodology uses analytical techniques and probability theory, decision analysis of management science, and computer simulation, in the selection of this optimal partial set. The SIMRAND methodology is truly a management tool. It initially specifies the information that must be generated by the engineers, thus providing information for the management direction of the engineers, and it ranks the alternatives according to the preferences of the decision makers.

Miles, R. F., Jr.↗
DOE OSTI2026

Methanol Partial Oxidation on Cu(111) and PtCu(111) Single-Atom Alloy Surfaces: Effect of Surface Oxygen Coverage on Selectivity

The selective oxidation of methanol to formaldehyde on Cu surfaces is an important and well-studied reaction. However, a systematic analysis of product selectivity as a function of oxygen coverage on Cu(111) and Cu-based single-atom alloys (SAAs) has not been previously reported. In this work, we present a comprehensive investigation of deuterated methanol (CD 3 OH) partial oxidation on Cu(111) and 1% PtCu(111) SAA surfaces as a function of preadsorbed oxygen coverage. Temperature-programmed desorption (TPD) and X-ray photoelectron spectroscopy (XPS) reveal that isolated Pt atoms inhibit the initial surface oxidation of Cu(111) under low oxygen exposures. Despite this difference in oxidation kinetics, the product selectivity remains largely unaffected: on both Cu(111) and PtCu(111), formaldehyde (CD 2 O) is the predominant partial oxidation product over a broad range of oxygen coverages. The selectivity toward formaldehyde peaks at intermediate oxygen coverages (∼0.3 monolayers, ML), indicating the existence of an optimal oxygen loading for partial oxidation. Notably, the similar product selectivities on Cu(111) and PtCu(111) over a range of surface oxygen coverage indicate that Pt single atoms do not significantly alter the reaction pathway or shift the optimal oxygen coverage for formaldehyde formation. Control experiments confirm that Cu(111) is unreactive toward methanol in the absence of oxygen, while PtCu(111) surfaces produce a small amount of formaldehyde even when oxygen is not preadsorbed, indicating that isolated Pt atoms facilitate O−H activation at below 150 K, leading to H 2 desorption, followed by C−D activation at higher temperatures (∼350 K). Density functional theory (DFT)-based calculations show that Pt atoms increase the O 2 dissociation barrier relative to Cu(111), consistent with the observed inhibition of oxidation at low exposures. Overall, this work provides the first detailed selectivity map for methanol oxidation on oxidized Cu(111) and PtCu(111) SAA surfaces. By linking classical mechanistic insights such as methoxy- and formate-mediated pathways with single-atom alloy catalyst design, this work demonstrates that while Pt substitution modulates the oxidation kinetics and oxygen binding, the overall selectivity toward formaldehyde is governed primarily by oxygen coverage. These findings underscore the potential of isolated dopants to tune surface oxidation behavior without compromising the intrinsic partial oxidation selectivity of copper-based catalysts.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Lasing in 15 atm CO 2 cell optically pumped by a Fe:ZnSe laser

10 µm lasing is studied in a compact CO 2 -He cell pressurized up to 15 atm when optically pumped by a ∼50 mJ Fe:ZnSe laser tunable around 4.3 µm. The optimal pump wavelength and partial pressure of CO 2 for generating 10 µm pulses are found to be ∼4.4 µm and 0.75 atm, respectively. Without cavity optimization, the optical-to-optical conversion efficiency reached ∼10% at a total pressure of 7 atm. The gain lifetime is measured to be ∼1 µs at pressures above 10 atm, indicating the feasibility of using high-pressure optically pumped CO 2 for the efficient amplification of picosecond 10 µm pulses.

Tovey, Dana↗
DOE OSTI2025

A Scalable Interior‐Point Gauss–Newton Method for PDE‐Constrained Optimization With Bound Constraints

Here, we present a scalable approach to solve a class of partial differential equation (PDE)‐constrained optimization problems with bound constraints. This approach utilizes a robust full‐space interior‐point (IP)‐Gauss–Newton optimization method. To cope with the poorly‐conditioned IP‐Gauss–Newton saddle‐point linear systems that need to be solved approximately, once per optimization step, we propose two spectrally related preconditioners. These preconditioners leverage the limited informativeness of data in regularized PDE‐constrained optimization problems. A block Gauss–Seidel preconditioner is proposed for the GMRES‐based solution of the IP‐Gauss–Newton linear systems. It is shown, for a large‐class of PDE‐ and bound‐constrained optimization problems, that the spectrum of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix is asymptotically independent of discretization and is not impacted by the ill‐conditioning that notoriously plagues interior‐point methods. We exploit symmetry of the IP‐Gauss–Newton linear systems and propose a regularization and log‐barrier Hessian preconditioner for the preconditioned conjugate gradient (PCG)‐based solution of the equivalent IP‐Gauss–Newton–Schur complement linear systems. The eigenvalues of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix, that are not equal to one, are identical to the eigenvalues of the regularization and log‐barrier Hessian preconditioned Schur complement matrix. The scalability of the approach is demonstrated on two example problems. The numerical solution of these optimization problems is shown to require a discretization independent number of IP‐Gauss–Newton linear solves. Furthermore, the linear systems are solved in a discretization and IP ill‐conditioning independent number of preconditioned Krylov subspace iterations. The parallel scalability of the preconditioner, achieved via algebraic multigrid component solvers when applicable, and the aforementioned algorithmic scalability permits a parallel scalable means to compute solutions of a large class of PDE‐ and bound‐constrained problems.

PDE-constrained optimization↗
NASA NTRS1972

NAMER: A FORTRAN 4 program for use in optimizing designs of two-level factorial experiments given partial prior information

Under certain specified conditions, the Bayes procedure for designing two-level fractional factorial experiments is that which maximizes the expected utility over all possible choices of parameter-estimator matchings, physical-design variable matchings, defining parameter groups, and sequences of telescoping groups. NAMER computes the utility of all possible matchings of physical variables to design variables and parameters to estimators for a specified choice of defining parameter group or groups. The matching yielding the maximum expected utility is indicated, and detailed information is provided about the optimal matchings and utilities. Complete documentation is given; and an example illustrates input, output, and usage.

Sidik, S. M.↗
DOE OSTI2026

Robust Optimal Experimental Design of Infinite-Dimensional Bayesian Nonlinear Inverse Problems

Abstract. We consider robust optimal experimental design (ROED) for nonlinear Bayesian inverse problems governed by partial differential equations (PDEs). An optimal design is one that maximizes some utility quantifying the quality of the solution of an inverse problem. However, the optimal design is dependent on elements of the inverse problem such as the simulation model, the prior, or the measurement error model. ROED aims to produce an optimal design that is aware of the additional uncertainties encoded in the inverse problem and remains optimal even after variations in them. We follow a worst-case scenario approach to develop a new framework for robust optimal design of nonlinear Bayesian inverse problems. The proposed framework (a) is scalable and designed for infinite-dimensional Bayesian nonlinear inverse problems constrained by PDEs; (b) develops efficient approximations of the utility, namely the expected information gain; (c) employs eigenvalue sensitivity techniques to develop analytical forms and efficient evaluation methods of the gradient of the utility with respect to the uncertainties against which we wish to be robust; and (d) employs a probabilistic optimization paradigm that properly defines and efficiently solves the resulting combinatorial max-min optimization problem. The effectiveness of the proposed approach is illustrated for optimal sensor placement problem in an inverse problem governed by an elliptic PDE.

Chowdhary, Abhijit↗
NASA NTRS2024

Optimal Control Allocation for Distributed Electric Propulsion in a Series/Parallel Partial Hybrid Powertrain

The SUbsonic Single Aft eNgine (SUSAN) Electrofan is a NASA concept jet transport aircraft with a 2040 entry-into-service date. It utilizes electrified aircraft propulsion (EAP) to enable propulsive and aerodynamic benefits to reduce fuel usage, emissions, and cost. The powertrain consists of a single thrust producing, boundary layer-ingesting (BLI) turbofan gas turbine engine (GTE) with generators driving a series/parallel partial hybrid EAP system. The architecture includes 16 underwing contrarotating BLI fans, eight on each side, in a mailslot configuration. The 16 fans run on power extracted from the GTE through four 5 MW motor/generators connected to the Low-Pressure Spool, and a single 1 MW motor/generator on the High-Pressure Spool. The distributed fans can be used by the flight control to augment or replace the rudder function. At top of climb, the power extracted from the GTE for the fans is boosted by batteries. The design provides redundancy, and the capacity for boost means that the fans are designed to be able to provide additional thrust when necessary. These features can be leveraged in case of a fan or generator failure. This paper sets up the optimal control problem of setpoint determination for individual fans in the distributed propulsion system, accounting for electrical string efficiencies, saturations, and failures. The solution minimizes power consumption while maintaining thrust and torque on the airframe for maneuvering. Additionally, thrust that would have been lost due to temporary fan speed or power saturation is optimally redistributed to maintain overall desired thrust and torque on the aircraft. The power extraction range constraints derive from the gas turbine engine design and the small amount of variation allowed for the engine to maintain operability. The problem formulation allows the number and location of fan failures for which the thrust and torque can be maintained to be investigated, which has implications for certification. Simulations of a coordinated turn utilizing the distributed electric propulsion for yaw rate control under different failure scenarios demonstrate the robustness of the powertrain design to failures and help define its limitations.

Distributed Electric Propulsion↗
NASA NTRS1995

Pseudo-time methods for constrained optimization problems governed by PDE

In this paper we present a novel method for solving optimization problems governed by partial differential equations. Existing methods are gradient information in marching toward the minimum, where the constrained PDE is solved once (sometimes only approximately) per each optimization step. Such methods can be viewed as a marching techniques on the intersection of the state and costate hypersurfaces while improving the residuals of the design equations per each iteration. In contrast, the method presented here march on the design hypersurface and at each iteration improve the residuals of the state and costate equations. The new method is usually much less expensive per iteration step since, in most problems of practical interest, the design equation involves much less unknowns that that of either the state or costate equations. Convergence is shown using energy estimates for the evolution equations governing the iterative process. Numerical tests show that the new method allows the solution of the optimization problem in a cost of solving the analysis problems just a few times, independent of the number of design parameters. The method can be applied using single grid iterations as well as with multigrid solvers.

Taasan, Shlomo↗
NASA NTRS1985

An optimized rotation-axis model-following controller for STS orbiter attitude maneuvers

This paper describes a new controller for automatic attitude maneuvers of the Space Shuttle Orbiter. The controller incorporates a new solution algorithm for partially linearized, fuel-optimal maneuvers for RCS jet controlled spacecraft. These solutions provide model trajectories and jet commands that are easily tracked using a feed-forward, feedback controller structure. The result is a substantial performance improvement over the current Orbiter attitude maneuver controller. The paper discusses optimal maneuvers for this type of vehicle, giving detail of the solution algorithm. Closed-loop controller design and implementation is discussed. Detailed performance results are presented.

Redding, D. C.↗
DOE OSTI2022

Binary optimal control by trust-region steepest descent

Abstract We present a trust-region steepest descent method for dynamic optimal control problems with binary-valued integrable control functions. Our method interprets the control function as an indicator function of a measurable set and makes set-valued adjustments derived from the sublevel sets of a topological gradient function. By combining this type of update with a trust-region framework, we are able to show by theoretical argument that our method achieves asymptotic stationarity despite possible discretization errors and truncation errors during step determination. To demonstrate the practical applicability of our method, we solve two optimal control problems constrained by ordinary and partial differential equations, respectively, and one topological optimization problem.

97 MATHEMATICS AND COMPUTING↗
NASA NTRSDate not supplied

Development of Lunar EVA Fitness for Duty Standards for Aerobic Capacity and Muscle Strength

Current aerobic Fitness Standards for NASA astronauts are based on peak aerobic capacity (i.e. VO2peak (ml/kg/min))and are related to aerobic metabolic requirements for Extravehicular Activity (EVA) in microgravity and in 1 g operational environments. Standards for muscle strength need to be developed. Fitness for Duty Standards for partial gravity EVA (e.g. 1/6 g EVA on the Lunar surface) are not developed in terms of aerobic fitness and muscle strength. Defining thresholds for aerobic fitness and muscle strength will help to provide guidance in determining recommendations for optimal fitness necessary for partial g EVA success.

D Frisco↗
DOE OSTI2023

An inexact semismooth Newton method with application to adaptive randomized sketching for dynamic optimization

In many applications, one can only access the inexact gradients and inexact hessian times vector products. Thus it is essential to consider algorithms that can handle such inexact quantities with a guaranteed convergence to solution. An inexact adaptive and provably convergent semismooth Newton method is considered to solve constrained optimization problems. In particular, dynamic optimization problems, which are known to be highly expensive, are the focus. A memory efficient semismooth Newton algorithm is introduced for these problems. The source of efficiency and inexactness is the randomized matrix sketching. Further, applications to optimization problems constrained by partial differential equations are also considered.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A primal–dual algorithm for risk minimization

In this paper, we develop an algorithm to efficiently solve risk-averse optimization problems posed in reflexive Banach space. Such problems often arise in many practical applications as, e.g., optimization problems constrained by partial differential equations with uncertain inputs. Unfortunately, for many popular risk models including the coherent risk measures, the resulting risk-averse objective function is nonsmooth. Here, this lack of differentiability complicates the numerical approximation of the objective function as well as the numerical solution of the optimization problem. To address these challenges, we propose a primal–dual algorithm for solving large-scale nonsmooth risk-averse optimization problems. This algorithm is motivated by the classical method of multipliers and by epigraphical regularization of risk measures. As a result, the algorithm solves a sequence of smooth optimization problems using derivative-based methods. We prove convergence of the algorithm even when the subproblems are solved inexactly and conclude with numerical examples demonstrating the efficiency of our method.

97 MATHEMATICS AND COMPUTING↗