Convergence of ZH-type nonmonotone descent method for Kurdyka-ojasiewicz optimization problems
Abstract
We propose a novel iterative framework for minimizing a proper lower semicontinuous Kurdyka-ojasiewicz (KL) function . It comprises a Zhang-Hager (ZH-type) nonmonotone decrease condition and a relative error condition. Hence, the sequence generated by the ZH-type nonmonotone descent methods will fall within this framework. Any sequence conforming to this framework is proved to converge to a critical point of . If in addition has the KL property of exponent θ\!∈(0,1) at the critical point, the convergence has a linear rate for θ∈(0,1/2] and a sublinear rate of exponent 1-θ1-2θ for θ∈(1/2,1). To the best of our knowledge, this is the first work to establish the full convergence of the iterate sequence generated by a ZH-type nonmonotone descent method for nonconvex and nonsmooth optimization problems. The obtained results are also applied to achieve the full convergence of the iterate sequences produced by the proximal gradient method and Riemannian gradient method with the ZH-type nonmonotone line-search.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.