Generalized Eckstein-Bertsekas proximal point algorithm involving \((H,\eta )\)-monotonicity framework

DOI10.1016/j.mcm.2006.09.019zbMath1149.90383OpenAlexW2045759478MaRDI QIDQ2643765

Ram U. Verma

Publication date: 27 August 2007

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2006.09.019

zbMATH Keywords

variational inclusionsgeneralized resolvent operatorgeneral firm nonexpansiveness\((H\eta )\)-monotonic mappinggeneralized Eckstein-Bertsekas proximal point algorithmmaximal monotonic mapping

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10)

Related Items

Graph convergence for the \(H(\cdot , \cdot )\)-accretive operator in Banach spaces with an application ⋮ General proximal point algorithm involving \(\eta \)-maximal accretiveness framework in Banach spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized nonlinear variational-like inequalities
• On a new system of nonlinear \(A\)-monotone multivalued variational inclusions
• \(A\)-monotonicity and its role in nonlinear variational inclusions
• Enlarging the region of convergence of Newton's method for constrained optimization
• Finite termination of the proximal point algorithm
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Approximate iterations in Bregman-function-based proximal algorithms
• Composition duality and maximal monotonicity
• The perturbed proximal point algorithm and some of its applications
• Mixed equilibrium problems: sensitivity analysis and algorithmic aspect.
• Linear convergence of epsilon-subgradient descent methods for a class of convex functions
• Smooth methods of multipliers for complementarity problems
• A new system of variational inclusions with \((H,\eta)\)-monotone operators in Hilbert spaces
• On the maximal monotonicity of subdifferential mappings
• An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
• Necessary and sufficient conditions for a penalty method to be exact
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Variational Analysis
• Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity