An Innovative Genetic Algorithms-Based Inexact Non-Linear Programming Problem Solving Method

In this paper, an innovative Genetic Algorithms (GA)-based inexact non-linear programming (GAINLP) problem solving approach has been proposed for solving non-linear programming optimization problems with inexact information (inexact non-linear operation programming). GAINLP was developed based on a GA-based inexact quadratic solving method. The Genetic Algorithm Solver of the Global Optimization Toolbox (GASGOT) developed by MATLABTM was adopted as the implementation environment of this study. GAINLP was applied to a municipality solid waste management case. The results from different scenarios indicated that the proposed GA-based heuristic optimization approach was able to generate a solution for a complicated nonlinear problem, which also involved uncertainty.

Modified Levenberg-Marquardt algorithm for source localization using AOAs in the presence of sensor location errors

In this paper,by utilizing the angle of arrivals(AOAs) and imprecise positions of the sensors,a novel modified Levenberg-Marquardt algorithm to solve the source localization problem is proposed.Conventional source localization algorithms,like Gauss-Newton algorithm and Conjugate gradient algorithm are subjected to the problems of local minima and good initial guess.This paper presents a new optimization technique to find the descent directions to avoid divergence,and a trust region method is introduced to accelerate the convergence rate.Compared with conventional methods,the new algorithm offers increased stability and is more robust,allowing for stronger non-linearity and wider convergence field to be identified.Simulation results demonstrate that the proposed algorithm improves the typical methods in both speed and robustness,and is able to avoid local minima.

Fast Fading Channel Neural Equalization Using Levenberg-Marquardt Training Algorithm and Pulse Shaping Filters

Artificial Neural Network (ANN) equalizers have been successfully applied to mitigate Inter symbolic Interference (ISI) due to distortions introduced by linear or nonlinear communication channels. The ANN architecture is chosen according to the type of ISI produced by fixed, fast or slow fading channels. In this work, we propose a combination of two techniques in order to minimize ISI yield by fast fading channels, i.e., pulse shape filtering and ANN equalizer. Levenberg-Marquardt algorithm is used to update the synaptic weights of an ANN comprise only by two recurrent perceptrons. The proposed system outperformed more complex structures such as those based on Kalman filtering approach.

Design Optimization of Permanent Magnet Eddy Current Coupler Based on an Intelligence Algorithm

The permanent magnet eddy current coupler(PMEC)solves the problem of flexible connection and speed regulation between the motor and the load and is widely used in electrical transmission systems.It provides torque to the load and generates heat and losses,reducing its energy transfer efficiency.This issue has become an obstacle for PMEC to develop toward a higher power.This paper aims to improve the overall performance of PMEC through multi-objective optimization methods.Firstly,a PMEC modeling method based on the Levenberg-Marquardt back propagation(LMBP)neural network is proposed,aiming at the characteristics of the complex input-output relationship and the strong nonlinearity of PMEC.Then,a novel competition mechanism-based multi-objective particle swarm optimization algorithm(NCMOPSO)is proposed to find the optimal structural parameters of PMEC.Chaotic search and mutation strategies are used to improve the original algorithm,which improves the shortcomings of multi-objective particle swarm optimization(MOPSO),which is too fast to converge into a global optimum,and balances the convergence and diversity of the algorithm.In order to verify the superiority and applicability of the proposed algorithm,it is compared with several popular multi-objective optimization algorithms.Applying them to the optimization model of PMEC,the results show that the proposed algorithm has better comprehensive performance.Finally,a finite element simulation model is established using the optimal structural parameters obtained by the proposed algorithm to verify the optimization results.Compared with the prototype,the optimized PMEC has reduced eddy current losses by 1.7812 kW,increased output torque by 658.5 N·m,and decreased costs by 13%,improving energy transfer efficiency.

AN INEXACT PROXIMAL DC ALGORITHM FOR THE LARGE-SCALE CARDINALITY CONSTRAINED MEAN-VARIANCE MODEL IN SPARSE PORTFOLIO SELECTION

Optimization problem of cardinality constrained mean-variance(CCMV)model for sparse portfolio selection is considered.To overcome the difficulties caused by cardinality constraint,an exact penalty approach is employed,then CCMV problem is transferred into a difference-of-convex-functions(DC)problem.By exploiting the DC structure of the gained problem and the superlinear convergence of semismooth Newton(ssN)method,an inexact proximal DC algorithm with sieving strategy based on a majorized ssN method(siPDCA-mssN)is proposed.For solving the inner problems of siPDCA-mssN from dual,the second-order information is wisely incorporated and an efficient mssN method is employed.The global convergence of the sequence generated by siPDCA-mssN is proved.To solve large-scale CCMV problem,a decomposed siPDCA-mssN(DsiPDCA-mssN)is introduced.To demonstrate the efficiency of proposed algorithms,siPDCA-mssN and DsiPDCA-mssN are compared with the penalty proximal alternating linearized minimization method and the CPLEX(12.9)solver by performing numerical experiments on realword market data and large-scale simulated data.The numerical results demonstrate that siPDCA-mssN and DsiPDCA-mssN outperform the other methods from computation time and optimal value.The out-of-sample experiments results display that the solutions of CCMV model are better than those of other portfolio selection models in terms of Sharp ratio and sparsity.

Efficient Inverse Analysis for Solving a Coupled Conduction,Convection and Radiation Problem Involving Non⁃gray Participating Media

The presence of non-gray radiative properties in a reheating furnace’s medium that absorbs,emits,and involves non-gray creates more complex radiative heat transfer problems.Furthermore,it adds difficulty to solving the coupled conduction,convection,and radiation problem,leading to suboptimal efficiency that fails to meet real-time control demands.To overcome this difficulty,comparable gray radiative properties of non-gray media are proposed and estimated by solving an inverse problem.However,the required iteration numbers by using a least-squares method are too many and resulted in a very low inverse efficiency.It is necessary to present an efficient method for the equivalence.The Levenberg-Marquardt algorithm is utilized to solve the inverse problem of coupled heat transfer,and the gray-equivalent radiative characteristics are successfully recovered.It is our intention that the issue of low inverse efficiency,which has been observed when the least-squares method is employed,will be resolved.To enhance the performance of the Levenberg-Marquardt algorithm,a modification is implemented for determining the damping factor.Detailed investigations are also conducted to evaluate its accuracy,stability of convergence,efficiency,and robustness of the algorithm.Subsequently,a comparison is made between the results achieved using each method.

黎曼流形上的非精确信赖域算法

为求解黎曼流形上的大规模可分离问题,Kasai等人在(Advances of the neural information processing systems, 31, 2018)中提出了使用非精确梯度和非精确Hessian的黎曼信赖域算法,并给出了该算法的迭代复杂度(只有证明思路,没有具体证明)。我们指出在该文献的假设条件下,按照其思路不能证明出相应的结果。本文提出了不同的参数假设,并证明了算法具有类似的迭代复杂度。

关于非线性鞍点问题的一个新的非线性不精确Uzawa算法

本文针对非线性鞍点问题,借助于一个非线性映射,构造了一个新的非线性不精确Uzawa算法,该算法避免了传统Uzawa方法所必需的求逆运算.并通过精细分析得到了该算法在能量范数意义下收敛的充分条件,最后给出的数值实验验证了该方法的有效性.

Comparison of two kinds of approximate proximal point algorithms for monotone variational inequalities

This paper proposes two kinds of approximate proximal point algorithms （APPA） for monotone variational inequalities, both of which can be viewed as two extended versions of Solodov and Svaiter＇s APPA in the paper ＂Error bounds for proximal point subproblems and associated inexact proximal point algorithms＂ published in 2000. They are both prediction- correction methods which use the same inexactness restriction; the only difference is that they use different search directions in the correction steps. This paper also chooses an optimal step size in the two versions of the APPA to improve the profit at each iteration. Analysis also shows that the two APPAs are globally convergent under appropriate assumptions, and we can expect algorithm 2 to get more progress in every iteration than algorithm 1. Numerical experiments indicate that algorithm 2 is more efficient than algorithm 1 with the same correction step size,

