SEARCH · Engineering Papers

Results for “Nonlinear robust optimization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

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

At least 145 records · Page 8

All sources NASA NTRS DOE OSTI

DOE OSTI2020

Adaptive Activation Functions Accelerate Convergence in Deep and Physics-informed Neural Networks

We employ adaptive activation functions for regression in deep and physics-informed neural networks (PINNs) to approximate smooth and discontinuous functions as well as solutions of linear and nonlinear partial differential equations. In particular, we solve the nonlinear Klein-Gordon equation, which has smooth solutions, the nonlinear Burgers equation, which can admit high gradient solutions, and the Helmholtz equation. We introduce a scalable hyper-parameter in the activation function, which can be optimized to achieve best performance of the network as it changes dynamically the topology of the loss function involved in the optimization process. The adaptive activation function has better learning capabilities than the traditional one (fixed activation) as it improves greatly the convergence rate, especially at early training, as well as the solution accuracy. To better understand the learning process, we plot the neural network solution in the frequency domain to examine how the network captures successively different frequency bands present in the solution. We consider both forward problems, where the approximate solutions are obtained, as well as inverse problems, where parameters involved in the governing equation are identified. Our simulation results show that the proposed method is a very simple and effective approach to increase the efficiency, robustness and accuracy of the neural network approximation of nonlinear functions as well as solutions of partial differential equations, especially for forward problems. We theoretically prove that in the proposed method, gradient descent algorithms are not attracted to suboptimal critical points or local minima.

machine leaning, Bad minima, Inverse problems, Phy↗

NASA NTRS1986

A methodology for designing robust multivariable nonlinear control systems

A new methodology is described for the design of nonlinear dynamic controllers for nonlinear multivariable systems providing guarantees of closed-loop stability, performance, and robustness. The methodology is an extension of the Linear-Quadratic-Gaussian with Loop-Transfer-Recovery (LQG/LTR) methodology for linear systems, thus hinging upon the idea of constructing an approximate inverse operator for the plant. A major feature of the methodology is a unification of both the state-space and input-output formulations. In addition, new results on stability theory, nonlinear state estimation, and optimal nonlinear regulator theory are presented, including the guaranteed global properties of the extended Kalman filter and optimal nonlinear regulators.

Grunberg, D. B.↗

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

End–to–End Metasurface Design for Temperature Imaging via Broadband Planck‐Radiation Regression

A theoretical framework is presented for temperature imaging from long-wavelength infrared (LWIR) thermal radiation (e.g., 8–12 µm) through the end-to-end design of a metasurface-optics frontend and a computational-reconstruction backend. A new nonlinear reconstruction algorithm, “Planck regression”, is introduced to reconstruct the temperature map from a gray scale sensor image, even in the presence of severe chromatic aberration, by exploiting black body and optical physics particular to thermal imaging. This algorithm is combined with an end-to-end approach that optimizes manufacturable, single-layer metasurfaces to yield the most accurate reconstruction. The designs demonstrate high-quality, noise-robust reconstructions of arbitrary temperature maps (including completely random images) in simulations of an ultra-compact thermal-imaging device. Here, it is also shown that Planck regression is much more generalizable to arbitrary images than a straightforward neural-network reconstruction, which requires a large training set of domain-specific images.

36 MATERIALS SCIENCE↗

NASA NTRS2003

Route Monopolie and Optimal Nonlinear Pricing

