The over-relaxed proximal point algorithm based on \(H\)-maximal monotonicity design and applications
From MaRDI portal
Publication:945170
DOI10.1016/J.CAMWA.2007.10.025zbMath1142.49309OpenAlexW2034100961MaRDI QIDQ945170
Publication date: 11 September 2008
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2007.10.025
maximal monotone mappingvariational inclusionsgeneralized resolvent operator\(H\)-maximal monotone mapping
Variational inequalities (49J40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (3)
A remark on the strong convergence of the over-relaxed proximal point algorithm ⋮ Generalized Eckstein-Bertsekas proximal point algorithm based ona-maximal monotonicity design ⋮ On general over-relaxed proximal point algorithm and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a new system of nonlinear \(A\)-monotone multivalued variational inclusions
- \(A\)-monotonicity and its role in nonlinear variational inclusions
- General system of \(A\)-monotone nonlinear variational inclusion problems with applications
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Composition duality and maximal monotonicity
- Mixed equilibrium problems: sensitivity analysis and algorithmic aspect.
- The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem
- A-monotone nonlinear relaxed cocoercive variational inclusions
- Approximation solvability of a class of nonlinear set-valued variational inclusions involving \((A,\eta )\)-monotone mappings
- Sensitivity analysis for generalized strongly monotone variational inclusions based on the \((A,\eta )\)-resolvent operator technique
- Rockafellar's celebrated theorem based on \(A\)-maximal monotonicity design
- A new system of variational inclusions with \((H,\eta)\)-monotone operators in Hilbert spaces
- The multiplier method of Hestenes and Powell applied to convex programming
- General system of \((A,\eta )\)-monotone variational inclusion problems based on generalized hybrid iterative algorithm
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
This page was built for publication: The over-relaxed proximal point algorithm based on \(H\)-maximal monotonicity design and applications
