Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization

DOI10.1007/s11590-023-02033-5arXiv2206.05318OpenAlexW4383065888MaRDI QIDQ6057628

C. W. Royer, Warren L. Hare

Publication date: 26 October 2023

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2206.05318

zbMATH Keywords

nonconvex optimizationnegative curvatureHessian matricesblackbox optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity bounds for second-order optimality in unconstrained optimization
• A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization
• Concise complexity analyses for trust region methods
• A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds
• CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
• A second-order globally convergent direct-search method and its worst-case complexity
• A subclass of generating set search with convergence to second-order stationary points
• Introduction to Derivative-Free Optimization
• Curvilinear path steplength algorithms for minimization which use directions of negative curvature
• A modification of Armijo's step-size rule for negative curvature
• On the use of directions of negative curvature in a modified newton method
• Trust Region Methods
• Derivative-Free and Blackbox Optimization
• Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization
• Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points
• Algorithm 457: finding all cliques of an undirected graph