Search NASA⌕ Search

SEARCH · Search NASA

Results for “nonlinear global optimization”

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

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

At least 91 records · Page 5

Structural, vibrational spectroscopic and nonlinear optical activity studies on 2-hydroxy- 3, 5-dinitropyridine: A DFT approach

The conformational analysis was carried out for 2-Hydroxy- 3, 5-dinitropyridine molecule using potential energy surface scan and the most stable optimized conformer was predicted. The vibrational frequencies and Mulliken atomic charge distribution were calculated for the optimized geometry of the molecule using DFT/B3LYP cc-pVQZ basis set by Gaussian 09 Program. The vibrational frequencies were assigned on the basis of potential energy distribution calculation using VEDA 4.0 program. In the Frontier molecular orbitals analysis, the molecular reactivity, kinetic stability, intramolecular charge transfer studies and the calculation of ionization energy, electron affinity, global hardness, chemical potential, electrophilicity index and softness values of the title molecule were carried out. The nonlinear optical activity of the molecule was studied by means of first order hyperpolarizability, which was computed as 7.64 times greater than urea. The natural bond orbital analysis was performed to confirm the nonlinear optical activity of the molecule.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Regulation of Dynamical Systems to Optimal Solutions of Semidefinite Programs: Algorithms and Applications to AC Optimal Power Flow

This paper considers a collection of networked nonlinear dynamical systems, and addresses the synthesis of feedback controllers that seek optimal operating points corresponding to the solution of pertinent network-wide optimization problems. Particular emphasis is placed on the solution of semidefinite programs (SDPs). The design of the feedback controller is grounded on a dual e-subgradient approach, with the dual iterates utilized to dynamically update the dynamical-system reference signals. Global convergence is guaranteed for diminishing stepsize rules, even when the reference inputs are updated at a faster rate than the dynamical-system settling time. The application of the proposed framework to the control of power-electronic inverters in AC distribution systems is discussed. The objective is to bridge the time-scale separation between real-time inverter control and network-wide optimization. Optimization objectives assume the form of SDP relaxations of prototypical AC optimal power flow problems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Data-Driven Robust M-LS-SVR-Based NARX Modeling for Estimation and Control of Molten Iron Quality Indices in Blast Furnace Ironmaking

Optimal operation of an industrial blast furnace (BF) ironmaking process largely depends on a reliable measurement of molten iron quality (MIQ), which is not feasible using the conventional sensors. This paper proposes a novel data-driven robust modeling method for online estimation and control of MIQ indices. First, to completely capture the nonlinear dynamics of the BF process, the nonlinear autoregressive exogenous (NARX) model is constructed for the MIQ indices. Then, considering that the standard least-squares support vector regression (LS-SVR) cannot directly cope with the multi-output problem, the multi- task transfer learning is proposed to design a novel multi-output LS-SVR (M-LS-SVR) for learning of the NARX model. Furthermore, a novel M-estimator is proposed to reduce the interference of outliers and improve the robustness of the M-LS- SVR model. Since the weights of different outlier data are properly given by the weight function, their corresponding contributions on modeling can be properly distinguished, thus a robust modeling result can be achieved. Finally, a novel multi- objective evaluation index on modeling performance is developed by comprehensively considering the root mean square error of modeling and the correlation coefficient on trend fitting, based on which the NSGA-II algorithm is used to globally optimize the model parameters. Both experiments using industrial data and industrial applications illustrate that the proposed method can eliminate the adverse effect caused by the fluctuation of data in BF process efficiently, which indicates its stronger robustness and higher accuracy. Moreover, control testing shows that the developed model can be well applied to realize data-driven control of the BF process.

blast cavities, Control↗

Vibrational spectroscopic, structural and nonlinear optical activity studies on 2-amino-3-chloro-5-trifluoromethyl pyridine: A DFT approach

The conformational analysis was carried out for 2-amino-3-chloro-5-trifluoromethylpyridine using potential energy surface (PES) scan and the most stable optimized conformer was predicted. The theoretical vibrational frequencies were calculated for the optimized geometry using DFT/B3LYP cc-pVQZ basis set by Gaussian 09 Program. The vibrational frequencies were assigned on the basis of potential energy distribution calculation using VEDA 4.0 program package. The Mulliken atomic charge values were calculated. In the Frontier molecular orbitals analysis, the molecular reactivity, kinetic stability, intermolecular charge transfer studies and the calculation of ionization energy, electron affinity, global hardness, chemical potential, electrophilicity index and softness of the molecule were carried out. The nonlinear optical (NLO) activity was studied and the first order hyperpolarizability value was computed, which was 3.48 times greater than the urea. The natural bond orbital analysis was also performed to confirm the NLO activity of the molecule. Hence, the ACTP molecule is a promising candidate for NLO materials.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Sequence of polyhedral relaxations for nonlinear univariate functions

