A conjugate gradient method with sufficient descent and global convergence for unconstrained nonlinear optimization.
Liu, Hailin, Cheng, Sui Sun, Li, Xiaoyong (2011)
Applied Mathematics E-Notes [electronic only]
Similarity:
Liu, Hailin, Cheng, Sui Sun, Li, Xiaoyong (2011)
Applied Mathematics E-Notes [electronic only]
Similarity:
Nada I. Đuranović-Miličić (2005)
The Yugoslav Journal of Operations Research
Similarity:
Yuan, Gonglin (2009)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Nada I. Žuranović-Miličić (2000)
The Yugoslav Journal of Operations Research
Similarity:
Wang, Weixiang, Shang, Youlin, Zhang, Ying (2010)
Discrete Dynamics in Nature and Society
Similarity:
Jiao, Hongwei, Feng, Qigao, Shen, Peiping, Guo, Yunrui (2008)
Mathematical Problems in Engineering
Similarity:
Khun, Jiří, Šimeček, Ivan
Similarity:
Parallelization is one of possible approaches for obtaining better results in terms of algorithm performance and overcome the limits of the sequential computation. In this paper, we present a study of parallelization of the opt-aiNet algorithm which comes from Artificial Immune Systems, one part of large family of population based algorithms inspired by nature. The opt-aiNet algorithm is based on an immune network theory which incorporates knowledge about mammalian immune systems in...
Yaoyao He, Jianzhong Zhou, Ning Lu, Hui Qin, Youlin Lu (2010)
Kybernetika
Similarity:
Differential evolution algorithm combined with chaotic pattern search(DE-CPS) for global optimization is introduced to improve the performance of simple DE algorithm. Pattern search algorithm using chaotic variables instead of random variables is used to accelerate the convergence of solving the objective value. Experiments on 6 benchmark problems, including morbid Rosenbrock function, show that the novel hybrid algorithm is effective for nonlinear optimization problems in high dimensional...
Frederic Messine (2004)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The purpose of this article is to show the great interest of the use of propagation (or pruning) techniques, inside classical interval Branch-and-Bound algorithms. Therefore, a propagation technique based on the construction of the calculus tree is entirely explained and some properties are presented without the need of any formalism (excepted interval analysis). This approach is then validated on a real example: the optimal design of an electrical rotating machine.