Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical 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 1,135 records · Page 63

Optimization of echo-enabled harmonic generation toward coherent EUV and soft X-ray free-electron laser at NSLS-II

Prebunching via echo-enabled harmonic generation (EEHG) is an efficient way to reduce the radiator length and improve the longitudinal coherence as well as output stability in storage-ring-based free-electron lasers. We propose a conceptual design, which uses two straight sections to seed coherent extreme-ultraviolet (EUV) and soft X-ray emission with nearly MHz repetition rate. To take the large energy spread (10 –3 ) of a storage ring into account and utilize the existing bending magnets between the two straight sections as the first chicane, we implement a special modeling tool, named EEHG optimizer. This tool has been successfully applied to maximize the prebunching with a reasonably low energy modulation, thereby generating intense coherent X-ray pulses within a short undulator length (a few meters) limited by the available space of a storage ring. Numerical simulations confirm that the optimized EEHG parameters can be directly applied to generate a 10 MW scale peak power with fully coherent ultrafast EUV to soft X-ray pulses based on the NSLS-II parameters. This method can be easily extended to other types of diffraction-limited storage rings.

36 MATERIALS SCIENCE↗

Optimal Control Problems with Switching Points

The main idea of this report is to give an overview of the problems and difficulties that arise in solving optimal control problems with switching points. A brief discussion of existing optimality conditions is given and a numerical approach for solving the multipoint boundary value problems associated with the first-order necessary conditions of optimal control is presented. Two real-life aerospace optimization problems are treated explicitly. These are altitude maximization for a sounding rocket (Goddard Problem) in the presence of a dynamic pressure limit, and range maximization for a supersonic aircraft flying in the vertical, also in the presence of a dynamic pressure limit. In the second problem singular control appears along arcs with active dynamic pressure limit, which in the context of optimal control, represents a first-order state inequality constraint. An extension of the Generalized Legendre-Clebsch Condition to the case of singular control along state/control constrained arcs is presented and is applied to the aircraft range maximization problem stated above. A contribution to the field of Jacobi Necessary Conditions is made by giving a new proof for the non-optimality of conjugate paths in the Accessory Minimum Problem. Because of its simple and explicit character, the new proof may provide the basis for an extension of Jacobi's Necessary Condition to the case of the trajectories with interior point constraints. Finally, the result that touch points cannot occur for first-order state inequality constraints is extended to the case of vector valued control functions.

Seywald, Hans↗

Traffic Flow Management Using Aggregate Flow Models and the Development of Disaggregation Methods

A linear time-varying aggregate traffic flow model can be used to develop Traffic Flow Management (tfm) strategies based on optimization algorithms. However, there are no methods available in the literature to translate these aggregate solutions into actions involving individual aircraft. This paper describes and implements a computationally efficient disaggregation algorithm, which converts an aggregate (flow-based) solution to a flight-specific control action. Numerical results generated by the optimization method and the disaggregation algorithm are presented and illustrated by applying them to generate TFM schedules for a typical day in the U.S. National Airspace System. The results show that the disaggregation algorithm generates control actions for individual flights while keeping the air traffic behavior very close to the optimal solution.

Sun, Dengfeng↗

Stretching the limits of forming processes by robust optimization: A demonstrator

Robust design of forming processes using numerical simulations is gaining attention throughout the industry. In this work, it is demonstrated how robust optimization can assist in further stretching the limits of metal forming processes. A deterministic and a robust optimization study are performed, considering a stretch-drawing process of a hemispherical cup product. For the robust optimization study, both the effect of material and process scatter are taken into account. For quantifying the material scatter, samples of 41 coils of a drawing quality forming steel have been collected. The stochastic material behavior is obtained by a hybrid approach, combining mechanical testing and texture analysis, and efficiently implemented in a metamodel based optimization strategy. The deterministic and robust optimization results are subsequently presented and compared, demonstrating an increased process robustness and decreased number of product rejects by application of the robust optimization approach.

36 MATERIALS SCIENCE↗

Optimal control of wave energy converters

A wave energy converter and method for extracting energy from water waves maximizes the energy extraction per cycle by estimating an excitation force of heave wave motion on the buoy, computing a control force from the estimated excitation force using a dynamic model, and applying the computed control force to the buoy to extract energy from the heave wave motion. Analysis and numerical simulations demonstrate that the optimal control of a heave wave energy converter is, in general, in the form of a bang-singular-bang control; in which the optimal control at a given time can be either in the singular arc mode or in the bang-bang mode. The excitation force and its derivatives at the current time can be obtained through an estimator, for example, using measurements of pressures on the surface of the buoy in addition to measurements of the buoy position. A main advantage of this approximation method is the ease of obtaining accurate measurements for pressure on the buoy surface and for buoy position, compared to wave elevation measurements.

