First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems

DOI10.1137/17M1138558zbMath1402.90118arXiv1706.06461MaRDI QIDQ4577742

Marc Teboulle, Yakov Vaisbourd, Jérôme Bolte, Shoham Sabach

Publication date: 3 August 2018

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.06461

zbMATH Keywords

global convergence; phase retrieval; Bregman distance; Kurdyka-Łojasiewicz property; semialgebraic functions; proximal gradient algorithms; extended descent lemma; non-Euclidean distances; composite nonconvex nonsmooth minimization; quadratic inverse problems

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C25: Convex programming

52A41: Convex functions and convex programs in convex geometry

49M27: Decomposition methods

26B25: Convexity of real functions of several variables, generalizations

Uses Software

• GESPAR