Generalized Eckstein-Bertsekas proximal point algorithm involving (H, )-monotonicity framework
From MaRDI portal
Publication:2643765
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
Cites work
- scientific article; zbMATH DE number 45061 (Why is no real title available?)
- scientific article; zbMATH DE number 1206949 (Why is no real title available?)
- scientific article; zbMATH DE number 2067003 (Why is no real title available?)
- scientific article; zbMATH DE number 757678 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A class of nonlinear \((A,\eta)\)-monotone operator inclusion problems with relaxed cocoercive mappings
- A new system of variational inclusions with \((H,\eta)\)-monotone operators in Hilbert spaces
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Approximate iterations in Bregman-function-based proximal algorithms
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Composition duality and maximal monotonicity
- Enlarging the region of convergence of Newton's method for constrained optimization
- Finite termination of the proximal point algorithm
- Generalized nonlinear variational-like inequalities
- Iterative algorithm for a new system of nonlinear set-valued variational inclusions involving \((H, \eta)\)-monotone mappings
- Linear convergence of epsilon-subgradient descent methods for a class of convex functions
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
- Mixed equilibrium problems: sensitivity analysis and algorithmic aspect.
- Monotone Operators and the Proximal Point Algorithm
- Necessary and sufficient conditions for a penalty method to be exact
- New class of nonlinear \(A\)-monotone mixed variational inclusion problems and resolvent operator technique
- New resolvent operator technique for a class of general \((A,\eta)\)-accretive equations in Banach spaces
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Nonlinear \(A\)-monotone variational inclusions systems and the resolvent operator technique
- On a new system of nonlinear \(A\)-monotone multivalued variational inclusions
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- On the maximal monotonicity of subdifferential mappings
- Smooth methods of multipliers for complementarity problems
- The perturbed proximal point algorithm and some of its applications
- Variational Analysis
- \(A\)-monotonicity and its role in nonlinear variational inclusions
Cited in
(6)- Generalized Eckstein-Bertsekas proximal point algorithm based ona-maximal monotonicity design
- The Eckstein-Bertsekas proximal point algorithm and its applications to inclusion problems based on the generalized firm nonexpansiveness
- 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
- Linear convergence analysis for general proximal point algorithms involving \(({\mathcal H},\eta)\)-monotonicity frameworks
- 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)