arXiv · 1603.06912
A note on the convergence of nonconvex line search
Abstract
In this note, we consider the line search for a class of abstract nonconvex algorithm which have been deeply studied in the Kurdyka-Lojasiewicz theory. We provide a weak convergence result of the line search in general. When the objective function satisfies the Kurdyka-Lojasiewicz property and some certain assumption, a global convergence result can be derived. An application is presented for the L0-regularized least square minimization in the end of the paper.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Tao Sun, Lizhi Chenga, Hao Jiang. 2016-03-19. A note on the convergence of nonconvex line search. https://arxiv.org/abs/1603.06912
Cite the original work for its findings. Save a collection to share your selection of sources.