Search NASA⌕ Search

SEARCH · Search NASA

Results for “nonlinear 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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
NASA NTRS2004

A Study of Penalty Function Methods for Constraint Handling with Genetic Algorithm

COMETBOARDS (Comparative Evaluation Testbed of Optimization and Analysis Routines for Design of Structures) is a design optimization test bed that can evaluate the performance of several different optimization algorithms. A few of these optimization algorithms are the sequence of unconstrained minimization techniques (SUMT), sequential linear programming (SLP) and the sequential quadratic programming techniques (SQP). A genetic algorithm (GA) is a search technique that is based on the principles of natural selection or "survival of the fittest". Instead of using gradient information, the GA uses the objective function directly in the search. The GA searches the solution space by maintaining a population of potential solutions. Then, using evolving operations such as recombination, mutation and selection, the GA creates successive generations of solutions that will evolve and take on the positive characteristics of their parents and thus gradually approach optimal or near-optimal solutions. By using the objective function directly in the search, genetic algorithms can be effectively applied in non-convex, highly nonlinear, complex problems. The genetic algorithm is not guaranteed to find the global optimum, but it is less likely to get trapped at a local optimum than traditional gradient-based search methods when the objective function is not smooth and generally well behaved. The purpose of this research is to assist in the integration of genetic algorithm (GA) into COMETBOARDS. COMETBOARDS cast the design of structures as a constrained nonlinear optimization problem. One method used to solve constrained optimization problem with a GA to convert the constrained optimization problem into an unconstrained optimization problem by developing a penalty function that penalizes infeasible solutions. There have been several suggested penalty function in the literature each with there own strengths and weaknesses. A statistical analysis of some suggested penalty functions is performed in this study. Also, a response surface approach to robust design is used to develop a new penalty function approach. This new penalty function approach is then compared with the other existing penalty functions.

Ortiz, Francisco↗
DOE OSTI2025

An Adaptive Newton-Based Free-Boundary Grad–Shafranov Solver

Equilibria in magnetic confinement devices result from force balancing between the Lorentz force and the plasma pressure gradient. In an axisymmetric configuration like a tokamak, such an equilibrium is described by an elliptic equation for the poloidal magnetic flux, commonly known as the Grad–Shafranov equation. It is challenging to develop a scalable and accurate free-boundary Grad–Shafranov solver, since it is a fully nonlinear optimization problem that simultaneously solves for the magnetic field coil current outside the plasma to control the plasma shape. In this work, we develop a Newton-based free-boundary Grad–Shafranov solver using adaptive finite elements and preconditioning strategies. The free-boundary interaction leads to the evaluation of a domain-dependent nonlinear form of which its contribution to the Jacobian matrix is achieved through shape calculus. The optimization problem aims to minimize the distance between the plasma boundary and specified control points while satisfying two nontrivial constraints, which correspond to the nonlinear finite element discretization of the Grad–Shafranov equation and a constraint on the total plasma current involving a nonlocal coupling term. The linear system is solved by a block factorization, and AMG is called for subblock elliptic operators. The unique contributions of this work include the treatment of a global constraint, preconditioning strategies, nonlocal reformulation, and the implementation of adaptive finite elements. Furthermore, it is found that the resulting Newton solver is robust, successfully reducing the nonlinear residual to 1e-6 and lower in a small handful of iterations while addressing the challenging case to find a Taylor state equilibrium where conventional Picard-based solvers fail to converge.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS1985

Optimal landing of a helicopter in autorotation

Gliding descent in autorotation is a maneuver used by helicopter pilots in case of engine failure. The landing of a helicopter in autorotation is formulated as a nonlinear optimal control problem. The OH-58A helicopter was used. Helicopter vertical and horizontal velocities, vertical and horizontal displacement, and the rotor angle speed were modeled. An empirical approximation for the induced veloctiy in the vortex-ring state were provided. The cost function of the optimal control problem is a weighted sum of the squared horizontal and vertical components of the helicopter velocity at touchdown. Optimal trajectories are calculated for entry conditions well within the horizontal-vertical restriction curve, with the helicopter initially in hover or forwared flight. The resultant two-point boundary value problem with path equality constraints was successfully solved using the Sequential Gradient Restoration Technique.

Lee, A. Y. N.↗
DOE OSTI2024

CI-MOR Final Report: Analysis and Validation of Critical Infrastructure Models using Model Order Reduction

