Search NASA⌕ Search

SEARCH · Search NASA

Results for “classical optimizers”

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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
NASA NTRS1977

Optimal solar sail planetocentric trajectories

The analysis of solar sail planetocentric optimal trajectory problem is described. A computer program was produced to calculate optimal trajectories for a limited performance analysis. A square sail model is included and some consideration is given to a heliogyro sail model. Orbit to a subescape point and orbit to orbit transfer are considered. Trajectories about the four inner planets can be calculated and shadowing, oblateness, and solar motion may be included. Equinoctial orbital elements are used to avoid the classical singularities, and the method of averaging is applied to increase computational speed. Solution of the two-point boundary value problem which arises from the application of optimization theory is accomplished with a Newton procedure. Time optimal trajectories are emphasized, but a penalty function has been considered to prevent trajectories which intersect a planet's surface.

Sackett, L. L.↗
DOE OSTI2025

Comparing three generations of D-Wave quantum annealers for minor embedded combinatorial optimization problems

Abstract Quantum annealing (QA) is a novel type of analog computation that aims to use quantum mechanical fluctuations to search for optimal solutions of Ising problems. QA in the transverse Ising model, implemented on D-Wave quantum processing units, are available as cloud computing resources. In this study we report concise benchmarks across three generations of D-Wave quantum annealers, consisting of four different devices, for the NP-hard discrete combinatorial optimization problems unweighted maximum clique and unweighted maximum cut on random graphs. The Ising, or equivalently quadratic unconstrained binary optimization, formulation of these problems do not require auxiliary variables for order reduction, and their overall structure and weights are not highly variable, which makes these problems simple test cases to understand the sampling capability of current D-Wave quantum annealers. All-to-all minor embeddings of size 52, with relatively uniform chain lengths, are used for a direct comparison across the Chimera, Pegasus, and Zephyr device topologies. A grid-search over annealing times and the minor embedding chain strengths is performed in order to determine the level of reasonable performance for each device and problem type. Experiment metrics that are reported are approximation ratios for non-broken chain samples, chain break proportions, and time-to-solution for the maximum clique problem instances. How fairly the quantum annealers sample optimal maximum cliques, for instances which contain multiple maximum cliques, is quantified using entropy of the measured ground state distributions. The newest generation of quantum annealing hardware, which has a Zephyr hardware connectivity, performed the best overall with respect to approximation ratios and chain break frequencies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1984

Experiences performing conceptual design optimization of transport aircraft

Optimum Preliminary Design of Transports (OPDOT) is a computer program developed at NASA Langley Research Center for evaluating the impact of new technologies upon transport aircraft. For example, it provides the capability to look at configurations which have been resized to take advantage of active controls and provide and indication of economic sensitivity to its use. Although this tool returns a conceptual design configuration as its output, it does not have the accuracy, in absolute terms, to yield satisfactory point designs for immediate use by aircraft manufacturers. However, the relative accuracy of comparing OPDOT-generated configurations while varying technological assumptions has been demonstrated to be highly reliable. Hence, OPDOT is a useful tool for ascertaining the synergistic benefits of active controls, composite structures, improved engine efficiencies and other advanced technological developments. The approach used by OPDOT is a direct numerical optimization of an economic performance index. A set of independent design variables is iterated, given a set of design constants and data. The design variables include wing geometry, tail geometry, fuselage size, and engine size. This iteration continues until the optimum performance index is found which satisfies all the constraint functions. The analyst interacts with OPDOT by varying the input parameters to either the constraint functions or the design constants. Note that the optimization of aircraft geometry parameters is equivalent to finding the ideal aircraft size, but with more degrees of freedom than classical design procedures will allow.

Arbuckle, P. D.↗
DOE OSTI2024

Qudit Gate Decomposition Dependence for Lattice Gauge Theories

In this work, we investigate the effect of decomposition basis on primitive qudit gates on superconducting radio-frequency cavity-based quantum computers with applications to lattice gauge theory. Three approaches are tested: SNAP & Displacement gates, ECD & single-qubit rotations $R(\theta,\phi)$, and optimal pulse control. For all three decompositions, implementing the necessary sequence of rotations concurrently rather then sequentially can reduce the primitive gate run time. The number of blocks required for the faster ECD &$R_p(\theta)$ is found to scale $\mathcal{O}(d^2)$, while slower SNAP & Displacement set scales at worst $\mathcal{O}(d)$. For qudits with $d<10$, the resulting gate times for the decompositions is similar, but strongly-dependent on experimental design choices. Optimal control can outperforms both decompositions for small $d$ by a factor of 2-12 at the cost of higher classical resources. Lastly, we find that SNAP & Displacement are slightly more robust to a simplified noise model.

Kürkçüoglu, Doga Murat↗
NASA NTRS2009

