Inertial proximal algorithm for difference of two maximal monotone operators

DOI10.1007/s13226-015-0162-3OpenAlexW2291327439MaRDI QIDQ1616724

M. Ramazannejad, Mohsen Alimohammady

Publication date: 7 November 2018

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13226-015-0162-3

zbMATH Keywords

maximal monotone operatorproximal point algorithm

Mathematics Subject Classification ID

Operator theory (47-XX)

Related Items (1)

An inertial proximal point method for difference of maximal monotone vector fields in Hadamard manifolds

Cites Work

• Unnamed Item
• Unnamed Item
• On the difference of two maximal monotone operators: Regularization and algorithmic approaches
• Minimax second-order designs over cuboidal regions for the difference between two estimated responses
• Ishikawa iteration process with errors for nonexpansive mappings in uniformly convex Banach spaces
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Notes on the difference of two monotone operators
• On critical points of the difference of two maximal monotone operators
• Local boundedness of nonlinear, monotone operators
• On the maximal monotonicity of subdifferential mappings
• Strong pseudo-convex programming
• Dithering by Differences of Convex Functions
• Nonlinear Ill-posed Problems of Monotone Type
• Solvability of generalized nonlinear symmetric variational inequalities
• Set-valued analysis

This page was built for publication: Inertial proximal algorithm for difference of two maximal monotone operators