Maximal monotone operators and the proximal point algorithm in the presence of computational errors
From MaRDI portal
Publication:637560
DOI10.1007/s10957-011-9820-8zbMath1276.90071OpenAlexW2133117228MaRDI QIDQ637560
Publication date: 6 September 2011
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-011-9820-8
Related Items
A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors ⋮ A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors ⋮ Comments on ``The proximal point algorithm revisited ⋮ The proximal point algorithm revisited ⋮ Inexact proximal point methods in metric spaces
Cites Work
- Unnamed Item
- Unnamed Item
- A regularization method for the proximal point algorithm
- An inexact interior point proximal method for the variational inequality problem
- Monotone (nonlinear) operators in Hilbert space
- Proximal minimization algorithm with \(D\)-functions
- Error bounds for proximal point subproblems and associated inexact proximal point algorithms
- On the monotonicity of the gradient of a convex function
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- Asymptotic Convergence Analysis of a New Class of Proximal Point Methods
- The Proximal Average: Basic Theory
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Bregman Monotone Optimization Algorithms
- A Proximal-Projection Method for Finding Zeros of Set-Valued Operators
- Proximité et dualité dans un espace hilbertien
- Bregman-like functions and proximal methods for variational problems with nonlinear constraints
