On Convergence to Essential Singularities
Nathaniel J. McClatchey

TL;DR
This paper extends convergence analysis of iterative optimization methods to cases where the limit point may lie outside the domain of the objective function, especially for bounded rational functions near singularities.
Contribution
It proves a variant of the Łojasiewicz gradient inequality applicable near singularities of rational functions, allowing convergence results without the function being defined at the limit.
Findings
Convergence can occur even if the limit point is outside the function's domain.
A variant of the Łojasiewicz inequality is established for singularities of rational functions.
Application to analyzing divergent sequences in low-rank tensor approximation.
Abstract
An iterative optimization method applied to a function on will produce a sequence of arguments ; this sequence is often constrained such that is monotonic. As part of the analysis of an iterative method, one may ask under what conditions the sequence converges. In 2005, Absil et al.\ employed the {\L}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 to be defined at the limit , should the limit exist. We show that a variant of the {\L}ojasiewicz gradient inequality holds on sets adjacent to singularities of bounded multivariate rational functions. We extend the results…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Matrix Theory and Algorithms · Advanced Optimization Algorithms Research
