.png){kind=icon}
返回
Nonconvex optimization using negative curvature within a modified linesearch
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2006.09.097.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper describes a new algorithm for the solution of nonconvex unconstrained optimization problems, with the property of converging to points satisfying second-order necessary optimality conditions. The algorithm is based on a procedure which, from two descent directions, a Newton-type direction and a direction of negative curvature, selects in each iteration the linesearch model best adapted to the properties of these directions. The paper also presents results of numerical experiments that illustrate its practical efficiency. (C) 2006 Elsevier B.V. All rights reserved.
Keyword:
Newton's method
unconstrained optimization
negative curvature
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
分享收藏Trapping, shaping, and isolating of an ion Coulomb crystal via state-selective optical potentialsOAAI
OAAI分享收藏
分享收藏
查看更多内容