An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions

DOI10.1007/s13675-015-0045-8zbMath1338.90311arXiv1410.0641OpenAlexW1849979240MaRDI QIDQ285919

Ernö Robert Csetnek, Radu Ioan Boţ, Szilárd Csaba László

Publication date: 19 May 2016

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

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

zbMATH Keywords

nonsmooth optimizationlimiting subdifferentialBregman distanceinertial proximal algorithmKurdyka-Łojasiewicz inequality

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)

Related Items

An inertial proximal alternating direction method of multipliers for nonconvex optimization ⋮ Penalty schemes with inertial effects for monotone inclusion problems ⋮ Modified Tseng's extragradient algorithms for variational inequality problems ⋮ An inertial based forward-backward algorithm for monotone inclusion problems and split mixed equilibrium problems in Hilbert spaces ⋮ Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization ⋮ Forward-backward quasi-Newton methods for nonsmooth optimization problems ⋮ Continuous dynamics related to monotone inclusions and non-smooth optimization problems ⋮ An inertial-like proximal algorithm for equilibrium problems ⋮ Convergence analysis of new inertial method for the split common null point problem ⋮ Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems ⋮ Local convergence of the heavy-ball method and iPiano for non-convex optimization ⋮ An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization ⋮ Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization ⋮ A fast proximal iteratively reweighted nuclear norm algorithm for nonconvex low-rank matrix minimization problems ⋮ A forward-backward dynamical approach to the minimization of the sum of a nonsmooth convex with a smooth nonconvex function ⋮ Approaching nonsmooth nonconvex optimization problems through first order dynamical systems with hidden acceleration and Hessian driven damping terms ⋮ Two projection algorithms for the common solution of the monotone inclusion, the fixed point and the null point problems in Hilbert spaces ⋮ An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems ⋮ A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization ⋮ A forward-backward dynamical approach for nonsmooth problems with block structure coupled by a smooth function ⋮ Inertial proximal alternating minimization for nonconvex and nonsmooth problems ⋮ New strong convergence theorem of the inertial projection and contraction method for variational inequality problems ⋮ A gradient-type algorithm with backward inertial steps associated to a nonconvex minimization problem ⋮ Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms ⋮ An inertial method for solving split common fixed point problems ⋮ A strong convergence result involving an inertial forward-backward algorithm for monotone inclusions ⋮ Unnamed Item ⋮ Nonconvex optimization with inertial proximal stochastic variance reduction gradient ⋮ 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 ⋮ Application of new strongly convergent iterative methods to split equality problems ⋮ Unnamed Item ⋮ An inertial alternating minimization with Bregman distance for a class of nonconvex and nonsmooth problems ⋮ Inertial Newton algorithms avoiding strict saddle points ⋮ New Tseng-degree gradient method in variational inequality problem ⋮ Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality ⋮ A forward-backward algorithm with different inertial terms for structured non-convex minimization problems ⋮ An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems ⋮ A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations ⋮ Fast optimization via inertial dynamics with closed-loop damping ⋮ A partially inertial customized Douglas-Rachford splitting method for a class of structured optimization problems ⋮ A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems ⋮ Convergence Analysis for Bregman Iterations in Minimizing a Class of Landau Free Energy Functionals ⋮ A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula ⋮ The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates ⋮ Accelerated hybrid methods for solving pseudomonotone equilibrium problems ⋮ A new strong convergence for solving split variational inclusion problems ⋮ Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano ⋮ Approximating solutions of split equality of some nonlinear optimization problems using an inertial algorithm ⋮ Inertial subgradient extragradient algorithms with line-search process for solving variational inequality problems and fixed point problems ⋮ New inertial algorithm for a class of equilibrium problems ⋮ An extension of the second order dynamical system that models Nesterov's convex gradient method ⋮ Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization ⋮ Inertial extragradient method via viscosity approximation approach for solving equilibrium problem in Hilbert space ⋮ Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems ⋮ Modified extragradient algorithms for solving equilibrium problems ⋮ An inertial subgradient-type method for solving single-valued variational inequalities and fixed point problems ⋮ Approaching nonsmooth nonconvex minimization through second-order proximal-gradient dynamical systems ⋮ Gradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data ⋮ An inertial proximal-gradient penalization scheme for constrained convex optimization problems ⋮ Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity ⋮ On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems ⋮ Unnamed Item ⋮ Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems ⋮ A novel inertial projection and contraction method for solving pseudomonotone variational inequality problems ⋮ Modified subgradient extragradient method for variational inequality problems ⋮ Globalized inexact proximal Newton-type methods for nonconvex composite functions ⋮ A forward–backward penalty scheme with inertial effects for monotone inclusions. Applications to convex bilevel programming ⋮ Maximum time step for the BDF3 scheme applied to gradient flows ⋮ A new inertial double-projection method for solving variational inequalities ⋮ 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 ⋮ A viscosity-proximal gradient method with inertial extrapolation for solving certain minimization problems in Hilbert space ⋮ A new proximal iterative hard thresholding method with extrapolation for \(\ell _0\) minimization ⋮ On the convergence of the forward–backward splitting method with linesearches ⋮ A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems ⋮ Weak convergence of explicit extragradient algorithms for solving equilibrium problems ⋮ Sequence Convergence of Inexact Nonconvex and Nonsmooth Algorithms with More Realistic Assumptions ⋮ The extragradient algorithm with inertial effects for solving the variational inequality ⋮ On convergence and complexity analysis of an accelerated forward-backward algorithm with linesearch technique for convex minimization problems and applications to data prediction and classification ⋮ New algorithms for the split variational inclusion problems and application to split feasibility problems ⋮ Hybrid inertial contraction algorithms for solving variational inequalities with fixed point constraints in Hilbert spaces ⋮ A general double-proximal gradient algorithm for d.c. programming ⋮ 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 ⋮ Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction ⋮ An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems

Uses Software

• iPiano

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems
• Inertial Douglas-Rachford splitting for monotone inclusion problems
• An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
• Asymptotics for some proximal-like method involving inertia and memory aspects
• Convergence theorems for inertial KM-type algorithms
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• On gradients of functions definable in o-minimal structures
• Introductory lectures on convex optimization. A basic course.
• Convergence of a splitting inertial proximal method for monotone operators
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
• An inertial alternating direction method of multipliers
• iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• A Hybrid Proximal-Extragradient Algorithm with Inertial Effects
• Clarke Subgradients of Stratifiable Functions
• Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
• Convergence of New Inertial Proximal Methods for DC Programming
• Variational Analysis
• On the Minimizing Property of a Second Order Dissipative System in Hilbert Spaces
• Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• A Dynamical Approach to an Inertial Forward-Backward Algorithm for Convex Minimization
• Proximal Heterogeneous Block Implicit-Explicit Method and Application to Blind Ptychographic Diffraction Imaging
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Convex analysis and monotone operator theory in Hilbert spaces
• An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping