Intelligent optimization algorithm for global convergence of non-convex functions based on improved fuzzy algorithm

被引:1
|
作者
Qiao, Junfeng [1 ]
Niu, Yujun [1 ]
Kifer, T. [2 ]
机构
[1] Nanyang Inst Technol, Sch Math & Stat, Nanyang 473004, Peoples R China
[2] Univ Alberta, Edmonton, AB, Canada
关键词
Improved fuzzy algorithm; non-convex function; global convergence; intelligence; optimization;
D O I
10.3233/JIFS-169765
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The traditional global convergence optimization algorithm is prone to premature convergence and slowconvergence in the face of complex non-convex function. To this end, a new intelligent optimization algorithm based on improved fuzzy algorithm for global convergence of non-convex function is proposed. The general model of the optimal problem is designed and the general model of non-convex function is established. The genetic algorithm is used to optimize the non-convex function, and the global convergence of the current non-convex function is analyzed. It is found that the global convergence of non-convex function is actually based on the optimization of crossover probability and mutation probability to decide the convergence of genetic algorithm, so as to improve the global convergence. A fuzzy controller is designed, which determines the input and output variables and their membership functions, establishes fuzzy rules and anti-fuzzing process to control the crossover rate. The fuzzy control of mutation rate is similar to the crossover rate, but the difference is that the new fuzzy control rule is needed. The experimental results show that the proposed algorithm can effectively optimize the global convergence of non-convex function.
引用
收藏
页码:4465 / 4473
页数:9
相关论文
共 50 条
  • [31] Non-convex global optimization with Gurman perturbation
    Chen, S. (daisyshuoshuo@sina.com), 1600, Science Press (41):
  • [32] Uniform Convergence of Gradients for Non-Convex Learning and Optimization
    Foster, Dylan J.
    Sekhari, Ayush
    Sridharan, Karthik
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 31 (NIPS 2018), 2018, 31
  • [33] Global Non-convex Optimization with Discretized Diffusions
    Erdogdu, Murat A.
    Mackey, Lester
    Shamir, Ohad
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 31 (NIPS 2018), 2018, 31
  • [35] A Global Optimization Approach to Non-Convex Problems
    Lu, Z. F.
    Lan, Y.
    PROCEEDINGS OF THE 2015 INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND INDUSTRIAL ENGINEERING (AIIE 2015), 2015, 123 : 449 - 452
  • [36] An Optimal Algorithm for Online Non-Convex Learning
    Yang, Lin
    Deng, Lei
    Hajiesmaili, Mohammad H.
    Tan, Cheng
    Wong, Wing Shing
    PROCEEDINGS OF THE ACM ON MEASUREMENT AND ANALYSIS OF COMPUTING SYSTEMS, 2018, 2 (02)
  • [37] A coverage algorithm for a class of non-convex regions
    Caicedo-Nunez, Carlos Humberto
    Zefran, Milos
    47TH IEEE CONFERENCE ON DECISION AND CONTROL, 2008 (CDC 2008), 2008, : 4244 - 4249
  • [38] Sparse Reconstruction Based Reweighted Non-convex Optimization Using Homotopy-DCD Algorithm
    Lu, Xinfei
    Wang, Tianyun
    Yu, Xiaofei
    Chen, Chang
    Chen, Weidong
    2014 INTERNATIONAL RADAR CONFERENCE (RADAR), 2014,
  • [39] An Optimal Algorithm for Online Non-Convex Learning
    Yang L.
    Deng L.
    Hajiesmaili M.H.
    Tan C.
    Wong W.S.
    2018, Association for Computing Machinery, 2 Penn Plaza, Suite 701, New York, NY 10121-0701, United States (46): : 41 - 43
  • [40] A dynamic genetic algorithm based on continuous neural networks for a kind of non-convex optimization problems
    Tao, Q
    Liu, X
    Xue, MS
    APPLIED MATHEMATICS AND COMPUTATION, 2004, 150 (03) : 811 - 820