On Linear Convergence of Non-Euclidean Gradient Methods without Strong Convexity and Lipschitz Gradient Continuity

Title
On Linear Convergence of Non-Euclidean Gradient Methods without Strong Convexity and Lipschitz Gradient Continuity
Authors
Keywords
Non-Euclidean gradient methods, Nonconvex minimization, Bregman distance, Lipschitz-like convexity condition, Descent lemma without Lipschitz gradient, Gradient dominated inequality, Łojasiewicz gradient inequality, Linear rate of convergence, 65K05, 49M10, 90C26, 90C30, 65K10
Journal
Publisher
Springer Nature
Online
2019-04-06
DOI
10.1007/s10957-019-01516-9

Ask authors/readers for more resources

Reprint

Contact the author

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started