This report summarizes the research and capabilities developed as part of the project “Analysis and Validation of Critical Infrastructure Models using Model Order Reduction” (CI-MOR) LDRD project. CI-MOR research enables the solution of large, complex optimization models that naturally arise in national security challenges involving critical infrastructures. Specifically, CI-MOR researchers developed methods to (1) rigorously approximate complex, nonlinear optimization formulations, (2) identify alternative near-optimal solutions, (3) accelerate optimization workflows used for complex applications, and (4) rigorously integrate domain knowledge in stochastic-process models. This report provides an overview of the research done in CI-MOR, and we describe application exemplars used to illustrate CI-MOR capabilities. Furthermore, we describe the software developed by CI-MOR that researchers can leverage to analyze new applications.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1998

A Nonlinear Physics-Based Optimal Control Method for Magnetostrictive Actuators

This paper addresses the development of a nonlinear optimal control methodology for magnetostrictive actuators. At moderate to high drive levels, the output from these actuators is highly nonlinear and contains significant magnetic and magnetomechanical hysteresis. These dynamics must be accommodated by models and control laws to utilize the full capabilities of the actuators. A characterization based upon ferromagnetic mean field theory provides a model which accurately quantifies both transient and steady state actuator dynamics under a variety of operating conditions. The control method consists of a linear perturbation feedback law used in combination with an optimal open loop nonlinear control. The nonlinear control incorporates the hysteresis and nonlinearities inherent to the transducer and can be computed offline. The feedback control is constructed through linearization of the perturbed system about the optimal system and is efficient for online implementation. As demonstrated through numerical examples, the combined hybrid control is robust and can be readily implemented in linear PDE-based structural models.

Smith, Ralph C.↗
NASA NTRS1984

Composite laminate optimization program suitable for microcomputers

The design of a composite panel requires some way of finding the minimum thickness laminate which will withstand the load requirements without failure. The mathematical complexity of this problem dictates the use of nonlinear optimization techniques. Specialized laminate optimization programs were developed which are compact and efficient enough to run on microcomputers. Only stresses at a point and inplane loads and deflections are considered. The programs are simple to use and require no knowledge of optimization. Techniques are developed which find minimum thickness laminates with either ply ratios or ply angles as design variables. A method is presented for finding the optimum orientation for the axis of symmetry of an orthotropic laminate. The orthotropic laminate program uses an approximate failure theory, which speed up computations dramatically.

Flanagan, G. V.↗
DOE OSTI2025

Kernel Manifolds: Nonlinear‐Augmentation Dimensionality Reduction Using Reproducing Kernel Hilbert Spaces

This paper generalizes recent advances on quadratic manifold (QM) dimensionality reduction by developing kernel methods-based nonlinear-augmentation dimensionality reduction. QMs, and more generally feature map-based nonlinear corrections, augment linear dimensionality reduction with a nonlinear correction term in the reconstruction map to overcome approximation accuracy limitations of purely linear approaches. While feature map-based approaches typically learn a least squares optimal polynomial correction term, we generalize this approach by learning an optimal nonlinear correction from a user-defined reproducing kernel Hilbert space. Our approach allows one to impose arbitrary nonlinear structure on the correction term, including polynomial structure, and includes feature map and radial basis function-based corrections as special cases. Furthermore, our method has relatively low training cost and has monotonically decreasing error as the latent space dimension increases. In conclusion, we compare our approach to proper orthogonal decomposition and several recent QM approaches on data from several example problems.

kernel methods↗
DOE OSTI2024

Leveraging design of experiments to build chemometric models for the quantification of uranium (VI) and HNO3 by Raman spectroscopy

Partial least squares regression (PLSR) and support vector regression (SVR) models were optimized for the quantification of U(VI) (10–320 g L −1 ) and HNO 3 (0.6–6 M) by Raman spectroscopy with optimized calibration sets chosen by optimal design of experiments. The designed approach effectively minimized the number of samples in the calibration set for PLSR and SVR by selecting sample concentrations with a quadratic process model, despite complex confounding and covarying spectral features in the spectra. The top PLS2 model resulted in percent root mean square errors of prediction for U(VI), HNO 3 , and NO 3 − of 3.7%, 3.6%, and 2.9%, respectively. PLS1 models performed similarly despite modeling an analyte with a majority linear response (i.e., uranyl symmetric stretch) and another with more covarying vibrational modes (i.e., HNO 3 ). Partial least squares (PLS) model loadings and regression coefficients were evaluated to better understand the relationship between weaker Raman bands and covarying spectral features. Support vector machine models outperformed PLS1 models, resulting in percent root mean square error of prediction values for U(VI) and HNO 3 of 1.5% and 3.1%, respectively. The optimal nonlinear SVR model was trained using a similar number of samples (11) compared with the PLSR model, even though PLS is a linear modeling approach. The generic D-optimal design presented in this work provides a robust statistical framework for selecting training set samples in disparate two-factor systems. This approach reinforces Raman spectroscopy for the quantification of species relevant to the nuclear fuel cycle and provides a robust chemometric modeling approach to bolster online monitoring in challenging process environments.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS2016

