On Convergence to Essential Singularities

Abstract

An iterative optimization method applied to a function f on Rn will produce a sequence of arguments \xk\k ∈ N; this sequence is often constrained such that \f(xk)\k ∈ N is monotonic. As part of the analysis of an iterative method, one may ask under what conditions the sequence \xk\k ∈ N converges. In 2005, Absil et al.\ employed the Łojasiewicz gradient inequality in a proof of convergence; this requires that the objective function exist at a cluster point of the sequence. Here we provide a convergence result that does not require f to be defined at the limit k ∞ xk, should the limit exist. We show that a variant of the Łojasiewicz gradient inequality holds on sets adjacent to singularities of bounded multivariate rational functions. We extend the results of Absil et al.\ to prove that if \xk\k ∈ N ⊂ Rn has a cluster point x*, if f is a bounded multivariate rational function on Rn, and if a technical condition holds, then xk x* even if x* is not in the domain of f. We demonstrate how this may be employed to analyze divergent sequences by mapping them to projective space, and consider the implications this has for the study of low-rank tensor approximations.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…