16 TIDAL AND WAVE POWER↗

The Influences of Lamination Angles on the Interior Noise Levels of an Aircraft

The feasibility of reducing the interior noise levels of an aircraft passenger cabin through optimization of the composite lay up of the fuselage is investigated. MSC/NASTRAN, a commercially available finite element code, is used to perform the dynamic analysis and subsequent optimization of the fuselage. The numerical calculation of sensitivity of acoustic pressure to lamination angle is verified using a simple thin, cylindrical shell with point force excitations as noise sources. The thin shell used represents a geometry similar to the fuselage and analytic solutions are available for the cylindrical thin shell equations of motion. Optimization of lamination angle for the reduction of interior noise is performed using a finite element model of an actual aircraft fuselage. The aircraft modeled for this study is the Beech Starship. Point forces simulate the structure borne noise produced by the engines and are applied to the fuselage at the wing mounting locations. These forces are the noise source for the optimization problem. The acoustic pressure response is reduced at a number of points in the fuselage and over a number of frequencies. The objective function is minimized with the constraint that it be larger than the maximum sound pressure level at the response points in the passenger cabin for all excitation frequencies in the range of interest. Results from the study of the fuselage model indicate that a reduction in interior noise levels is possible over a finite frequency range through optimal configuration of the lamination angles in the fuselage. Noise reductions of roughly 4 dB were attained. For frequencies outside the optimization range, the acoustic pressure response may increase after optimization. The effects of changing lamination angle on the overall structural integrity of the airframe are not considered in this study.

Fernholz, Christian M.↗

Best-Fit Conic Approximation of Spacecraft Trajectory

A computer program calculates a best conic fit of a given spacecraft trajectory. Spacecraft trajectories are often propagated as conics onboard. The conic-section parameters as a result of the best-conic-fit are uplinked to computers aboard the spacecraft for use in updating predictions of the spacecraft trajectory for operational purposes. In the initial application for which this program was written, there is a requirement to fit a single conic section (necessitated by onboard memory constraints) accurate within 200 microradians to a sequence of positions measured over a 4.7-hour interval. The present program supplants a prior one that could not cover the interval with fewer than four successive conic sections. The present program is based on formulating the best-fit conic problem as a parameter-optimization problem and solving the problem numerically, on the ground, by use of a modified steepest-descent algorithm. For the purpose of this algorithm, optimization is defined as minimization of the maximum directional propagation error across the fit interval. In the specific initial application, the program generates a single 4.7-hour conic, the directional propagation of which is accurate to within 34 microradians easily exceeding the mission constraints by a wide margin.

Singh, Gurkipal↗

Streamlining Ocean Dynamics Modeling with Fourier Neural Operators: A Multiobjective Hyperparameter and Architecture Optimization Approach

Training an effective deep learning model to learn ocean processes involves careful choices of various hyperparameters. We leverage DeepHyper’s advanced search algorithms for multiobjective optimization, streamlining the development of neural networks tailored for ocean modeling. The focus is on optimizing Fourier neural operators (FNOs), a data-driven model capable of simulating complex ocean behaviors. Selecting the correct model and tuning the hyperparameters are challenging tasks, requiring much effort to ensure model accuracy. DeepHyper allows efficient exploration of hyperparameters associated with data preprocessing, FNO architecture-related hyperparameters, and various model training strategies. We aim to obtain an optimal set of hyperparameters leading to the most performant model. Moreover, on top of the commonly used mean squared error for model training, we propose adopting the negative anomaly correlation coefficient as the additional loss term to improve model performance and investigate the potential trade-off between the two terms. The numerical experiments show that the optimal set of hyperparameters enhanced model performance in single timestepping forecasting and greatly exceeded the baseline configuration in the autoregressive rollout for long-horizon forecasting up to 30 days. Utilizing DeepHyper, we demonstrate an approach to enhance the use of FNO in ocean dynamics forecasting, offering a scalable solution with improved precision.

97 MATHEMATICS AND COMPUTING↗

Hybrid NN/SVM Computational System for Optimizing Designs

