Convergence of New Inertial Proximal Methods for DC Programming

DOI10.1137/060655183zbMath1158.49034OpenAlexW1996286740MaRDI QIDQ3608989

Abdellatif Moudafi, Paul-Emile Maingé

Publication date: 6 March 2009

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

Full work available at URL: https://doi.org/10.1137/060655183

zbMATH Keywords

critical pointssubdifferentialsproximal mappingsDC minimization

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52) Numerical methods based on nonlinear programming (49M37) Discrete approximations in optimal control (49M25)

Related Items (30)

Penalty schemes with inertial effects for 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 ⋮ A Hybrid Proximal-Extragradient Algorithm with Inertial Effects ⋮ Unnamed Item ⋮ An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems ⋮ Inertial proximal alternating minimization for nonconvex and nonsmooth problems ⋮ An inertial method for solving split common fixed point problems ⋮ A modified proximal point method for DC functions on Hadamard manifolds ⋮ A new accelerated self-adaptive stepsize algorithm with excellent stability for split common fixed point problems ⋮ A unified scheme for solving split inclusions with applications ⋮ Asymptotics for some proximal-like method involving inertia and memory aspects ⋮ An inertial proximal point method for difference of maximal monotone vector fields in Hadamard manifolds ⋮ Computing B-Stationary Points of Nonsmooth DC Programs ⋮ Unnamed Item ⋮ New inertial algorithm for a class of equilibrium 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 ⋮ Modified subgradient extragradient method for variational inequality problems ⋮ A forward–backward penalty scheme with inertial effects for monotone inclusions. Applications to convex bilevel programming ⋮ A variable metric proximal-descent algorithm for monotone operators ⋮ A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems ⋮ A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems ⋮ Weak convergence of explicit extragradient algorithms for solving equilibrium problems ⋮ A forward-backward algorithm for the DC programming in Hilbert spaces ⋮ A general double-proximal gradient algorithm for d.c. programming ⋮ Fixed point iterations coupled with relaxation factors and inertial effects ⋮ AN INERTIAL SHRINKING PROJECTION ALGORITHM FOR SPLIT COMMON FIXED POINT PROBLEMS ⋮ An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems

This page was built for publication: Convergence of New Inertial Proximal Methods for DC Programming