An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems

DOI10.1007/S10957-015-0730-ZMaRDI QIDQ346822zbMATH OpenOpenAlexFDO

Authors Radu I. Boţ, Ernö Robert Csetnek

Publication date 30 November 2016

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

nonsmooth optimizationBregman distancelimiting subdifferentialinertial proximal algorithmTseng's type proximal algorithmKurdyka-Łojasiewicz inequality

Mathematics Subject Classification ID

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

Abstract: We investigate the convergence of a forward-backward-forward proximal-type algorithm with inertial and memory effects when minimizing the sum of a nonsmooth function with a smooth one in the absence of convexity. The convergence is obtained provided an appropriate regularization of the objective satisfies the Kurdyka-L{}ojasiewicz inequality, which is for instance fulfilled for semi-algebraic functions.

Recommendations

• An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
• Inertial proximal alternating minimization for nonconvex and nonsmooth problems
• Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization
• General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
• A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems

Cites work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• A dynamical approach to an inertial forward-backward algorithm for convex minimization
• A monotone+skew splitting model for composite monotone inclusions in duality
• A parallel inertial proximal optimization method
• An inertial alternating direction method of multipliers
• An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
• An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems
• An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
• Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
• Asymptotics for some proximal-like method involving inertia and memory aspects
• Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
• Convergence of New Inertial Proximal Methods for DC Programming
• 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
• Convergence theorems for inertial KM-type algorithms
• Convex analysis and monotone operator theory in Hilbert spaces
• Inertial Douglas-Rachford splitting for monotone inclusion problems
• Introductory lectures on convex optimization. A basic course.
• On gradients of functions definable in o-minimal structures
• On the Minimizing Property of a Second Order Dissipative System in Hilbert Spaces
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
• Variational Analysis
• Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
• iPiano: inertial proximal algorithm for nonconvex optimization

Cited in

(80)

• A new strong convergence for solving split variational inclusion problems
• Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions
• A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
• 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
• Fast convergence of dynamical ADMM via time scaling of damped inertial dynamics
• An inertial subgradient extragradient algorithm with adaptive stepsizes for variational inequality problems
• An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
• Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
• A viscosity-proximal gradient method with inertial extrapolation for solving certain minimization problems in Hilbert space.
• A parameterized three-operator splitting algorithm for non-convex minimization problems with applications
• Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
• The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates
• Asymptotics for some proximal-like method involving inertia and memory aspects
• Inertial subgradient extragradient algorithms with line-search process for solving variational inequality problems and fixed point problems
• Modified Tseng's extragradient algorithms for variational inequality problems
• A new iterative method for solving variational inequality and fixed point problems
• A new projection algorithm for solving variational inequality problems in Banach spaces
• Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization
• Strong convergence of extragradient methods with a new step size for solving variational inequality problems
• A relaxed forward-backward-forward algorithm with alternated inertial step: weak and linear convergence
• General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
• An accelerated forward-backward-half forward splitting algorithm for monotone inclusion with applications to image restoration
• An inertial self-adaptive iterative algorithm for finding the common solutions to split feasibility and fixed point problems in specific Banach spaces
• Strong convergence theorems for solving variational inequality problems with pseudo-monotone and non-Lipschitz operators
• The extragradient algorithm with inertial effects for solving the variational inequality
• A strong convergence result involving an inertial forward-backward algorithm for monotone inclusions
• Modified subgradient extragradient method for variational inequality problems
• A novel inertial projection and contraction method for solving pseudomonotone variational inequality problems
• Inertial approximation method for split variational inclusion problem in Banach spaces
• Local convergence of the heavy-ball method and iPiano for non-convex optimization
• Viscosity approximation method for solving variational inequality problem in real Banach spaces
• Inertial proximal ADMM for linearly constrained separable convex optimization
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• New algorithms for the split variational inclusion problems and application to split feasibility problems
• On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng's modified forward-backward methods with inertial effects
• Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems
• Two-step inertial Tseng’s extragradient method for solving quasimonotone variational inequalities
• Mann-type algorithms for variational inequality problems and fixed point problems
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
• New extragradient methods for solving variational inequality problems and fixed point problems
• Inertial proximal point algorithm for the split common solution problem of monotone operator equations
• A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
• A gradient-type algorithm with backward inertial steps associated to a nonconvex minimization problem
• New strong convergence theorem of the inertial projection and contraction method for variational inequality problems
• Approaching nonsmooth nonconvex optimization problems through first order dynamical systems with hidden acceleration and Hessian driven damping terms
• Inertial proximal alternating minimization for nonconvex and nonsmooth problems
• Modified extragradient algorithms for solving equilibrium problems
• An inertial-like proximal algorithm for equilibrium problems
• An inertial method for solving split common fixed point problems
• A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
• An inexact majorized proximal alternating direction method of multipliers for diffusion tensors
• Unifying abstract inexact convergence theorems and block coordinate variable metric iPiano
• Convergence Analysis for Bregman Iterations in Minimizing a Class of Landau Free Energy Functionals
• Proximal point type algorithms with relaxed and inertial effects beyond convexity
• Convergence of inertial modified Krasnoselskii-Mann iteration with application to image recovery
• An improved inertial extragradient subgradient method for solving split variational inequality problems
• Inertial viscosity iterative method for solving pseudo-monotone variational inequality problems and fixed point problems
• Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization
• A mirror inertial forward-reflected-backward splitting: convergence analysis beyond convexity and Lipschitz smoothness
• New Tseng's extragradient methods for pseudomonotone variational inequality problems in Hadamard manifolds
• Convergence analysis of new inertial method for the split common null point problem
• A forward-backward dynamical approach to the minimization of the sum of a nonsmooth convex with a smooth nonconvex function
• Two inertial proximal coordinate algorithms for a family of nonsmooth and nonconvex optimization problems
• Inertial self-adaptive algorithms for solving non-smooth convex optimization problems
• Optimality condition and quasi-conjugate duality with zero gap in nonconvex optimization
• A new self adaptive Tseng's extragradient method with double-projection for solving pseudomonotone variational inequality problems in Hilbert spaces
• A new Lagrangian-based first-order method for nonconvex constrained optimization
• New Tseng-degree gradient method in variational inequality problem
• Inertial Tseng's extragradient method for solving variational inequality problems of pseudo-monotone and non-Lipschitz operators
• Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems
• Convergence analysis of block majorize-minimize subspace approach
• scientific article; zbMATH DE number 7525859 (Why is no real title available?)
• An inertial proximal alternating direction method of multipliers for nonconvex optimization
• scientific article; zbMATH DE number 7363383 (Why is no real title available?)
• Convergence properties of monotone and nonmonotone proximal gradient methods revisited
• Tseng's extragradient method with double projection for solving pseudomonotone variational inequality problems in Hilbert spaces
• A general inertial proximal point algorithm for mixed variational inequality problem
• Penalty schemes with inertial effects for monotone inclusion problems

Describes a project that uses

Uses Software

• iPiano

This page was built for publication: An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q346822)