We propose a quasi-Newton line-search method that uses negative curvature directions for solving unconstrained optimization problems. In this method, the symmetric rank-one (SR1) rule is used to update the Hessian approximation. The SR1 update rule is known to have a good numerical performance; however, it does not guarantee positive definiteness of the updated matrix. We first discuss the details of the proposed algorithm and then concentrate on its practical behaviour. Our extensive computational study shows the potential of the proposed method from different angles, such as its performance compared with some other existing packages, the profile of its computations, and its large-scale adaptation. We then conclude the paper with the convergence analysis of the proposed method.

Additional Metadata
Keywords quasi-Newton, SR1 update, negative curvature, unconstrained
Persistent URL dx.doi.org/10.1080/10556788.2010.544311, hdl.handle.net/1765/118054
Journal Optimization. Methods & Software
Citation
Oztoprak, F., & Birbil, S.I. (2011). A symmetric rank-one quasi-Newton line-search method using negative curvature directions. Optimization. Methods & Software, 26(3), 455–486. doi:10.1080/10556788.2010.544311