Here, given a nonlinear, univariate, bounded, and differentiable function f(x), this article develops a sequence of Mixed Integer Linear Programming (MILP) and Linear Programming (LP) relaxations that converge to the graph of f(x) and its convex hull, respectively. Theoretical convergence of the sequence of relaxations to the graph of the function and its convex hull is established. For nonlinear non-convex optimization problems, the relaxations presented in this article can be used to construct tight MILP and LP relaxations. These MILP and the LP relaxations can also be used with MILP-based and spatial branch-and-bound based global optimization algorithms, respectively.

42 ENGINEERING↗

A new modified BFGS method for unconstrained optimization problems

Using chain rule, we propose a modified secant equation to get a more accurate approximation of the second curvature of the objective function. Then, based on this modified secant equation we present a new BFGS method for solving unconstrained optimization problems. The proposed method makes use of both gradient and function values, and utilizes information from two most recent steps, while the usual secant relation uses only the latest step information. Under appropriate conditions, we show that the proposed method is globally convergent without convexity assumption on the objective function. Comparative numerical results show computational efficiency of the proposed method in the sense of the Dolan–Moré performance profiles.

97 MATHEMATICS AND COMPUTING↗

A global stochastic programming approach for the optimal placement of gas detectors with nonuniform unavailabilities

Optimal design of a gas detection systems is challenging because of the numerous sources of uncertainty, including weather and environmental conditions, leak location and characteristics, and process conditions. Rigorous CFD simulations of dispersion scenarios combined with stochastic programming techniques have been successfully applied to the problem of optimal gas detector placement; however, rigorous treatment of sensor failure and nonuniform unavailability has received less attention. To improve reliability of the design, this paper proposes a problem formulation that explicitly considers nonuniform unavailabilities and all backup detection levels. The resulting sensor placement problem is a large-scale mixed-integer nonlinear programming (MINLP) problem that requires a tailored solution approach for efficient solution. We have developed a multitree method which depends on iteratively solving a sequence of upper-bounding master problems and lower-bounding subproblems. The tailored global solution strategy is tested on a real data problem and the encouraging numerical results indicate that our solution framework is promising in solving sensor placement problems. This study was selected for the special issue in JLPPI from the 2016 International Symposium of the MKO Process Safety Center.

47 OTHER INSTRUMENTATION↗

A Flexible Variable Truncated Power Series Algebra in Zlib