To cope with air traffic growth and congested airports, two solutions are apparent on the supply side: 1) use larger aircraft in the hub and spoke system; or 2) develop new routes through secondary airports. An enlarged route system through secondary airports may increase the proportion of route monopolies in the air transport market.The monopoly optimal non linear pricing policy is well known in the case of one dimension (one instrument, one characteristic) but not in the case of several dimensions. This paper explores the robustness of the one dimensional screening model with respect to increasing the number of instruments and the number of characteristics. The objective of this paper is then to link and fill the gap in both literatures. One of the merits of the screening model has been to show that a great varieD" of economic questions (non linear pricing, product line choice, auction design, income taxation, regulation...) could be handled within the same framework.VCe study a case of non linear pricing (2 instruments (2 routes on which the airline pro_ddes customers with services), 2 characteristics (demand of services on these routes) and two values per characteristic (low and high demand of services on these routes)) and we show that none of the conclusions of the one dimensional analysis remain valid. In particular, upward incentive compatibility constraint may be binding at the optimum. As a consequence, they may be distortion at the top of the distribution. In addition to this, we show that the optimal solution often requires a kind of form of bundling, we explain explicitly distortions and show that it is sometimes optimal for the monopolist to only produce one good (instead of two) or to exclude some buyers from the market. Actually, this means that the monopolist cannot fully apply his monopoly power and is better off selling both goods independently.We then define all the possible solutions in the case of a quadratic cost function for a uniform distribution of agent types and explain the implications for airlines in terms of service differentiation.

Tournut, Jacques↗

NASA NTRS1985

Design of suboptimal regulators for nonlinear systems

An optimal feedback control law is preferred for the regulation of a deterministic nonlinear system. In this paper, a practical, iterative design method leading to a sequence of suboptimal control laws with successively improved performance is presented. The design method requires the determination of an upper bound to the performance of each successive control law. This is obtained by solving a partial differential inequality by means of a linear programming technique. Robustness properties and the application of the design method to the control of a robot manipulator arm are also presented.

Balaram, J.↗

DOE OSTI2021

Beyond optimization—supervised learning applications in relativistic laser-plasma experiments

We explore the applications of machine learning techniques in relativistic laser-plasma experiments beyond optimization purposes. We predict the beam charge of electrons produced in a laser wakefield accelerator given the laser wavefront change caused by a deformable mirror. Machine learning enables feature analysis beyond merely searching for an optimal beam charge, showing that specific aberrations in the laser wavefront are favored in generating higher beam charges. Supervised learning models allow characterizing the measured data quality as well as recognizing irreproducible data and potential outliers. Furthermore, we also include virtual measurement errors in the experimental data to examine the model robustness under these conditions. This work demonstrates how machine learning methods can benefit data analysis and physics interpretation in a highly nonlinear problem of relativistic laser-plasma interaction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1983

Robust penalty method for structural synthesis

The Sequential Unconstrained Minimization Technique (SUMT) offers an easy way of solving nonlinearly constrained problems. However, this algorithm frequently suffers from the need to minimize an ill-conditioned penalty function. An ill-conditioned minimization problem can be solved very effectively by posing the problem as one of integrating a system of stiff differential equations utilizing concepts from singular perturbation theory. This paper evaluates the robustness and the reliability of such a singular perturbation based SUMT algorithm on two different problems of structural optimization of widely separated scales. The report concludes that whereas conventional SUMT can be bogged down by frequent ill-conditioning, especially in large scale problems, the singular perturbation SUMT has no such difficulty in converging to very accurate solutions.

Kamat, M. P.↗

NASA NTRS1991

A parallel trajectory optimization tool for aerospace plane guidance

A parallel trajectory optimization algorithm is being developed. One possible mission is to provide real-time, on-line guidance for the National Aerospace Plane. The algorithm solves a discrete-time problem via the augmented Lagrangian nonlinear programming algorithm. The algorithm exploits the dynamic programming structure of the problem to achieve parallelism in calculating cost functions, gradients, constraints, Jacobians, Hessian approximations, search directions, and merit functions. Special additions to the augmented Lagrangian algorithm achieve robust convergence, achieve (almost) superlinear local convergence, and deal with constraint curvature efficiency. The algorithm can handle control and state inequality constraints such as angle-of-attack and dynamic pressure constraints. Portions of the algorithm have been tested. The nonlinear programming core algorithm performs well on a variety of static test problems and on an orbit transfer problem. The parallel search direction algorithm can reduce wall clock time by a factor of 10 for this part of the computation task.

Psiaki, Mark L.↗

NASA NTRS1990

Dissipative compensators for flexible spacecraft control

