.png){kind=icon}
返回
Simple statistical tests selection based parallel computating method ensures the guaranteed global extremum identification
.png){kind=icon}
OA
AI
DOI：10.1016/j.jksus.2024.103165.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The article proposes a parallel computing oriented method for solving the global minimum finding problems, in which continuous objective functions satisfy the Holder condition, and the control parameters domain limited by continuous functions is characterized by a positive Lebesgue measure. A typical example of such a task is the discrepancy minimizing problem between the left and right parts of some large system of equilibrium equations (this is a usual situation when describing real process using Markov chain). The method is based on simple statistical tests, thanks to which, at each iteration, growing sets of potential global minima and sets of decrements necessary for estimating the values of the Holder constants are formed. The article theoretically substantiates and empirically proves the guaranteed convergence of the authors' method to the real global minimum, which occurs at an exponential rate. For the continuous iterations number, analytical upper estimates of the spacing between the potential global minima and real global minima are formalized, as well as an estimate of the probability of overcoming this spacing is formalized. The decrements sequence approximation, estimation of a priori unknown Holder constants, estimation of the average number of iterations of the method and probabilistic characteristics of the final solution are analytically justified. In addition to the theoretical proof, the adequacy of the authors' method has been confirmed empirically. It turned out that both the quality characteristics of the initial results calculated by the authors' method and the time to obtain them are practically independent of the size of the search area. This expected result is a significant advantage of the authors' method over analogues.
Keyword:
Parallel computating
Applied mathematics
Optimization problem
Global extremum
Statistical tests method
Equilibrium
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
J
IF:
3.6
论文数:
2.8K
被引数:
1.0W
机构
引用论文
A new hybrid optimizer for stochastic optimization acceleration of deep neural networks: Dynamical system perspective.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏A hybrid polynomial-based optimization method for underwater gliders with parameter uncertainty一种基于混合多项式的参数不确定性水下滑翔机优化方法
PREAI
分享收藏Application of the arithmetic optimization algorithm to solve the optimal power flow problem in direct current networks应用算术优化算法求解直流电网最优潮流问题OAAI
OAAI分享收藏Multi-objective optimization for pavement maintenance and rehabilitation decision-making: A critical review and future directions路面养护和修复决策的多目标优化: 重要回顾和未来方向
PREAI
分享收藏A coupled non-deterministic optimization and mixed-level factorial analysis model for power generation expansion planning - A case study of Jing-Jin-Ji metropolitan region, ChinaAPPLIED ENERGY
APPLIED ENERGYIF11
PREAI
分享收藏Robust optimization of seasonal, day-ahead and real time operation of aggregated energy systems聚合能源系统的季节性、日前和实时运行的稳健优化OAAI
OAAI分享收藏A survey for solving mixed integer programming via machine learning通过机器学习解决混合整数规划的调查NEUROCOMPUTINGOAAI
NEUROCOMPUTINGIF6.5
OAAI分享收藏
查看更多内容