Application of Reduced Order Transonic Aerodynamic Influence Coefficient Matrix for Design Optimization

Supporting the Aeronautics Research Mission Directorate guidelines, the National Aeronautics and Space Administration [NASA] Dryden Flight Research Center is developing a multidisciplinary design, analysis, and optimization [MDAO] tool. This tool will leverage existing tools and practices, and allow the easy integration and adoption of new state-of-the-art software. Today s modern aircraft designs in transonic speed are a challenging task due to the computation time required for the unsteady aeroelastic analysis using a Computational Fluid Dynamics [CFD] code. Design approaches in this speed regime are mainly based on the manual trial and error. Because of the time required for unsteady CFD computations in time-domain, this will considerably slow down the whole design process. These analyses are usually performed repeatedly to optimize the final design. As a result, there is considerable motivation to be able to perform aeroelastic calculations more quickly and inexpensively. This paper will describe the development of unsteady transonic aeroelastic design methodology for design optimization using reduced modeling method and unsteady aerodynamic approximation. The method requires the unsteady transonic aerodynamics be represented in the frequency or Laplace domain. Dynamically linear assumption is used for creating Aerodynamic Influence Coefficient [AIC] matrices in transonic speed regime. Unsteady CFD computations are needed for the important columns of an AIC matrix which corresponded to the primary modes for the flutter. Order reduction techniques, such as Guyan reduction and improved reduction system, are used to reduce the size of problem transonic flutter can be found by the classic methods, such as Rational function approximation, p-k, p, root-locus etc. Such a methodology could be incorporated into MDAO tool for design optimization at a reasonable computational cost. The proposed technique is verified using the Aerostructures Test Wing 2 actually designed, built, and tested at NASA Dryden Flight Research Center. The results from the full order model and the approximate reduced order model are analyzed and compared.

Pak, Chan-gi↗
NASA NTRS1995

Repeating sources of classical gamma-ray bursts

From an analysis of the first catalog of the Burst and Transient Source Experiment (BATSE) experiment (Fishman et al. 1993, 1994a) on the Compton Gamma Ray Observatory (CGRO), we find an excessive number of pairs of gamma-ray bursts which are clustered in both a space and time . The angular separation between the two bursts in each pair is less than their positional uncertainties, and the interval between their occurrence times is within several days. Optimizing the signal, we find that the probability of observing such a clustered excess froma Poisson ensemble is approximately 2 x 10(exp -5). We suggest that these bursts arise from repeating sources. A detailed study of the most prolific source, GBS 0855-00, is presented in a separate paper (Wang & Lingenfelter 1993a, b). Unlike most of the 'soft' gamma-ray repeaters, these repeating bursts have relatively hard spectra, complex light curves, and widely varying durations, that are indistinguishable from classical gamma-ray bursts. Although the significance of the clustered excess was optimized a posteriori, because it depends on temporal and spatial bin sized that could not be defined a priori, we can use the optimizations from the first catalog to test subsequent BATSE data sets. Unfortunately, the failure of the on-board tape recorders during the second catalog period seriously reduced the number of accurately positioned bursts (Fishman et al. 1994b), so that we can neither confirm, nor refute, the predicted repitition in that sample, and we must await the results of the third catalog.

Wang, V. C.↗
DOE OSTI2026

A Decomposition-Based Learn-To-Optimize Approach with Feasibility Layer Assistance for Sub-Hourly Unit Commitment

Sub-hourly unit commitment (UC) with 15-min intervals is gaining significant attention as a way to respond rapidly to the fluctuations in electricity supply and demand introduced by renewable resources. However, the increased temporal resolution and complex inter-temporal dependencies pose substantial computational challenges for traditional optimization methods. To this end, this paper explores a decomposition-based learn-to-optimize approach. Building on recent advances in machine learning, our method revisits the long- overlooked Lagrangian relaxation framework, which is a classical decomposition technique that enables tractable subproblem solving. These smaller subproblems are inherently well-suited for machine learning, as their reduced dimensionality and structural regularity allow predictive models to efficiently learn and generalize solution patterns. We thus propose a generic predictive model, which embeds Gated Recurrent Units (GRUs) and Attention in the encoder-decoder structure, and integrate a rule-based feasibility layer to capture temporal dependencies, reduce training effort, and improve feasibility w.r.t. unit-level constraints. Our method has been validated on the IEEE 118-bus system, demonstrating promising performance in solving sub-hourly UC problems efficiently and feasibly.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Comparative Analysis via CFD Simulation on the Impact of Graphite Anode Morphologies on the Discharge of a Lithium-Ion Battery