The problem of controller design for flexible spacecraft is addressed. Model-based compensators, which rely on the knowledge of the system parameters to tune the state estimator, are considered. The instability mechanisms resulting from high sensitivity to parameter uncertainties are investigated. Dissipative controllers, which use collocated actuators and sensors, are also considered, and the robustness properties of constant-gain dissipative controllers in the presence of unmodeled elastic-mode dynamics, sensor/actuator nonlinearities, and actuator dynamics are summarized. In order to improve the performance without sacrificing robustness, a class of dissipative dynamic compensators is proposed and is shown to retain robust stability in the presence of second-order actuator dynamics if acceleration feedback is employed. A class of dissipative dynamic controllers is proposed which consists of a low-authority, constant-gain controller and a high-authority dynamic compensator. A procedure for designing an optimal dissipative dynamic compensator is given which minimizes a quadratic performance criterion. Such compensators offer the promise of better performance while still retaining robust stability.

Joshi, S. M.↗

DOE OSTI2025

Comparative study of spectral broadening and few-cycle compression of Yb:KGW laser pulses in gas-filled hollow-core fibers

While industrial-grade Yb-based amplifiers have become very prevalent, their limited gain bandwidth has created a large demand for robust spectral broadening techniques that allow for few-cycle pulse compression. In this work, we perform a comparative study between several atomic and molecular gases as media for spectral broadening in a hollow-core fiber geometry. Exploiting nonlinearities such as self-phase modulation, self-steepening, and stimulated Raman scattering, we explore the extent of spectral broadening and its dependence on gas pressure, the critical power for self-focusing, and the optimal regime for few-cycle pulse compression. Using a 3-mJ, 200-fs input laser pulses, we achieve 17 fs, few-cycle pulses with 80% fiber energy transmission efficiency. The optimal parameters can be scaled for higher or lower input pulse energies with appropriate gas parameters and fiber geometry.

Shalaby, Islam (ORCID:0000000332846636)↗

DOE OSTI2022

Design of a supervisory control system for autonomous operation of advanced reactors

Advanced reactors to be deployed in the coming decades will face deregulated energy markets, and may adopt flexible operation to boost profitability. To aid in the transition from baseload to flexible operation paradigm, autonomous operation is sought. This work focuses on the control aspect of autonomous operation. Specifically, a hierarchical control system is designed to support constraint enforcement during routine operational transients. Within the system, data-driven modeling, physics-based state observation, and classical control algorithms are integrated to provide an adaptable and robust solution. A 320 MW Fluoride-cooled High-temperature Pebble-bed Reactor is the design basis for demonstrating the proposed control system. The hierarchical control system consists of a supervisory layer and low-level layer. The supervisory layer receives requests to change the system's operating conditions (e.g., the current reactor power to meet a load -follow), and accepts or rejects them based on constraints that have been assigned. Constraints are issued to keep the plant within an optimal operating region. The low-level layer interfaces with the actuators of the system to fulfill requested changes, while maintaining tracking and regulation duties. Further, to accept requests at the supervisory layer, the Reference Governor algorithm was adopted. To model the dynamics of the reactor, a system identification algorithm, Dynamic Mode Decomposition, was utilized. To estimate the evolution of process variables that cannot be directly measured (e.g., the propagation of delayed neutron precursors), the Unscented Kalman Filter, incorporating a nonlinear model of nuclear dynamics, was adopted. The composition of these algorithms led to a numerical demonstration of constraint enforcement during a 40% power drop transient (at a rate of 5 %/min). Uncontrolled secondary-side temperatures were successfully constrained. Adaptability of the proposed system was demonstrated by modifying the constraint values, and enforcing them during the transient. Robustness was also demonstrated by enforcing constraints under noisy environments.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

DOE OSTI2025

Alternative mixed integer linear programming optimization for joint job scheduling and data allocation in grid computing

This paper presents a novel approach to the joint optimization of job scheduling and data allocation in grid computing environments. We formulate this joint optimization problem as a mixed integer quadratically constrained program. To tackle the nonlinearity in the constraint, we alternatively fix a subset of decision variables and optimize the remaining ones via Mixed Integer Linear Programming (MILP). We solve the MILP problem at each iteration via an off-the-shelf MILP solver. Our experimental results show that our method significantly outperforms existing heuristic methods, employing either independent optimization or joint optimization strategies. We have also verified the generalization ability of our method over grid environments with various sizes and its high robustness to the algorithm setting.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Method to account for natural fracture induced elastic anisotropy in geomechanical characterization of shale gas reservoirs

