无约束最优化算法Rosenbrock的实现

Rosenbrock—Nonrestraint Optimization Algorithm

不论对基础研究还是应用研究,优化问题都是一个普遍的问题,有广泛的应用背景。从现代的观点来看,优化问题的解决依赖于计算机强大的计算能力,其关键在于算法,实质就是一种搜索,是人工智能的关键技术之一,属于计算机科学的范畴。该领域是人工智能研究的一个热点,有大量的学者从事这方面的研究,并研究出多种不同特点的算法。首先介绍了其中的一种算法Rosenbrock,然后对其进行分析研究,并且编程在计算机上实现。

Optimization is a common question both in basic research and in application research which has broad application background. From the modern viewpoint, the solving of optimization problems relies on powerful computing capability of computers with algorithm as the key. Optimization is essentially a kind of search technique, which is one of the key techniques of artificial intelligence and belongs to computer science. As one of the hottest research fields, a lot of scholars are engaged in it and have found out a number of algorithms. This article analyzes one of the algorithms named Rosenbrock as well as its realization via programming in computer.