复杂系统最优性条件的计算证据
On Optimality Condition of Complex Systems: Computational Evidence
摘要：
确定复杂系统最优性能的一般条件尚未找到，其存在的可能性也是未知的。为了在这个方向上作出贡献，作为一个复杂的系统的优化算法。任何问题的算法的性能控制作为一个凸函数与一个单一的最佳。为了表征性能最优，算法和问题的某些数量被建议并解释为它们的复杂性。算法的最优性条件是计算发现：如果算法显示其最佳性能的问题，那么算法的复杂性是在一个线性关系的问题的复杂性。最优性条件通过认识到复杂系统的某些量与问题之间的关系可能决定最优性能，为该主题提供了一个新的视角。
英文摘要：
A general condition determining the optimal performance of a complex system has not yet been found and the possibility of its existence is unknown. To contribute in this direction, an optimization algorithm as a complex system is presented. The performance of the algorithm for any problem is controlled as a convex function with a single optimum. To characterize the performance optimums, certain quantities of the algorithm and the problem are suggested and interpreted as their complexities. An optimality condition of the algorithm is computationally found: if the algorithm shows its best performance for a problem, then the complexity of the algorithm is in a linear relationship with the complexity of the problem. The optimality condition provides a new perspective to the subject by recognizing that the relationship between certain quantities of the complex system and the problem may determine the optimal performance.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
