Publication:
Nonconvex optimization using negative curvature within a modified linesearch

Loading...
Thumbnail Image
Identifiers
Publication date
2008-09
Defense date
Advisors
Tutors
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
Impact
Google Scholar
Export
Research Projects
Organizational Units
Journal Issue
Abstract
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.
Description
Keywords
Newton’s method, Unconstrained optimization, Negative curvature
Bibliographic citation
European Journal of Operational Research, v. 189, n. 3, p. 706–722