Global optimization approach to nonlinear optimal control

To determine the optimum in nonlinear optimal control problems, it is proposed to convert the continuous problems into a form suitable for nonlinear programming (NLP). Since the resulting finite-dimensional NLP problems can present multiple local optima, a global optimization approach is developed where random starting conditions are improved by using special line searches. The efficiency, speed, and reliability of the proposed approach is examined by using two examples.Financial support from the Natural Science and Engineering Research Council under Grant A-3515 as well as an Ontario Graduate Scholarship are gratefully acknowledged. All the computations were done with the facilities of the University of Toronto Computer Centre and the Ontario Centre for Large Scale Computations.     

Modeling and Performance Optimization of an Irreversible Two-Stage Combined Thermal Brownian Heat Engine

Based on finite time thermodynamics, an irreversible combined thermal Brownian heat engine model is established in this paper. The model consists of two thermal Brownian heat engines which are operating in tandem with thermal contact with three heat reservoirs. The rates of heat transfer are finite between the heat engine and the reservoir. Considering the heat leakage and the losses caused by kinetic energy change of particles, the formulas of steady current, power output and efficiency are derived. The power output and efficiency of combined heat engine are smaller than that of single heat engine operating between reservoirs with same temperatures. When the potential filed is free from external load, the effects of asymmetry of the potential, barrier height and heat leakage on the performance of the combined heat engine are analyzed. When the potential field is free from external load, the effects of basic design parameters on the performance of the combined heat engine are analyzed. The optimal power and efficiency are obtained by optimizing the barrier heights of two heat engines. The optimal working regions are obtained. There is optimal temperature ratio which maximize the overall power output or efficiency. When the potential filed is subjected to external load, effect of external load is analyzed. The steady current decreases versus external load; the power output and efficiency are monotonically increasing versus external load.     

Intelligent Fault Identification for Rolling Bearings Fusing Average Refined Composite Multiscale Dispersion Entropy-Assisted Feature Extraction and SVM with Multi-Strategy Enhanced Swarm Optimization

Rolling bearings act as key parts in many items of mechanical equipment and any abnormality will affect the normal operation of the entire apparatus. To diagnose the faults of rolling bearings effectively, a novel fault identification method is proposed by merging variational mode decomposition (VMD), average refined composite multiscale dispersion entropy (ARCMDE) and support vector machine (SVM) optimized by multistrategy enhanced swarm optimization in this paper. Firstly, the vibration signals are decomposed into different series of intrinsic mode functions (IMFs) based on VMD with the center frequency observation method. Subsequently, the proposed ARCMDE, fusing the superiorities of DE and average refined composite multiscale procedure, is employed to enhance the ability of the multiscale fault-feature extraction from the IMFs. Afterwards, grey wolf optimization (GWO), enhanced by multistrategy including levy flight, cosine factor and polynomial mutation strategies (LCPGWO), is proposed to optimize the penalty factor C and kernel parameter g of SVM. Then, the optimized SVM model is trained to identify the fault type of samples based on features extracted by ARCMDE. Finally, the application experiment and contrastive analysis verify the effectiveness of the proposed VMD-ARCMDE-LCPGWO-SVM method.     

Application of Euler Neural Networks with Soft Computing Paradigm to Solve Nonlinear Problems Arising in Heat Transfer

In this study, a novel application of neurocomputing technique is presented for solving nonlinear heat transfer and natural convection porous fin problems arising in almost all areas of engineering and technology, especially in mechanical engineering. The mathematical models of the problems are exploited by the intelligent strength of Euler polynomials based Euler neural networks (ENN’s), optimized with a generalized normal distribution optimization (GNDO) algorithm and Interior point algorithm (IPA). In this scheme, ENN’s based differential equation models are constructed in an unsupervised manner, in which the neurons are trained by GNDO as an effective global search technique and IPA, which enhances the local search convergence. Moreover, a temperature distribution of heat transfer and natural convection porous fin are investigated by using an ENN-GNDO-IPA algorithm under the influence of variations in specific heat, thermal conductivity, internal heat generation, and heat transfer rate, respectively. A large number of executions are performed on the proposed technique for different cases to determine the reliability and effectiveness through various performance indicators including Nash–Sutcliffe efficiency (NSE), error in Nash–Sutcliffe efficiency (ENSE), mean absolute error (MAE), and Thiel’s inequality coefficient (TIC). Extensive graphical and statistical analysis shows the dominance of the proposed algorithm with state-of-the-art algorithms and numerical solver RK-4.     