Dynamic Modeling from Flight Data with Unknown Time Skews

A method for estimating dynamic model parameters from flight data with unknown time skews is described and demonstrated. The method combines data reconstruction, nonlinear optimization, and equation-error parameter estimation in the frequency domain to accurately estimate both dynamic model parameters and the relative time skews in the data. Data from a nonlinear F-16 aircraft simulation with realistic noise, instrumentation errors, and arbitrary time skews were used to demonstrate the approach. The approach was further evaluated using flight data from a subscale jet transport aircraft, where the measured data were known to have relative time skews. Comparison of modeling results obtained from time-skewed and time-synchronized data showed that the method accurately estimates both dynamic model parameters and relative time skew parameters from flight data with unknown time skews.

Morelli, Eugene A.↗
NASA NTRS2026

Mathematical Model of a Regenerative Fuel Cell for System Optimization

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

Electrochemistry↗
NASA NTRS1972

Optimal horizontal guidance law for aircraft in the terminal area.

Study of the horizontal guidance of aircraft in and near the terminal area. The problem of guiding an aircraft in minimum time from an arbitrary point to the outer marker is formulated as a nonlinear optimal control problem, and the control law solution is obtained by the application of the maximum principle. It is found that for some initial states the problem is singular. Furthermore, the extremal controls for this problem are not unique. Consequently, the optimal controls must be obtained on the basis of the value of the performance index. The control law is implemented in the form of a digital computer program which computes the optimal trajectory for arbitrary initial conditions.

Pecsvaradi, T.↗
DOE OSTI2024

Alternating Direction Decomposition with Strong Bounding and Convexification (ADDSBC) for Solving Security Constrained AC Unit Commitment Problems

This project aims to develop efficient and robust computational methods for solving the security-constrained unit commitment and alternating current optimal power flow problem (SC-UC-ACOPF). The SC-UC-ACOPF problem is at the center of the short-term operation of the U.S. Power Grid. It is solved every week, every day, and every 10 minutes to plan for the optimal action of electricity generation and consumption by minimizing the generation cost and maintaining power system reliability against potential disruptions of equipment failures. In mathematical terms, SC-UC-ACOPF is a challenging large-scale mixed-integer nonlinear optimization model. This means that the decisions involve both discrete variables, e.g. the turning on and off of generators and switching of transmission lines and transformers, and continuous decisions, e.g. the amount of energy generated by each generator and the power flows in the power grid. The physics of the power flow is described by nonlinear equations involving real and reactive power and bus voltages. Another key feature is the large number of contingencies, i.e. the system needs to stay reliable in face of failure of any one equipment, such as transmission lines and generators. The U.S. power grids are extremely complicated and large scale with more than 5,000 generators, 50,000 buses, and 100,000 high-voltage transmission lines, making the SC-UC-ACOPF a very large-scale computation challenge. The research developed in this project aims to solve the SC-UC-ACOPF problems in the three timescales, i.e. weekly, daily, and every 10-min. The proposed computational methods are built on a principled algorithmic approach of decomposition and penalization. More specifically, the algorithm develops spatial and temporal decomposition by exploiting the strong temporal coupling and weak spatial coupling of the UC problem and the complementary feature, i.e. weak temporal coupling and strong spatial coupling of the ACOPF problem. The algorithm also leverages recent progresses in strong convex relaxation of ACOPF. A unique feature of the proposed approach is that it generates a valid, global upper bound on the optimal maximum profit. In this way, a global optimality gap is available to measure the quality of the solution. To further speed up computation, the research team has developed a plethora of effective heuristics to strengthen the iterative penalty-based decomposition framework. For instance, a heuristic is developed to construct inner approximations of the time coupling constraints within the time decoupled problems. Contingencies are pre-screened and low-rank matrix computation is exploited to find the almost unique solution to each contingency. A novel heuristic for line switching is proposed and tested with positive impacts on instances where line switching is beneficial. Taking a systematic approach and carefully handling every detail of the problem pays off. The TIM-GO’s performance throughout the trials and the final event was stellar. TIM-GO garnered the second highest total prize money and is ranked in the top three positions across all categories of comparison.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Development of Steady-State and Dynamic Mass and Energy Constrained Neural Networks for Distributed Chemical Systems Using Noisy Transient Data

