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

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

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

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

Numerical mathematical programming methods (65K05) Convex programming (90C25) Convex functions and convex programs in convex geometry (52A41) Decomposition methods (49M27) Convexity of real functions of several variables, generalizations (26B25)

Related Items

Block Bregman Majorization Minimization with Extrapolation, Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization, Tensor methods for finding approximate stationary points of convex functions, Bregman proximal gradient algorithms for deep matrix factorization, A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints, Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems, Revisiting linearized Bregman iterations under Lipschitz-like convexity condition, Optimal complexity and certification of Bregman first-order methods, Global convergence of model function based Bregman proximal minimization algorithms, A semi-alternating algorithm for solving nonconvex split equality problems, A simplified view of first order methods for optimization, Proximal gradient algorithms under local Lipschitz gradient continuity. A convergence and robustness analysis of PANOC, Non-convex split Feasibility problems: models, algorithms and theory, Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant, Tangencies and polynomial optimization, New Bregman proximal type algoritms for solving DC optimization problems, Global convergence of the gradient method for functions definable in o-minimal structures, General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems, Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions, Dualities for Non-Euclidean Smoothness and Strong Convexity under the Light of Generalized Conjugacy, A Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuity, Stochastic composition optimization of functions without Lipschitz continuous gradient, Optimality Conditions for Minimizers at Infinity in Polynomial Programming, Novel Proximal Gradient Methods for Nonnegative Matrix Factorization with Sparsity Constraints, First-order methods almost always avoid strict saddle points, Conditional gradient method for vector optimization, An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant, Provable Phase Retrieval with Mirror Descent, Inexact version of Bregman proximal gradient algorithm, A Nonlocal Graph-PDE and Higher-Order Geometric Integration for Image Labeling, Sharper Bounds for Proximal Gradient Algorithms with Errors, Bregman proximal point type algorithms for quasiconvex minimization, An abstract convergence framework with application to inertial inexact forward-backward methods, Bregman three-operator splitting methods, Efficient Numerical Methods for Computing the Stationary States of Phase Field Crystal Models, Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems, Unnamed Item, A unified convergence analysis of stochastic Bregman proximal gradient and extragradient methods, Quartic first-order methods for low-rank minimization, Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization, Proximal-like incremental aggregated gradient method with Bregman distance in weakly convex optimization problems, A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization, Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity, Composite Optimization by Nonconvex Majorization-Minimization, Modern regularization methods for inverse problems, Variable Metric Forward-Backward Algorithm for Composite Minimization Problems, Proximal-Like Incremental Aggregated Gradient Method with Linear Convergence Under Bregman Distance Growth Conditions, A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption, On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity, The forward-backward splitting method for non-Lipschitz continuous minimization problems in Banach spaces, Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems, A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima, Convergence properties of monotone and nonmonotone proximal gradient methods revisited, Dual Space Preconditioning for Gradient Descent, On inexact solution of auxiliary problems in tensor methods for convex optimization, Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework, Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity, Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons

Uses Software

GESPAR

Cites Work