一种非精确非光滑信赖域算法

Aravkin等人提出了求解非光滑优化问题min_(x∈R^(d))f(x)+h(x)的非光滑信赖域算法(采用f的精确梯度),其中f是连续可微函数,h是邻近有界且下半连续的真函数。文章研究当该问题中f:=1/n ∑_(i=1)^(n)f_(i)(n很大且每个分量函数fi是连续可微)时,求解这类大规模可分离非光滑优化问题的有效算法。结合非精确算法和非光滑信赖域算法的思想,提出了用非精确梯度代替精确梯度的非精确非光滑信赖域算法。与非光滑信赖域算法(采用精确梯度)相比,该算法降低了每次迭代的计算量。在一定的假设条件下,证明了算法的迭代复杂度。

Modified imperialist competitive algorithm-based neural network to determine shear strength of concrete beams reinforced with FRP

Fiber reinforced polymers (FRPs), unlike steel, are corrosion-resistant and therefore are of interest;however, their use is hindered because their brittle shear is formulated in most specifications using limited data available at the time. We aimed to predict the shear strength of concrete beams reinforced with FRP bars and without stirrups by compiling a relatively large database of 198 previously published test results (available in appendix). To model shear strength, an artificial neural network was trained by an ensemble of Levenberg-Marquardt and imperialist competitive algorithms. The results suggested superior accuracy of model compared to equations available in specifications and literature.

非精确光滑化Levenberg-Marquardt算法的局部收敛性

非精确Levenberg-Marquardt(L-M)算法是求解非光滑约束方程组的重要算法之一。在将非光滑约束方程组等价转化成无约束方程的基础上,该文针对一种新的非精确光滑化L-M算法,在局部误差界条件下,得到此算法具有超线性或二次收敛性质。

An Inexact Restoration Package for Bilevel Programming Problems

Bilevel programming problems are a class of optimization problems with hierarchical structure where one of the con-straints is also an optimization problem. Inexact restoration methods were introduced for solving nonlinear programming problems a few years ago. They generate a sequence of, generally, infeasible iterates with intermediate iterations that consist of inexactly restored points. In this paper we present a software environment for solving bilevel program-ming problems using an inexact restoration technique without replacing the lower level problem by its KKT optimality conditions. With this strategy we maintain the minimization structure of the lower level problem and avoid spurious solutions. The environment is a user-friendly set of Fortran 90 modules which is easily and highly configurable. It is prepared to use two well-tested minimization solvers and different formulations in one of the minimization subproblems. We validate our implementation using a set of test problems from the literature, comparing different formulations and the use of the minimization solvers.

Fuzzy optimization neural network model based on LM algorithm

A new fuzzy optimization neural network model is proposed based on the Levenberg-Marquardt (LM) algorithm on account of the disadvantages of slow convergence of traditional fuzzy optimization neural network model. In this new model,the gradient descent algorithm is replaced by the LM algorithm to obtain the minimum of output errors during network training,which changes the weights adjusting equations of the network and increases the training speed. Moreover,to avoid the results yielding to local minimum,the transfer function is also revised to sigmoid function. A case study is utilized to validate this new model,and the results reveal that the new model fast training speed and better forecasting capability.

An Algorithm for Cavity Reconstruction in Electrical Impedance Tomography

We consider the inverse problem of finding cavities within some object from electrostatic measurements on the boundary. By a cavity we understand any object with a different electrical conductivity from the background material of the body. We give an algorithm for solving this inverse problem based on the output nonlinear least-square formulation and the regularized Newton-type iteration. In particular, we present a number of numerical results to highlight the potential and the limitations of this method.

