Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Convergence and Cycling in Walker-type Saddle Search Algorithms   Algorithms for computing local minima of smooth objective functions enjoy a
mature theory as well as robust and efficient implementations. By comparison,
the theory and practice of saddle search is destitute. In this paper we present
results for idealized versions of the dimer and gentlest ascent (GAD) saddle
search algorithms that show-case the limitations of what is theoretically
achievable within the current class of saddle search algorithms: (1) we present
an improved estimate on the region of attraction of saddles; and (2) we
construct quasi-periodic solutions which indicate that it is impossible to
obtain globally convergent variants of dimer and GAD type algorithms.

11
The categories of this paper are: hep-lat
12
The categories of this paper are: nucl-th
23
The categories of this paper are: solv-int
27
The categories of this paper are: comp-gas
15
The categories of this paper are: nucl-ex
30
The categories of this paper are: q-alg
37
The categories of this paper are: supr-con
9
The categories of this paper are: nlin
25
The categories of this paper are: patt-sol
16
The categories of this paper are: stat
22
The categories of this paper are: chao-dyn
32
The categories of this paper are: atom-ph
33
The categories of this paper are: plasm-ph
20
The categories of this paper are: acc-phys
5
The categories of this paper are: gr-qc
4
The categories of this paper are: cond-mat