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 条
  • [21] Global optimization of non-convex nonlinear programs using Line-up Competition Algorithm
    Yan, LX
    Ma, DX
    COMPUTERS & CHEMICAL ENGINEERING, 2001, 25 (11-12) : 1601 - 1610
  • [22] Non-convex polygons clustering algorithm
    Kruglikov, Alexey
    Vasilenko, Mikhail
    INTERNATIONAL CONFERENCE ON BIG DATA AND ITS APPLICATIONS (ICBDA 2016), 2016, 8
  • [23] A CONSENSUS-BASED DECENTRALIZED ALGORITHM FOR NON-CONVEX OPTIMIZATION WITH APPLICATION TO DICTIONARY LEARNING
    Wai, Hoi-To
    Chang, Tsung-Hui
    Scaglione, Anna
    2015 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING (ICASSP), 2015, : 3546 - 3550
  • [24] On convergence of a q-random coordinate constrained algorithm for non-convex problems
    Ghaffari-Hadigheh, A.
    Sinjorgo, L.
    Sotirov, R.
    JOURNAL OF GLOBAL OPTIMIZATION, 2024, 90 (04) : 843 - 868
  • [25] Accelerated Primal-Dual Algorithm for Distributed Non-convex Optimization
    Zhang, Shengjun
    Bailey, Colleen P.
    2021 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI 2021), 2021,
  • [26] Optimization of a Class of Non-Convex Objectives on the Gaussian MIMO Multiple Access Channel: Algorithm Development and Convergence Analysis
    Calabuig, Daniel
    Gohary, Ramy H.
    Yanikomeroglu, Halim
    2014 IEEE 15TH INTERNATIONAL WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS (SPAWC), 2014, : 50 - +
  • [27] Global convergence of a non-convex Douglas–Rachford iteration
    Francisco J. Aragón Artacho
    Jonathan M. Borwein
    Journal of Global Optimization, 2013, 57 : 753 - 769
  • [28] Novel Hybrid Algorithm Based on Combined Particle Swarm Optimization and Imperialist Competitive Algorithm for Non-Convex CHPED Solution
    Yuwei Yang
    Jie Gao
    Hai Gu
    Hashem Imani Marani
    Journal of Electrical Engineering & Technology, 2023, 18 : 1 - 13
  • [29] Novel Hybrid Algorithm Based on Combined Particle Swarm Optimization and Imperialist Competitive Algorithm for Non-Convex CHPED Solution
    Yang, Yuwei
    Gao, Jie
    Gu, Hai
    Marani, Hashem Imani
    JOURNAL OF ELECTRICAL ENGINEERING & TECHNOLOGY, 2023, 18 (01) : 1 - 13
  • [30] GLOBAL CONVERGENCE OF THE PARTITIONED BFGS ALGORITHM FOR CONVEX PARTIALLY SEPARABLE OPTIMIZATION
    TOINT, PL
    MATHEMATICAL PROGRAMMING, 1986, 36 (03) : 290 - 306