A dimer-type saddle search algorithm with preconditioning and linesearch

DOI10.1090/mcom/3096zbMath1344.65054arXiv1407.2817OpenAlexW2313368352MaRDI QIDQ5741498

No author found.

Publication date: 25 July 2016

Published in: Mathematics of Computation (Search for Journal in Brave)

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

zbMATH Keywords

algorithmstep size selectionnumerical testlinesearchlocal linear convergencedimer methodsaddle searchperconditioning

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Preconditioners for iterative methods (65F08)

Related Items (10)

Error Estimates for Euler Discretization of High-Index Saddle Dynamics ⋮ Convergence Analysis of Discrete High-Index Saddle Dynamics ⋮ Discretization and index-robust error analysis for constrained high-index saddle dynamics on the high-dimensional sphere ⋮ A model-free shrinking-dimer saddle dynamics for finding saddle point and solution landscape ⋮ Convergence and Cycling in Walker-type Saddle Search Algorithms ⋮ Error estimate for semi-implicit method of sphere-constrained high-index saddle dynamics ⋮ Using Witten Laplacians to Locate Index-1 Saddle Points ⋮ Optimization-based Shrinking Dimer Method for Finding Transition States ⋮ Iterative minimization algorithm for efficient calculations of transition states ⋮ High-Index Optimization-Based Shrinking Dimer Method for Finding High-Index Saddle Points

Uses Software

• L-BFGS

Cites Work

• Nested stochastic simulation algorithms for chemical kinetic systems with multiple time scales
• On the limited memory BFGS method for large scale optimization
• Shrinking Dimer Dynamics and Its Applications to Saddle Point Search
• Methods of minimization of functions on a sphere and their applications
• Numerical Optimization
• Finding Critical Nuclei in Phase Transformations by Shrinking Dimer Dynamics and its Variants
• An Extrinsic Look at the Riemannian Hessian
• Computational experience with quadratically convergent minimisation methods
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A dimer-type saddle search algorithm with preconditioning and linesearch