Studies on controllability of directed networks with extremal optimization

Almost all natural, social and man-made-engineered systems can be represented by a complex network to describe their dynamic behaviors. To make a real-world complex network controllable with its desired topology, the study on network controllability has been one of the most critical and attractive subjects for both network and control communities. In this paper, based on a given directed–weighted network with both state and control nodes, a novel optimization tool with extremal dynamics to generate an optimal network topology with minimum control nodes and complete controllability under Kalman’s rank condition has been developed. The experimental results on a number of popular benchmark networks show the proposed tool is effective to identify the minimum control nodes which are sufficient to guide the whole network’s dynamics and provide the evolution of network topology during the optimization process. We also find the conclusion: “the sparse networks need more control nodes than the dense, and the homogeneous networks need fewer control nodes compared to the heterogeneous” (Liu et al., 2011  [18]), is also applicable to network complete controllability. These findings help us to understand the network dynamics and make a real-world network under the desired control. Moreover, compared with the relevant research results on structural controllability with minimum driver nodes, the proposed solution methodology may also be applied to other constrained network optimization problems beyond complete controllability with minimum control nodes.     

Magnetic resonance image reconstruction using trained geometric directions in 2D redundant wavelets domain and non-convex optimization

Reducing scanning time is significantly important for MRI. Compressed sensing has shown promising results by undersampling the k-space data to speed up imaging. Sparsity of an image plays an important role in compressed sensing MRI to reduce the image artifacts. Recently, the method of patch-based directional wavelets (PBDW) which trains geometric directions from undersampled data has been proposed. It has better performance in preserving image edges than conventional sparsifying transforms. However, obvious artifacts are presented in the smooth region when the data are highly undersampled. In addition, the original PBDW-based method does not hold obvious improvement for radial and fully 2D random sampling patterns. In this paper, the PBDW-based MRI reconstruction is improved from two aspects: 1) An efficient non-convex minimization algorithm is modified to enhance image quality; 2) PBDW are extended into shift-invariant discrete wavelet domain to enhance the ability of transform on sparsifying piecewise smooth image features. Numerical simulation results on vivo magnetic resonance images demonstrate that the proposed method outperforms the original PBDW in terms of removing artifacts and preserving edges.     

Connectedness of efficient solution sets for set-valued maps in normed spaces

In vector optimization, the topological properties of the set of efficient solutions are of interest. Several authors have studied this topic for point-valued functions. In this paper, we study the connectedness of the efficient solution sets in convex vector optimization for set-valued maps in normed spaces.The author would like to thank Professor W. T. Fu for helpful discussions concerning Theorem 3.1 and other valuable comments. Moreover, the author is grateful to Professor H. P. Benson and three referees for valuable remarks and suggestions concerning a previous draft of this paper.     

Computational experience with known variable metric updates

Variable metric methods from the Broyden family are well known and commonly used for unconstrained minimization. These methods have good theoretical and practical convergence properties which depend on a selection of free parameters. We demonstrate, using extensive computational experiments, the influence of both the Biggs stabilization parameter and Oren scaling parameter on 12 individual variable metric updates, two of which are new. This paper focuses on a class of variable metric updates belonging to the so-called preconvex part of the Broyden family. These methods outperform the more familiar BFGS method. We also experimentally demonstrate the efficiency of the controlled scaling strategy for problems of sufficient size and sparsity.     

Using stochastic optimization to determine threshold values for the control of unreliable manufacturing systems

A manufacturing system with two tandem machines producing one part type is considered in this work. The machines are unreliable, each having two states, up and down. Both surplus controls and Kanban systems are considered. Algorithms for approximating the optimal threshold values are developed. First, perturbation analysis techniques are employed to obtain consistent gradient estimates based on a single simulation run. Then, iterative algorithms of the stochastic optimization type are constructed. It is shown that the algorithms converge to the optimal threshold values in an appropriate sense. Numerical examples are provided to demonstrate the performance of the algorithms.The research of these authors was supported in part by grants from URIF, MRCO, National Science Foundation, and Wayne State University. The authors would like to thank Dr. X. R. Cao, Digital Equipment Corporation, for the valuable initial discussion and Dr. X. Y. Zhou, University of Toronto, for his helpful comments.