Shale has been usually recognized as a transverse isotropic (TI) medium in conventional geomechanical log interpretation due to its laminated nature. However, when natural fractures exist in the shale rock, additional elastic anisotropy is introduced, converting laminated Shale to an orthorhombic (OB) medium. Previous studies illustrate that neglecting the natural fracture induced anisotropy in shale geomechanical log interpretation could lead to inaccurate evaluations of elastic moduli and in-situ stresses. In this paper, a new method is developed to account for the natural fracture induced anisotropy in geomechanical log interpretation based upon the TI acoustic model developed by the author and a characterization technique of elastic wave anisotropy (Sayers, 1991). The new OB model incorporates the four acoustic log data inputs and five modeling constraints in a nonlinear optimization algorithm to solve for the nine independent stiffness coefficients of an OB rock, and further to solve for the geomechanical properties and in-situ stress profiles in an OB formation. The new method was validated with a Marcellus Gas Shale field case. Both the new OB model and the conventional TI model were applied to interpret the minimum horizontal stress profile for the same formation. By comparing the results, the OB model is more robust than the TI from two aspects. First, the average stress magnitude predicted by the OB model is closer to the one measured by the Diagnostic Fracture Injection Test (DFIT). Second, the OB model predicts a more obvious stress barrier between the lower Marcellus and upper Onondaga Limestone than the TI model does. Finally, the predicted stress barrier is consistent with the observation of the microseismic events of a horizontal well drilled and completed nearby, which reveals that no hydraulic fracture propagates downward through the bottom boundary of Marcellus Shale into the underlying Onondaga Limestone.

03 NATURAL GAS↗

DOE OSTI2020

Multiresolution GPC-Structured Control of a Single-Loop Cold-Flow Chemical Looping Testbed

Chemical looping is a near-zero emission process for generating power from coal. It is based on a multi-phase gas-solid flow and has extremely challenging nonlinear, multi-scale dynamics with jumps, producing large dynamic model uncertainty, which renders traditional robust control techniques, such as linear parameter varying H ∞ design, largely inapplicable. This process complexity is addressed in the present work through the temporal and the spatiotemporal multiresolution modeling along with the corresponding model-based control laws. Namely, the nonlinear autoregressive with exogenous input model structure, nonlinear in the wavelet basis, but linear in parameters, is used to identify the dominant temporal chemical looping process dynamics. The control inputs and the wavelet model parameters are calculated by optimizing a quadratic cost function using a gradient descent method. The respective identification and tracking error convergence of the proposed self-tuning identification and control schemes, the latter using the unconstrained generalized predictive control structure, is separately ascertained through the Lyapunov stability theorem. The rate constraint on the control signal in the temporal control law is then imposed and the control topology is augmented by an additional control loop with self-tuning deadbeat controller which uses the spatiotemporal wavelet riser dynamics representation. The novelty of this work is three-fold: (1) developing the self-tuning controller design methodology that consists in embedding the real-time tunable temporal highly nonlinear, but linearly parametrizable, multiresolution system representations into the classical rate-constrained generalized predictive quadratic optimal control structure, (2) augmenting the temporal multiresolution loop by a more complex spatiotemporal multiresolution self-tuning deadbeat control loop, and (3) demonstrating the effectiveness of the proposed methodology in producing fast recursive real-time algorithms for controlling highly uncertain nonlinear multiscale processes. The latter is shown through the data from the implemented temporal and augmented spatiotemporal solutions of a difficult chemical looping cold flow tracking control problem.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2023

Development of New Magnetron Sputter Deposition Processes for Laser Target Fabrication

