Convergence of New Inertial Proximal Methods for DC Programming
DOI10.1137/060655183zbMATH Open1158.49034OpenAlexW1996286740MaRDI QIDQ3608989FDOQ3608989
Authors: Paul-Emile Maingé, Abdellatif Moudafi 
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
Recommendations
Numerical optimization and variational techniques (65K10) Convex programming (90C25) Numerical methods based on nonlinear programming (49M37) Nonsmooth analysis (49J52) Discrete approximations in optimal control (49M25)
Cited In (36)
- 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
- 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
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- Asymptotics for some proximal-like method involving inertia and memory aspects
- A forward-backward algorithm for the DC programming in Hilbert spaces
- New inertial algorithm for a class of equilibrium problems
- An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
- Modified subgradient extragradient method for variational inequality problems
- A unified scheme for solving split inclusions with applications
- A forward–backward penalty scheme with inertial effects for monotone inclusions. Applications to convex bilevel programming
- A general double-proximal gradient algorithm for d.c. programming
- Title not available (Why is that?)
- A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
- A new accelerated self-adaptive stepsize algorithm with excellent stability for split common fixed point problems
- Inertial proximal alternating minimization for nonconvex and nonsmooth problems
- Modified extragradient algorithms for solving equilibrium problems
- An inertial method for solving split common fixed point problems
- Computing B-stationary points of nonsmooth DC programs
- On the convergence of an approximate proximal method for DC functions
- A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging
- A variable metric proximal-descent algorithm for monotone operators
- Fixed point iterations coupled with relaxation factors and inertial effects
- Two inertial proximal coordinate algorithms for a family of nonsmooth and nonconvex optimization problems
- Yosida approximation methods for generalized equilibrium problems
- A modified proximal point method for DC functions on Hadamard manifolds
- AN INERTIAL SHRINKING PROJECTION ALGORITHM FOR SPLIT COMMON FIXED POINT PROBLEMS
- An inertial proximal point method for difference of maximal monotone vector fields in Hadamard manifolds
- A Hybrid Proximal-Extragradient Algorithm with Inertial Effects
- Convergence of a proximal-type method for DC functions
- Convergence results of two-step inertial proximal point algorithm
- Title not available (Why is that?)
- Penalty schemes with inertial effects for monotone inclusion problems
- Weak convergence of explicit extragradient algorithms for solving equilibrium problems
This page was built for publication: Convergence of New Inertial Proximal Methods for DC Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608989)