Zlib is a numerical library for Truncated Power Series Algebra (TPSA) and Lie Algebra for application to nonlinear analysis of single particle dynamics. The first version was developed in 1990 with the use of the One-Step Index Pointers (OSIP's). The OSIP's form the Zlib nerve that offers optimal computation and alloworder grading as well as flexible initialization of the global number of variables for the TPSA. While the OSIP's are still kept for minimum index passing to achieve efficient computation, Zlib has been being upgraded to allow flexible and gradable local number of variables in each C++ object of the Truncated Power Series (Tps) class. Possible applications using Zlib are discussed.

43 PARTICLE ACCELERATORS↗

Machine Learning-Guided Approach for Studying Solvation Environments

Molecular-level understanding and characterization of solvation environments are often needed across chemistry, biology, and engineering. Toward practical modeling of local solvation effects of any solute in any solvent, in this work, we report a static and all-quantum mechanics-based cluster-continuum approach for calculating single-ion solvation free energies. This approach uses a global optimization procedure to identify low-energy molecular clusters with different numbers of explicit solvent molecules and then employs the smooth overlap for atomic positions learning kernel to quantify the similarity between different low-energy solute environments. From these data, we use sketch maps, a nonlinear dimensionality reduction algorithm, to obtain a two-dimensional visual representation of the similarity between solute environments in differently sized microsolvated clusters. After testing this approach on different ions having charges 2+, 1+, 1–, and 2–, we find that the solvation environment around each ion can be seen to usually become more similar in hand with its calculated single-ion solvation free energy. Without needing either dynamics simulations or an a priori knowledge of local solvation structure of the ions, this approach can be used to calculate solvation free energies within 5% of experimental measurements for most cases, and it should be transferable for the study of other systems where dynamics simulations are not easily carried out.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Local chromatic correction optics for Future Circular Collider e + e −

Local chromatic correction optics are proposed for the Future Circular e + − e − Collider. These new optics assume an identical layout of the magnets at all operation energies and include a new design for the arcs, for the straight sections, and for the final focus. The arcs design is a step forward from the classic FODO lattice that achieves near cancellation up to the fourth order of chromatic and geometric aberrations. Straight sections and the final focus benefit from the application of transparency conditions and are thus minimally impacting the global beam dynamics. The final focus design includes both vertical and horizontal chromaticity correction sections, crab sextupoles, and additional specific sextupoles and decapoles for the optimization of the dynamics off-energy. Decapoles are very effective in mitigating the reduction of dynamic aperture due to synchrotron radiation. Nonlinear magnet settings are further optimized with multiobjective algorithms. The overall properties of the new optics proposed are analyzed in the presence of errors and compared to other optics designs.

43 PARTICLE ACCELERATORS↗

Neural Networks to Find the Optimal Forcing for Offsetting the Anthropogenic Climate Change Effects

Abstract Of great relevance to climate engineering is the systematic relationship between the radiative forcing to the climate system and the response of the system, a relationship often represented by the linear response function (LRF) of the system. However, estimating the LRF often becomes an ill-posed inverse problem due to high-dimensionality and nonunique relationships between the forcing and response. Recent advances in machine learning make it possible to address the ill-posed inverse problem through regularization and sparse system fitting. Here, we develop a convolutional neural network (CNN) for regularized inversion. The CNN is trained using the surface temperature responses from a set of Green’s function perturbation experiments as imagery input data together with data sample densification. The resulting CNN model can infer the forcing pattern responsible for the temperature response from out-of-sample forcing scenarios. This promising proof of concept suggests a possible strategy for estimating the optimal forcing to negate certain undesirable effects of climate change. The limited success of this effort underscores the challenges of solving an inverse problem for a climate system with inherent nonlinearity. Significance Statement Predicting the climate response for a given climate forcing is a direct problem, while inferring the forcing for a given desired climate response is often an inverse, ill-posed, problem, posing a new challenge to the climate community. This study makes the first attempt to infer the radiative forcing for a given target pattern of global surface temperature response using a deep learning approach. The resulting deeply trained convolutional neural network inversion model shows promise in capturing the forcing pattern corresponding to a given surface temperature response, with a significant implication on the design of an optimal solar radiation management strategy for curbing global warming. This study also highlights the technical challenges that future research should prioritize in seeking feasible solutions to the inverse climate problem.

Ren, Huiying↗

A unified funnel restoration SQP algorithm

We consider nonlinearly constrained optimization problems and discuss a generic double-loop framework consisting of basic algorithmic ingredients that unifies a broad range of nonlinear optimization solvers. This framework has been implemented in the open-source solver Uno, a Swiss Army knife-like C++ optimization framework that unifies many nonlinearly constrained nonconvex optimization solvers. We illustrate the framework with a sequential quadratic programming (SQP) algorithm that maintains an acceptable upper bound on the constraint violation, called a funnel, that is monotonically decreased to control the feasibility of the iterates. Infeasible quadratic subproblems are handled by a feasibility restoration strategy. Globalization is controlled by a line search or a trust-region method. We prove global convergence of the trust-region funnel SQP method, building on known results from filter methods. We implement the algorithm in Uno, and we provide extensive test results for the trust-region line-search funnel SQP on small CUTEst instances.

Kiessling, David [Katholieke Univ. Leuven, Heverle↗

Automated identification of dominant physical processes

The identification of processes that locally and approximately dominate dynamical system behavior has enabled significant advances in understanding and modeling nonlinear differential dynamical systems. Conventional methods of dominant process identification involve piecemeal and ad hoc (non-rigorous, informal) scaling analyses to identify dominant balances of governing equation terms and to delineate the spatiotemporal boundaries (boundaries in space and/or time) of each dominant balance. For the first time, we present an objective global measure of the fit of dominant balances to observations, which is desirable for automation, and was previously undefined. Furthermore, we propose a formal definition of the dominant balance identification problem in the form of an optimization problem. Here, we show that the optimization can be performed by various machine learning algorithms, enabling the automatic identification of dominant balances. Our method is algorithm agnostic and it eliminates reliance upon expert knowledge to identify dominant balances which are not known beforehand.

42 ENGINEERING↗

Generalized optimization-based synthesis of membrane systems for multicomponent gas mixture separation

Synthesizing a membrane system to separate multicomponent gas mixture is challenging due to the combinatorial number of feasible configurations and the difficulties in describing the multicomponent permeators. Here we present a mixed-integer nonlinear programming (MINLP) model for synthesizing membrane systems for multicomponent gas mixture separation. The approach employs a richly connected superstructure to represent numerous potential system configurations, and different physics-based surrogate permeator models, such as countercurrent flow or crossflow, to be used in each stage. Moreover, to describe realistic systems, pressure drop equations can be included. We also present solution methods to accelerate the solution process. Through a case study of natural gas sweetening, we demonstrate that the proposed approach is able to obtain good solutions using an off-the-shelf global optimization solver. Finally, we expand the conventional membrane system synthesis problem by introducing feed variability in our model through a case study of an integrated reactor-separation system.

42 ENGINEERING↗

A Fast Temporal Decomposition Procedure for Long-Horizon Nonlinear Dynamic Programming

We propose a fast temporal decomposition procedure for solving long-horizon nonlinear dynamic programs. The core of the procedure is sequential quadratic programming (SQP) that utilizes a differentiable exact augmented Lagrangian as the merit function. Within each SQP iteration, we approximately solve the Newton system using an overlapping temporal decomposition strategy. We show that the approximate search direction is still a descent direction of the augmented Lagrangian provided the overlap size and penalty parameters are suitably chosen, which allows us to establish the global convergence. Moreover, we show that a unit step size is accepted locally for the approximate search direction and further establish a uniform, local linear convergence over stages. This local convergence rate matches the rate of the recent Schwarz scheme (Na et al. 2022). However, the Schwarz scheme has to solve nonlinear subproblems to optimality in each iteration, whereas we only perform a single Newton step instead. Numerical experiments validate our theories and demonstrate the superiority of our method.

97 MATHEMATICS AND COMPUTING↗

An Incremental Gradient Method for Optimization Problems With Variational Inequality Constraints

We consider minimizing a sum of agent-specific nondifferentiable merely convex functions over the solution set of a variational inequality (VI) problem in that each agent is associated with a local monotone mapping. This problem finds an application in computation of the best equilibrium in nonlinear complementarity problems arising in transportation networks. We develop an iteratively regularized incremental gradient method where at each iteration, agents communicate over a directed cycle graph to update their solution iterates using their local information about the objective and the mapping. The proposed method is single-timescale in the sense that it does not involve any excessive hard-to-project computation per iteration. We derive nonasymptotic agent-wise convergence rates for the suboptimality of the global objective function and infeasibility of the VI constraints measured by a suitably defined dual gap function. Finally, the proposed method appears to be the first fully iterative scheme equipped with iteration complexity that can address distributed optimization problems with VI constraints over cycle graphs.

convergence↗

Global optimization of harmonic oscillator basis in covariant density functional theory

The present investigation focuses on the improvement of the accuracy of the description of binding energies within moderately sized fermionic basis. Using the solutions corresponding to infinite fermionic basis it was shown that in the case of meson exchange (ME) covariant energy density functionals (CEDFs) the global accuracy of the description of binding energies in the finite $N_F$ = 16 - 20 bases can be drastically (by a factor ranging from ~3 up to ~9 dependent on the functional and $N_F$) improved by a global optimization of oscillator frequency of the basis. This is a consequence of the unique feature of the ME functionals in which with increasing fermionic basis size fermionic and mesonic energies approach the exact (infinite basis) solution from above and below, respectively. As a consequence, an optimal oscillator frequency $\hbar\omega_0$ of the basis can be defined which provides an accurate reproduction of exact total binding energies by the ones calculated in truncated basis. This leads to a very high accuracy of the calculations in moderately sized $N_F=20$ basis when mass dependent oscillator frequency is used: global rms differences $\delta B_{rms}$ between the binding energies calculated in infinite and truncated bases are only 0.025 MeV and 0.031 MeV for the NL5(Z) and DD-MEZ functionals, respectively. Optimized values of the oscillator frequency $\hbar\omega_0$ are provided for three major classes of CEDFs, i.e. for density dependent meson exchange functionals, nonlinear meson exchange ones and point coupling functionals.

Binding energy & masses↗

A Framework for Parallel Nonlinear Optimization by Partitioning Localized Constraints

We present a novel parallel framework for solving large-scale continuous nonlinear optimization problems based on constraint partitioning. The framework distributes constraints and variables to parallel processors and uses an existing solver to handle the partitioned subproblems. In contrast to most previous decomposition methods that require either separability or convexity of constraints, our approach is based on a new constraint partitioning theory and can handle nonconvex problems with inseparable global constraints. We also propose a hypergraph partitioning method to recognize the problem structure. Experimental results show that the proposed parallel algorithm can efficiently solve some difficult test cases.

97 MATHEMATICS AND COMPUTING↗