The morphology of electrode materials plays a crucial role in determining the performance of lithium-ion batteries. Traditional computational models often simplify graphite flakes as uniformly sized spheres, which limits their predictive accuracy. In this study, we present a computational workflow that overcomes these limitations by incorporating a more realistic representation of graphite morphologies. This workflow is designed to be flexible and reproducible, enabling efficient evaluation of electrochemical performance across diverse material structures. By exploring different graphite morphologies, our approach accelerates the optimization of material preparation techniques and processing conditions. Our findings reveal that incorporating greater morphological complexity leads to significant deviations from classical model predictions. Instead, our refined model offers a more accurate representation of battery discharge behavior, closely aligning with experimental data. This improvement underscores the importance of detailed morphological descriptions in advancing battery design and performance assessments. To promote accessibility and reproducibility, we provide the developed code for seamless integration with the COMSOL API, allowing researchers to implement and adapt it easily. This computational framework serves as a valuable tool for investigating the impact of graphite morphology on battery performance, bridging the gap between theoretical modeling and experimental validation to enhance lithium-ion battery technology.

25 ENERGY STORAGE↗
NASA NTRS1972

Prediction and analysis of human performance in a VTOL hover task

An optimal control model is used to predict pilot performance in a series of longitudinal hovering tasks. Configurational changes are considered that alter significantly the system response to both control and disturbance inputs. Model predictions of mean-squared performance are compared with measurements obtained in an independent experimental study of the task. In addition, the optimal control model is used to predict describing functions that correspond to the loop closing pilot transfer functions frequently employed in classical multiloop manual control analyses.

Baron, S.↗
NASA NTRS1973

A vehicle scheduling algorithm using non-serial discrete dynamic programming with space shuttle applications

Description of the development and operation of a vehicle-scheduling algorithm which has applications to the NASA problem of assigning payloads to space delivery vehicles. The algorithm is based on a discrete, integer-valued, nonserial, dynamic-programming solution to the classical problem of developing resource utilization plans with limited resources. The algorithm places special emphasis on incorporating interpayload (precedence) relationships; maintaining optimal alternate schedule definitions (a unique feature of dynamic programming) in the event of contingencies (namely, resource inventory changes) without problem resolution; and, by using a special information storage technique, reducing the computational complexity of solving realistic problems.

Dupnick, E.↗
NASA NTRS1981

Integrated Application of Active Controls (IAAC) technology to an advanced subsonic transport project: Current and advanced act control system definition study, volume 1

An active controls technology (ACT) system architecture was selected based on current technology system elements and optimal control theory was evaluated for use in analyzing and synthesizing ACT multiple control laws. The system selected employs three redundant computers to implement all of the ACT functions, four redundant smaller computers to implement the crucial pitch-augmented stability function, and a separate maintenance and display computer. The reliability objective of probability of crucial function failure of less than 1 x 10 to the -9th power per flight of 1 hr can be met with current technology system components, if the software is assumed fault free and coverage approaching 1.0 can be provided. The optimal control theory approach to ACT control law synthesis yielded comparable control law performance much more systematically and directly than the classical s-domain approach. The ACT control law performance, although somewhat degraded by the inclusion of representative nonlinearities, remained quite effective. Certain high-frequency gust-load alleviation functions may require increased surface rate capability.

Hanks, G. W.↗
NASA NTRS1991

Fatigue crack growth reliability by probabilistic finite elements

Fusion of the probabilistic finite-element method and reliability analysis for probabilistic fatigue-crack growth is presented. A comprehensive method for determining the probability of fatigue failure for mixed-mode cyclic loading is also presented. The loading is mixed-mode with randomness in the initial and final crack lengths, initial crack angle and position, material properties, crack-growth law, crack-direction law, and loading. The methodology consists of calculating the reliability index via an optimization procedure which is used to calculate the probability of fatigue failure. Performance of the methodology presented is demonstrated on a classical mode-I fatigue problem.

Besterfield, Glen H.↗
NASA NTRS2003

Optimum Climb to Cruise Noise Trajectories for the High Speed Civil Transport

By entraining large quantities of ambient air into advanced ejector nozzles, the jet noise of the proposed High Speed Civil Transport (HSCT) is expected to be reduced to levels acceptable for airport-vicinity noise certification. Away from the airport, however, this entrained air is shut off and the engines are powered up from their cutback levels to provide better thrust for the climb to cruise altitude. Unsuppressed jet noise levels propagating to the ground far from the airport are expected to be high. Complicating this problem is the HSCT's relative noise level with respect to the subsonic commercial fleet of 2010, which is expected to be much quieter than it is today after the retirement of older, louder, domestic stage II aircraft by the year 2000. In this study, the classic energy state approximation theory is extended to calculate trajectories that minimize the climb to cruise noise of the HSCT. The optimizer dynamically chooses the optimal altitude velocity trajectory, the engine power setting, and whether the ejector should be stowed or deployed with respect to practical aircraft climb constraints and noise limits.

