On general over-relaxed proximal point algorithm and applications
From MaRDI portal
Publication:3093080
DOI10.1080/02331930903499675zbMath1233.90279MaRDI QIDQ3093080
Publication date: 12 October 2011
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930903499675
maximal monotone mapping; variational inclusions; generalized resolvent operator; \(H\)-maximal monotone mapping; over-relaxed \(H\)-proximal point algorithm
90C48: Programming in abstract spaces
Related Items
Unnamed Item, Approximation solvability of a class of \(A\)-monotone implicit variational inclusion problems in semi-inner product spaces, Convergence analysis of new over-relaxed proximal point algorithm frameworks with errors and applications to general \( A\)-monotone nonlinear inclusion forms, Approximation solvability for a system of implicit nonlinear variational inclusions with \(H\)-monotone operators, On over-relaxed \((A,{\eta},m)\)-proximal point algorithm frameworks with errors and applications to general variational inclusion problems
Cites Work
- The over-relaxed proximal point algorithm based on \(H\)-maximal monotonicity design and applications
- Approximation solvability of a class of nonlinear set-valued variational inclusions involving \((A,\eta )\)-monotone mappings
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity