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

DOI10.1007/s10957-015-0730-zzbMath1349.90688arXiv1406.0724OpenAlexW2092607002MaRDI QIDQ346822

Ernö Robert Csetnek, Radu Ioan Boţ

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 optimizationlimiting subdifferentialBregman distanceinertial proximal algorithmKurdyka-Łojasiewicz inequalityTseng's type proximal algorithm

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, New extragradient methods for solving variational inequality problems and fixed point problems, Modified Tseng's extragradient algorithms for variational inequality problems, An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions, An inertial-like proximal algorithm for equilibrium problems, A General Inertial Proximal Point Algorithm for Mixed Variational Inequality Problem, New Tseng's extragradient methods for pseudomonotone variational inequality problems in Hadamard manifolds, Fast convergence of dynamical ADMM via time scaling of damped inertial dynamics, 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, Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization, An inertial subgradient extragradient algorithm with adaptive stepsizes for variational inequality 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, Inertial proximal alternating minimization for nonconvex and nonsmooth problems, An improved inertial extragradient subgradient method for solving split variational inequality problems, New strong convergence theorem of the inertial projection and contraction method for variational inequality problems, Inertial viscosity iterative method for solving pseudo-monotone variational inequality problems and fixed point problems, An inertial method for solving split common fixed point problems, A strong convergence result involving an inertial forward-backward algorithm for monotone inclusions, Inertial proximal point algorithm for the split common solution problem of monotone operator equations, 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, Unnamed Item, An inertial self-adaptive iterative algorithm for finding the common solutions to split feasibility and fixed point problems in specific Banach spaces, 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, A relaxed forward-backward-forward algorithm with alternated inertial step: weak and linear convergence, New Tseng-degree gradient method in variational inequality problem, Convergence Analysis for Bregman Iterations in Minimizing a Class of Landau Free Energy Functionals, An accelerated forward-backward-half forward splitting algorithm for monotone inclusion with applications to image restoration, The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates, Unnamed Item, Unnamed Item, Inertial approximation method for split variational inclusion problem in Banach spaces, A new strong convergence for solving split variational inclusion problems, Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano, Optimality condition and quasi-conjugate duality with zero gap in nonconvex optimization, Unnamed Item, Inertial subgradient extragradient algorithms with line-search process for solving variational inequality problems and fixed point problems, Mann-type algorithms for variational inequality problems and fixed point problems, Modified extragradient algorithms for solving equilibrium 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, Unnamed Item, A novel inertial projection and contraction method for solving pseudomonotone variational inequality problems, Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods, Modified subgradient extragradient method for variational inequality problems, Strong convergence theorems for solving variational inequality problems with pseudo-monotone and non-Lipschitz operators, 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 hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems, A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems, A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems, The extragradient algorithm with inertial effects for solving the variational inequality, New algorithms for the split variational inclusion problems and application to split feasibility problems, Strong convergence of extragradient methods with a new step size for solving variational inequality problems, 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, 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, Viscosity approximation method for solving variational inequality problem in real Banach spaces

Uses Software

• iPiano

Cites Work

• 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
• An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
• Inertial Douglas-Rachford splitting for monotone inclusion problems
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
• 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 Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality
• Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
• Convergence of New Inertial Proximal Methods for DC Programming
• Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
• 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
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• A Dynamical Approach to an Inertial Forward-Backward Algorithm for Convex Minimization
• 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