Magnetron sputter deposition is an enabling technology for laser target fabrication. Solutions are readily available for the deposition of most sub-micron-thick elemental films on planar substrates. However, major challenges still remain for the development of robust deposition processes in regimes of ultrathick (over ~10 μm) coatings and nonplanar substrates. These challenging deposition regimes are directly relevant to laser target applications, including both sphero-cylindrical hohlraums and spherical ablators for inertial confinement fusion (ICF) targets. Understanding underlying physical mechanisms for a specific material system is crucial for process development, given the overall complexity of the deposition process, its nonlinear dependence on deposition parameters, and a very large process space, often precluding conventional process optimization approaches. Here, we describe our approach to developing new deposition processes and give practical advice with examples of new results from our ongoing studies of glassy boron carbide ceramics for next-generation ICF ablators and nonequilibrium gold-tantalum alloys for hohlraums for magnetized ICF schemes. Emphasis is given to two major challenges of ultrathick coatings related to achieving process stability and reducing residual stress.

36 MATERIALS SCIENCE↗

DOE OSTI2021

Clogging, dynamics, and reentrant fluid for active matter on periodic substrates

Here, we examine the collective states of run-and-tumble active matter disks driven over a periodic obstacle array. When the drive is applied along a symmetry direction of the array, we find a clog-free uniform liquid state for low activity, while at higher activity, the density becomes increasingly heterogeneous and an active clogged state emerges in which the mobility is strongly reduced. For driving along nonsymmetry or incommensurate directions, there are two different clogging behaviors consisting of a drive-dependent clogged state in the low activity thermal limit and a drive-independent clogged state at high activity. These regimes are separated by a uniform flowing liquid at intermediate activity. There is a critical activity level above which the thermal clogged state does not occur, as well as an optimal activity level that maximizes the disk mobility. Thermal clogged states are dependent on the driving direction while active clogged states are not. In the low activity regime, diluting the obstacles produces a monotonic increase in the mobility; however, for large activities, the mobility is more robust against obstacle dilution. We also examine the velocity-force curves for driving along nonsymmetry directions and find that they are linear when the activity is low or intermediate but become nonlinear at high activity and show behavior similar to that found for the plastic depinning of solids. At higher drives, the active clustering is lost. For low activity, we also find a reentrant fluid phase, where the system transitions from a high mobility fluid at low drives to a clogged state at higher drives and then back into another fluid phase at very high drives. We map the regions in which the thermally clogged, partially clogged, active uniform fluid, clustered fluid, active clogged, and directionally locked states occur as a function of disk density, drift force, and activity.

36 MATERIALS SCIENCE↗

DOE OSTI2024

Divide and conquer: Learning chaotic dynamical systems with multistep penalty neural ordinary differential equations

Forecasting high-dimensional dynamical systems is a fundamental challenge in various fields, such as geosciences and engineering. Neural Ordinary Differential Equations (NODEs), which combine the power of neural networks and numerical solvers, have emerged as a promising algorithm for forecasting complex nonlinear dynamical systems. However, classical techniques used for NODE training are ineffective for learning chaotic dynamical systems. In this work, we propose a novel NODE-training approach that allows for robust learning of chaotic dynamical systems. Here, our method addresses the challenges of non-convexity and exploding gradients associated with underlying chaotic dynamics. Training data trajectories from such systems are split into multiple, non-overlapping time windows. In addition to the deviation from the training data, the optimization loss term further penalizes the discontinuities of the predicted trajectory between the time windows. The window size is selected based on the fastest Lyapunov time scale of the system. Multi-step penalty(MP) method is first demonstrated on Lorenz equation, to illustrate how it improves the loss landscape and thereby accelerates the optimization convergence. MP method can optimize chaotic systems in a manner similar to least-squares shadowing with significantly lower computational costs. Our proposed algorithm, denoted the Multistep Penalty NODE, is applied to chaotic systems such as the Kuramoto-Sivashinsky equation, the two-dimensional Kolmogorov flow, and ERA5 reanalysis data for the atmosphere. It is observed that MP-NODE provide viable performance for such chaotic systems, not only for short-term trajectory predictions but also for invariant statistics that are hallmarks of the chaotic nature of these dynamics.

Chaotic dynamical systems↗