A computational method and system based on a hybrid of an artificial neural network (NN) and a support vector machine (SVM) (see figure) has been conceived as a means of maximizing or minimizing an objective function, optionally subject to one or more constraints. Such maximization or minimization could be performed, for example, to optimize solve a data-regression or data-classification problem or to optimize a design associated with a response function. A response function can be considered as a subset of a response surface, which is a surface in a vector space of design and performance parameters. A typical example of a design problem that the method and system can be used to solve is that of an airfoil, for which a response function could be the spatial distribution of pressure over the airfoil. In this example, the response surface would describe the pressure distribution as a function of the operating conditions and the geometric parameters of the airfoil. The use of NNs to analyze physical objects in order to optimize their responses under specified physical conditions is well known. NN analysis is suitable for multidimensional interpolation of data that lack structure and enables the representation and optimization of a succession of numerical solutions of increasing complexity or increasing fidelity to the real world. NN analysis is especially useful in helping to satisfy multiple design objectives. Feedforward NNs can be used to make estimates based on nonlinear mathematical models. One difficulty associated with use of a feedforward NN arises from the need for nonlinear optimization to determine connection weights among input, intermediate, and output variables. It can be very expensive to train an NN in cases in which it is necessary to model large amounts of information. Less widely known (in comparison with NNs) are support vector machines (SVMs), which were originally applied in statistical learning theory. In terms that are necessarily oversimplified to fit the scope of this article, an SVM can be characterized as an algorithm that (1) effects a nonlinear mapping of input vectors into a higher-dimensional feature space and (2) involves a dual formulation of governing equations and constraints. One advantageous feature of the SVM approach is that an objective function (which one seeks to minimize to obtain coefficients that define an SVM mathematical model) is convex, so that unlike in the cases of many NN models, any local minimum of an SVM model is also a global minimum.

Rai, Man Mohan↗

Efficient Quantum Gate Discovery with Optimal Control

Optimal control theory provides a framework for numerical discovery of device controls that implement quantum logic gates, but common objective functions used for optimization often assign arbitrarily high costs to otherwise useful controls. We propose a framework for designing objective functions that permit novel gate designs such as echo pulses or locally-equivalent gates. We use numerical simulations to demonstrate the efficacy of the new objective functions by designing microwave-only pulses that act as entangling gates for superconducting transmon architectures. We observe that the proposed objective functions lead to higher fidelity controls in fewer optimization iterations than obtainable by traditional objective functions.

Kairys, Paul↗

Wilson Dslash Kernel From Lattice QCD Optimization

Lattice Quantum Chromodynamics (LQCD) is a numerical technique used for calculations in Theoretical Nuclear and High Energy Physics. LQCD is traditionally one of the first applications ported to many new high performance computing architectures and indeed LQCD practitioners have been known to design and build custom LQCD computers. Lattice QCD kernels are frequently used as benchmarks (e.g. 168.wupwise in the SPEC suite) and are generally well understood, and as such are ideal to illustrate several optimization techniques. In this chapter we will detail our work in optimizing the Wilson-Dslash kernels for Intel Xeon Phi, however, as we will show the technique gives excellent performance on regular Xeon Architecture as well.

Lattice QCD, Wilson-Dslash, Parallel Computing, Op↗

Two-Stage Estimation and Variance Modeling for Latency-Constrained Variational Quantum Algorithms

The quantum approximate optimization algorithm (QAOA) has enjoyed increasing attention in noisy, intermediate-scale quantum computing with its application to combinatorial optimization problems. QAOA has the potential to demonstrate a quantum advantage for NP-hard combinatorial optimization problems. As a hybrid quantum-classical algorithm, the classical component of QAOA resembles a simulation optimization problem in which the simulation outcomes are attainable only through a quantum computer. The simulation that derives from QAOA exhibits two unique features that can have a substantial impact on the optimization process: (i) the variance of the stochastic objective values typically decreases in proportion to the optimality gap, and (ii) querying samples from a quantum computer introduces an additional latency overhead. In this paper, we introduce a novel stochastic trust-region method derived from a derivative-free, adaptive sampling trust-region optimization method intended to efficiently solve the classical optimization problem in QAOA by explicitly taking into account the two mentioned characteristics. The key idea behind the proposed algorithm involves constructing two separate local models in each iteration: a model of the objective function and a model of the variance of the objective function. Exploiting the variance model allows us to restrict the number of communications with the quantum computer and also helps navigate the nonconvex objective landscapes typical in QAOA optimization problems. In conclusion, we numerically demonstrate the superiority of our proposed algorithm using the SimOpt library and Qiskit when we consider a metric of computational burden that explicitly accounts for communication costs.

Derivative-free Optimization↗

Advantages of Unfair Quantum Ground-State Sampling

