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

DOI10.1016/J.MCM.2006.09.019zbMATH Open1149.90383OpenAlexW2045759478MaRDI QIDQ2643765FDOQ2643765

Authors: 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

Recommendations

• Generalized Eckstein-Bertsekas proximal point algorithm based ona-maximal monotonicity design
• General framework for proximal point algorithms on \((A,\eta)\)-maximal monotonicity for nonlinear variational inclusions
• General inexact proximal point algorithm and \(\eta\)-maximal monotonicity models with application to minimization
• General proximal-point algorithm for monotone operators
• Linear convergence analysis for general proximal point algorithms involving \(({\mathcal H},\eta)\)-monotonicity frameworks
• On the proximal point algorithm and its Halpern-type variant for generalized monotone operators in Hilbert space
• A hybrid proximal point algorithm based on the \((A,\eta )\)-maximal monotonicity framework
• General proximal point algorithm involving \(\eta \)-maximal accretiveness framework in Banach spaces
• An approximate proximal extragradient algorithm for general monotone variational inequalities
• A generalized contraction proximal point algorithm with two monotone operators

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Variational Analysis
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
• Linear convergence of epsilon-subgradient descent methods for a class of convex functions
• Title not available (Why is that?)
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Title not available (Why is that?)
• Approximate iterations in Bregman-function-based proximal algorithms
• A new system of variational inclusions with \((H,\eta)\)-monotone operators in Hilbert spaces
• On the maximal monotonicity of subdifferential mappings
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• Finite termination of the proximal point algorithm
• Necessary and sufficient conditions for a penalty method to be exact
• Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
• Title not available (Why is that?)
• On a new system of nonlinear \(A\)-monotone multivalued variational inclusions
• \(A\)-monotonicity and its role in nonlinear variational inclusions
• Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
• Enlarging the region of convergence of Newton's method for constrained optimization
• An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
• A class of nonlinear \((A,\eta)\)-monotone operator inclusion problems with relaxed cocoercive mappings
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Composition duality and maximal monotonicity
• The perturbed proximal point algorithm and some of its applications
• Title not available (Why is that?)
• Mixed equilibrium problems: sensitivity analysis and algorithmic aspect.
• Iterative algorithm for a new system of nonlinear set-valued variational inclusions involving \((H, \eta)\)-monotone mappings
• Smooth methods of multipliers for complementarity problems
• Title not available (Why is that?)
• New class of nonlinear \(A\)-monotone mixed variational inclusion problems and resolvent operator technique
• Nonlinear \(A\)-monotone variational inclusions systems and the resolvent operator technique
• Generalized nonlinear variational-like inequalities
• New resolvent operator technique for a class of general \((A,\eta)\)-accretive equations in Banach spaces

Cited In (6)

• Graph convergence for the \(H(\cdot , \cdot )\)-accretive operator in Banach spaces with an application
• Linear convergence analysis for general proximal point algorithms involving \(({\mathcal H},\eta)\)-monotonicity frameworks
• General proximal point algorithm involving \(\eta \)-maximal accretiveness framework in Banach spaces
• The Eckstein-Bertsekas proximal point algorithm and its applications to inclusion problems based on the generalized firm nonexpansiveness
• Generalized Eckstein-Bertsekas proximal point algorithm based ona-maximal monotonicity design
• A hybrid proximal point algorithm based on the \((A,\eta )\)-maximal monotonicity framework

This page was built for publication: Generalized Eckstein-Bertsekas proximal point algorithm involving \((H,\eta )\)-monotonicity framework

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643765)