Relatively inexact proximal point algorithm and linear convergence analysis

DOI10.1155/2009/691952zbMath1185.49034OpenAlexW2009467175WikidataQ58648500 ScholiaQ58648500MaRDI QIDQ963522

Ram U. Verma

Publication date: 20 April 2010

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/226599

zbMATH Keywords

convergence analysisYosida approximationrelatively maximal \((m)\)-relaxed monotonicityRockafellar's theorem

Mathematics Subject Classification ID

Convex programming (90C25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(A\)-monotonicity and its role in nonlinear variational inclusions
• Inexact \(A\)-proximal point algorithm and applications to nonlinear variational inclusion problems
• Role of relative \(A\)-maximal monotonicity in overrelaxed proximal-point algorithms with Applications
• The perturbed proximal point algorithm and some of its applications
• Finding a zero of the sum of two maximal monotone operators
• A-monotone nonlinear relaxed cocoercive variational inclusions
• Approximation solvability of a class of nonlinear set-valued variational inclusions involving \((A,\eta )\)-monotone mappings
• Nonlinear relaxed cocoercive variational inclusions involving \((A,\eta)\)-accretive mappings in Banach spaces
• On the maximal monotonicity of subdifferential mappings
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming

This page was built for publication: Relatively inexact proximal point algorithm and linear convergence analysis