Berton, Jeffrey J.↗
DOE OSTI2024

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Optimal experimental design: Formulations and computations

Questions of ‘how best to acquire data’ are essential to modelling and prediction in the natural and social sciences, engineering applications, and beyond. Optimal experimental design (OED) formalizes these questions and creates computational methods to answer them. This article presents a systematic survey of modern OED, from its foundations in classical design theory to current research involving OED for complex models. We begin by reviewing criteria used to formulate an OED problem and thus to encode the goal of performing an experiment. We emphasize the flexibility of the Bayesian and decision-theoretic approach, which encompasses information-based criteria that are well-suited to nonlinear and non-Gaussian statistical models. We then discuss methods for estimating or bounding the values of these design criteria; this endeavour can be quite challenging due to strong nonlinearities, high parameter dimension, large per-sample costs, or settings where the model is implicit. A complementary set of computational issues involves optimization methods used to find a design; we discuss such methods in the discrete (combinatorial) setting of observation selection and in settings where an exact design can be continuously parametrized. Finally we present emerging methods for sequential OED that build non-myopic design policies, rather than explicit designs; these methods naturally adapt to the outcomes of past experiments in proposing new experiments, while seeking coordination among all experiments to be performed. Throughout, we highlight important open questions and challenges.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Optimal Client Sampling in Federated Learning with Client-level Heterogeneous Differential Privacy

Federated Learning with client-level differential privacy (DP) provides a promising framework for collaboratively training models while rigorously protecting clients’ privacy. However, classic approaches like DP-FedAvg struggle when clients have heterogeneous privacy requirements, as they must uniformly enforce the strictest privacy level across all clients, leading to excessive DP noise and significant degradation in model utility. Existing methods to improve the model utility in such heterogeneous privacy settings often assume a trusted server and are largely heuristic, resulting in suboptimal performance and lacking strong theoretical foundations. Here, in this work, we address these challenges under a practical attack model where both clients and the server are honest-but-curious. We propose GDPFed, which partitions clients into groups based on their privacy budgets and achieves client-level DP within each group to reduce the privacy budget waste and hence improve the model utility. Based on the privacy and convergence analysis of GDPFed, we find that the magnitude of DP noise depends on both model dimensionality and the per-group client sampling ratios. To further improve the performance of GDPFed, we introduce GDPFed+, which integrates model sparsification to eliminate unnecessary noise and optimizes per-group client sampling ratios to minimize convergence error. Extensive empirical evaluations on multiple benchmark datasets demonstrate the effectiveness of GDPFed+, showing substantial performance gains compared with state-of-the-art methods.

Xu, Jiahao [Univ. of Nevada, Reno, NV (United Stat↗
NASA NTRS1974

Low thrust space vehicle trajectory optimization using regularized variables

Optimizing the trajectory of a low thrust space vehicle usually means solving a nonlinear two point boundary value problem. In general, accuracy requirements necessitate extensive computation times. In celestial mechanics, regularizing transformations of the equations of motion are used to eliminate computational and analytical problems that occur during close approaches to gravitational force centers. It was shown in previous investigations that regularization in the formulation of the trajectory optimization problem may reduce the computation time. In this study, a set of regularized equations describing the optimal trajectory of a continuously thrusting space vehicle is derived. The computational characteristics of the set are investigated and compared to the classical Newtonian unregularized set of equations. The comparison is made for low thrust, minimum time, escape trajectories and numerical calculations of Keplerian orbits. The comparison indicates that in the cases investigated for bad initial guesses of the known boundary values a remarkable reduction in the computation time was achieved. Furthermore, the investigated set of regularized equations shows high numerical stability even for long duration flights and is less sensitive to errors in the guesses of the unknown boundary values.

Schwenzfeger, K. J.↗
DOE OSTI2024

Quantum stabilization and flat hydrogen-based bands of nitrogen-doped lutetium hydride

We explore the electronic and structural properties of Lu-H-N structures with specific N,H ordering due to their remarkably narrow hydrogen-based bands at the Fermi level. Although exhibits a classical instability persisting up to 17 GPa, it is anharmonically stable near ambient pressure when accounting for quantum nuclear effects. The presence of flat bands near is understood to arise from destructive quantum interference between and surrounding orbitals, with certain types of defects leaving the flat bands unaffected. The results suggest that if this system is superconducting, there is an optimal pressure near ambient where the superconducting is maximized by anharmonically stabilized low-frequency and nonadiabatically coupled high-frequency hydrogen modes. Despite the metastability of this structure, its dynamical stability when modeled beyond a classical harmonic approach suggests the narrow bands near do not cause structural distortions in certain Lu-H-N stoichiometries.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