.png){kind=icon}
返回
Cross-Hill: A heuristic method for global optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2015.06.013.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The heuristic Cross Hill method proposed by Qi et al. (2009) [14] was recently extended from finding the Z-eigenvalues of tensors to quantum separation problem by Han and Qi (2013) [5]. In this paper, we show that it can be extended to solve general global optimization problems. The heuristic Cross Hill method is a combination of a local optimization method and a global optimization method with lower dimension. At each iteration, it first uses the local optimization method to find a local solution. Then, using this point and an arbitrary orthogonal vector, it solves a two-dimensional optimization problem to find a better solution than that the local approach was able to find. Preliminary experimental results are very encouraging. (C) 2015 Elsevier Inc. All rights reserved.
Keyword:
Cross-Hill
Global Optimization
Tensor
Polynomial optimization
Local method
Gradient descent method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏 没有更多内容
没有更多内容