Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 45 min ago
PreprintarXiv licencearXiv

Hybrid Newton-BFGS high-index saddle dynamics for accelerating saddle-point searches

Abstract

We propose a hybrid Newton-BFGS high-index saddle dynamics (HiSD) method for accelerating saddle-point searches. The method constructs a Newton correction on the unstable subspace from the available negative eigenpairs, while BFGS updates based on projected secant information approximate the inverse Hessian on the stable subspace. By combining Newton and quasi-Newton corrections, the method incorporates curvature information in both subspaces while preserving the ascent-descent structure of HiSD. Accounting for the evolving stable subspaces, we establish local Q-superlinear convergence of the full-memory version near nondegenerate saddle points under suitable assumptions. We further develop a limited-memory version for large-scale problems and provide fixed-step and line search strategies. Numerical experiments show local convergence behavior consistent with the theory and demonstrate acceleration on ill-conditioned problems and degenerate saddle manifolds in neural-network loss landscapes. The method also supports efficient upward and downward saddle searches for a liquid crystal model, further illustrating its broad applicability to saddle-point computation.

Related

  1. Wasserstein Saddle-Free Newton: Saddle Escape and Local Spectral Convergence
    Razvan-Andrei Lascu, Taiji Suzuki
    arXivPreprintarXiv licenceFull textOptimisation & controlStatisticsarXiv
  2. Beyond PINNs: A Unified Gauss--Newton and Petrov--Galerkin Framework for Neural and Hybrid PDE Solvers
    Nilo Schwencke, Roland Maier
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
  3. Tikhonov-Regularized Dynamics and Inexact Algorithms for Nonlinear Saddle-Point Problems
    Hong-lu Li, Yi-bin Xiao
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  4. Structure-preserving diffuse-domain accelerated saddle dynamics for wetting transitions
    Tianye Xu, Lei Zhang, Yuze Zhang
    arXivPreprintarXiv licenceFull textMathematical physicsarXiv
  5. Accelerated primal-dual dynamics and algorithms for strongly convex-concave bilinear saddle point problems
    Yun-xi Zhang, Yi-bin Xiao, Xin He
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
BibTeX
@misc{yin2026hybrid,
  title = {{Hybrid Newton-BFGS high-index saddle dynamics for accelerating saddle-point searches}},
  author = {Jianyuan Yin and Lei Zhang and Shixue Zhang},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.07692},
  eprint = {2611.07692},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.07692},
}
RIS
TY  - UNPB
TI  - Hybrid Newton-BFGS high-index saddle dynamics for accelerating saddle-point searches
AU  - Jianyuan Yin
AU  - Lei Zhang
AU  - Shixue Zhang
PY  - 2026
DA  - 2026/11/05
PB  - arXiv
DO  - 10.48550/arxiv.2611.07692
UR  - https://arxiv.org/abs/2611.07692
AB  - We propose a hybrid Newton-BFGS high-index saddle dynamics (HiSD) method for accelerating saddle-point searches. The method constructs a Newton correction on the unstable subspace from the available negative eigenpairs, while BFGS updates based on projected secant information approximate the inverse Hessian on the stable subspace. By combining Newton and quasi-Newton corrections, the method incorporates curvature information in both subspaces while preserving the ascent-descent structure of HiSD. Accounting for the evolving stable subspaces, we establish local Q-superlinear convergence of the full-memory version near nondegenerate saddle points under suitable assumptions. We further develop a limited-memory version for large-scale problems and provide fixed-step and line search strategies. Numerical experiments show local convergence behavior consistent with the theory and demonstrate acceleration on ill-conditioned problems and degenerate saddle manifolds in neural-network loss landscapes. The method also supports efficient upward and downward saddle searches for a liquid crystal model, further illustrating its broad applicability to saddle-point computation.
ER  -