The debate around the potential superiority of quantum annealers over their classical counterparts has been ongoing since the inception of the field. Recent technological breakthroughs, which have led to the manufacture of experimental prototypes of quantum annealing optimizers with sizes approaching the practical regime, have reignited this discussion. However, the demonstration of quantum annealing speedups remains to this day an elusive albeit coveted goal. We examine the power of quantum annealers to provide a different type of quantum enhancement of practical relevance, namely, their ability to serve as useful samplers from the ground-state manifolds of combinatorial optimization problems. We study, both numerically by simulating stoquastic and non-stoquastic quantum annealing processes, and experimentally, using a prototypical quantum annealing processor, the ability of quantum annealers to sample the ground-states of spin glasses differently than thermal samplers. We demonstrate that (i) quantum annealers sample the ground-state manifolds of spin glasses very differently than thermal optimizers (ii) the nature of the quantum fluctuations driving the annealing process has a decisive effect on the final distribution, and (iii) the experimental quantum annealer samples ground-state manifolds significantly differently than thermal and ideal quantum annealers. We illustrate how quantum annealers may serve as powerful tools when complementing standard sampling algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spatially dependent regularization parameter selection for total generalized variation-based image denoising

We propose a novel image denoising model based on the total generalized variation (TGV) regularization. In the model, a spatially dependent regularization parameter is utilized to adaptively fit the local image features, resulting in further exploitation of the denoising potential of the TGV regularization. The proposed model is formulated under a joint optimization framework, by which the estimations of the restored image and the regularization parameter are achieved simultaneously. Furthermore, the model is general purpose that can handle various types of noise occurring in image processing. An alternating minimization-based numerical scheme is especially developed, which leads to an efficient algorithmic solution to the nonconvex optimization problem. Numerical experiments are reported to illustrate the effectiveness of our model in terms of both peak signal-to-noise ratio and visual perception.

97 MATHEMATICS AND COMPUTING↗

Ptychographic phase retrieval by proximal algorithms

We derive a set of ptychography phase-retrieval iterative engines based on proximal algorithms originally developed in convex optimization theory, and discuss their connections with existing ones. The use of proximal operator creates a simple frame work that allows us to incorporate the effect of noise from a maximum-likelihood (ML) principle. We focus on three particular algorithms, namely proximal minimization, alternating direction method of multiplier and accelerated proximal gradient (APG). We benchmark their performance with numerical simulations, and discuss their optimal conditions for convergence and accuracy. An experimental dataset is used to demonstrate their effectiveness as well, in which case an array of cubic Au nanoparticles with a size of 50 nm is imaged. We show that with the presence of Poisson noise, a dataset with photon counts up to 10 4 at one detector pixel already requires ML-based methods to achieve a stable convergence. Among the three algorithms derived in this work, APG method is reported first time for its application in ptychographic reconstruction and shows superior performance in terms of both accuracy and convergence rate with a noisy dataset.

36 MATERIALS SCIENCE↗

Optimal design of structures with buckling constraints.

The paper presents an iterative, finite element method for minimum weight design of structures with respect to buckling constraints. The redesign equation is derived from the optimality criterion, as opposed to a numerical search procedure, and can handle problems that are characterized by the existence of two fundamental buckling modes at the optimal design. Application of the method is illustrated by beam and orthogonal frame design problems.

Kiusalaas, J.↗

Bilevel Parameter Optimization for Nonlocal Image Denoising Models

We propose a bilevel optimization approach for the determination of parameters in nonlocal image denoising. We consider both spatial weights in front of the fidelity term, as well as weights within the kernel of the nonlocal operator. In both cases we investigate the differentiability of the solution operator in function spaces and derive a first order optimality system that characterizes local minima. For the numerical solution of the problems, we propose a second-order optimization algorithm in combination with a finite element discretization of the nonlocal denoising models and a computational strategy for the solution of the resulting dense linear systems. Several experiments are run in order to show the suitability of our approach.

97 MATHEMATICS AND COMPUTING↗

Modular Design of Advanced Catalytic Materials Using Hybrid Organic-Inorganic Raspberry Particles

Catalysis is one of the most sophisticated areas of materials research that encompasses a diverse set of materials and phenomena occurring on multiple length and time scales. Designing catalysts that can be broadly applied toward global energy and environmental challenges requires the development of universal frameworks for complex catalytic systems through rational and independent (or quasi-independent) optimization of multiple structural and compositional features. Toward addressing this goal, a modular platform is presented in which sacrificial organic colloids bearing catalytic nanoparticles on their surfaces self-assemble with matrix precursors, simultaneously structuring the resulting porous networks and fine-tuning the locations of catalyst particles. This strategy allows combinatorial variations of the material building blocks and their organization, in turn providing numerous degrees of freedom for optimizing the material's functional properties, from the nanoscale to the macroscale. The platform enables systematic studies and rational design of efficient and robust systems for a wide range of catalytic and photocatalytic reactions, as well as their integration into industrial and other real-life environments.

36 MATERIALS SCIENCE↗