The paper presents the development of algorithms for mass and energy constrained neural network models that can exactly conserve the overall mass and energy of distributed chemical process systems, even though the noisy transient data used for optimal model training violate the same. In contrast to approximately satisfying mass and energy balance constraints of a system by soft penalization of objective function, algorithms have been developed for solving equality-constrained nonlinear optimization problems, thus providing the guarantee of exactly satisfying the system mass and energy conservation laws. For developing dynamic mass-energy constrained network models for distributed systems, hybrid series and parallel dynamic-static neural networks have been leveraged. The developed algorithms for solving both the training and forward problems are validated using both steady-state and dynamic data in the presence of various noise characteristics. The developed data-driven algorithms are flexible to exactly satisfy mass and energy balance constraints for dynamic chemical processes if the system holdup information is available. The proposed network structures and algorithms are applied to the development of data-driven lumped and distributed models of an adiabatic superheater/reheater system, a nonisothermal continuous stirred tank reactor, as well as an electrically heated plug-flow reactor system where one form of energy gets transformed to another. It has been observed that the mass-energy constrained neural networks yield a root mean squared error of <1% with respect to the system truth for the case studies evaluated in this work.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS2018

A Learn-To-Fly Approach for Adaptively Tuning Flight Control Systems

A method is presented for adaptively tuning feedback control gains in a ight control sys- tem to achieve desired closed-loop performance. The method combines efficient parameter estimation for identifying closed-loop dynamics models, with online nonlinear optimization for sequentially perturbing and updating control gains to improve performance. Prior in- formation on stability and control derivatives is not needed, nor is any knowledge about the control system architecture. Following convergence, the optimized control gains (with uncertainties), the open-loop dynamics model, and the closed-loop dynamics model are available. The method is demonstrated for tuning a longitudinal stability augmentation system using a realistic nonlinear ight dynamics simulation of the NASA FASER airplane. Convergence was attained using five piloted maneuvers that spanned approximately one minute of ight test time. Although demonstrated for a relatively simple case, the method is general and can be applied to other aircraft, axes, performance metrics, and control systems.

Grauer, Jared A.↗
NASA NTRS2021

A Learn-to-Fly Approach for Adaptively Tuning Flight Control Systems

A method is presented for adaptively tuning feedback control gains in a flight control system to achieve desired closed-loop performance. The method combines efficient aircraft parameter estimation, for identifying closed-loop dynamics models, with online nonlinear optimization, for sequentially perturbing and updating control gains to improve performance. Access to flight measurements and the control gains is required, but no prior information about the aircraft dynamics or the flight control architecture is needed. After the procedure, the optimized control gains (with uncertainties), the open-loop dynamics model, and the closed-loop dynamics model are available. The method is demonstrated for tuning a longitudinal stability augmentation system using a realistic nonlinear flight dynamics simulation of a subscale airplane. Convergence was attained using five maneuvers that spanned approximately one minute of flight test time. Although shown for a relatively simple case, the method is general and can be applied to other aircraft, axes of motion, performance metrics, and control system designs.

Adaptive tuning↗
NASA NTRS1993

Optimization of actuator arrays for aircraft interior noise control

A numerical procedure for grouping actuators in order to reduce the number of degrees of freedom in an active noise control system is evaluated using experimental data. Piezoceramic actuators for reducing aircraft interior noise are arranged into groups using a nonlinear optimization routine and clustering algorithm. An actuator group is created when two or more actuators are driven with the same control input. This procedure is suitable for active control applications where actuators are already mounted on a structure. The feasibility of this technique is demonstrated using measured data from the aft cabin of a Douglas DC-9 fuselage. The measured data include transfer functions between 34 piezoceramic actuators and 29 interior microphones and microphone responses due to the primary noise produced by external speakers. Control inputs for the grouped actuators were calculated so that a cost function, defined as a quadratic pressure term and a penalty term, was a minimum. The measured transfer functions and microphone responses are checked by comparing calculated noise reductions with measured noise reductions for four frequencies. The grouping procedure is then used to determine actuator groups that improve overall interior noise reductions by 5.3 to 15 dB, compared to the baseline experimental configuration.

Cabell, R. H.↗
NASA NTRS2009

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↗