Spectral Analysis and Validation of Parietal Signals for Different Arm Movements

Brain signal analysis plays a significant role in attaining data related to motor activities.The parietal region of the brain plays a vital role in muscular movements.This approach aims to demonstrate a unique technique to identify an ideal region of the human brain that generates signals responsible for muscular movements;perform statistical analysis to provide an absolute characterization of the signal and validate the obtained results using a prototype arm.This can enhance the practical implementation of these frequency extractions for future neuro-prosthetic applications and the characterization of neurological diseases like Parkinson’s disease(PD).To play out this handling method,electroencepha-logram(EEG)signals are gained while the subject is performing different wrist and elbow movements.Then,the frontal brain signals and just the parietal signals are separated from the obtained EEG signal by utilizing a band pass filter.Then,feature extraction is carried out using Fast Fourier Transform(FFT).Subse-quently,the extraction process is done by Daubechies(db4)and Haar wavelet(db1)in MATLAB and classified using the Levenberg-Marquardt Algorithm.The results of the frequency changes that occurred during various wrist move-ments in the parietal region are compared with the frequency changes that occurred in frontal EEG signals.This proposed algorithm also uses the deep learn-ing pattern analysis network to evaluate the matching sequence for each action that takes place.Maximum accuracy of 97.2%and maximum error range of 0.6684%are achieved during the analysis.Results of this research confirm that the Levenberg-Marquardt algorithm,along with the newly developed deep learn-ing hybrid PatternNet,provides a more accurate range of frequency changes than any other classifier used in previous works of literature.Based on the analysis,the peak-to-peak value is used to define the threshold for the prototype arm,which performs all the intended degrees of freedom(DOF),verifying the results.These results would aid the specialists in their decision-making by facilitating the ana-lysis and interpretation of brain signals in the field of neuroscience,specifically in tremor analysis in PD.

求解张量绝对值方程的非精确LM方法

通过引入互补函数将张量绝对值问题重新表述为张量互补问题.针对重构的张量互补问题,建立了自适应非精确LM算法,并证明了算法的收敛性.数值实验结果表明所提出的算法是有效的.

一类保证充分下降性的YT型共轭梯度算法

基于施密特正交化与YT型共轭条件,给出一类修正的YT型共轭梯度算法。新算法的一个重要特性是产生的方向总是满足充分下降条件,且不依赖于任何线搜索。当使用精确线搜索时和合适的参数下,新算法退化为标准的HS方法。在一定条件下,作者证明算法在标准Wolfe线搜索条件下对于一致凸函数与一般函数具有全局收敛性。数值结果表明新算法具有优良的数值性能。

对等控制孤岛微电网的静态安全风险评估

间歇性可再生能源发电出力的随机性、波动性及缺乏主网的支撑,增大了孤岛微电网系统的安全稳定运行风险,由此有必要对其进行静态安全性评估。安全分析准则和潮流计算是电力系统静态安全风险评估的基础。针对对等控制孤岛微电网的特性,提出结合N-1事故与解列方案的静态安全分析准则;并计及故障解列后孤岛系统的无平衡节点特性及存在的不确定性因素,提出基于LMIL(Levenberg Marquardt method with inexact line-search)算法的随机潮流模拟法,计算解列孤岛系统的随机潮流,进而得到考虑频率越限风险的静态安全风险指标的概率分布,以更全面地评估系统的静态安全水平。以17节点孤岛微电网测试系统为算例,验证了所提评估方法的正确性和有效性。

经济开发区不确定性环境规划方法与应用研究

经济开发区是一种具有很强不确定性的系统 ,对它的环境规划一直是规划界面临的难题 .针对原有方法的缺陷 ,以经济开发区环境经济系统的集合性、多目标性、动态性和不确定性为出发点 ,提出了适用于经济开发区的环境经济系统规划方法框架 ,构造了不确定性多目标混合整数规划 (IMOMIP)模型 ,开发了相应的模型算法 。