Maximal monotone operators and the proximal point algorithm in the presence of computational errors
From MaRDI portal
Publication:637560
DOI10.1007/S10957-011-9820-8zbMATH Open1276.90071OpenAlexW2133117228MaRDI QIDQ637560FDOQ637560
Authors: Alexander J. Zaslavski 
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
Recommendations
- A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors
- scientific article; zbMATH DE number 2190327
- Convergence of a proximal point method in the presence of computational errors in Hilbert spaces
- An approximate proximal point algorithm for maximal monotone inclusion problems
- A projection approximate proximal algorithm for maximal monotone operators
Cites Work
- Monotone (nonlinear) operators in Hilbert space
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Bregman Monotone Optimization Algorithms
- Proximité et dualité dans un espace hilbertien
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- A regularization method for the proximal point algorithm
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- Proximal minimization algorithm with \(D\)-functions
- On the monotonicity of the gradient of a convex function
- A Proximal-Projection Method for Finding Zeros of Set-Valued Operators
- Error bounds for proximal point subproblems and associated inexact proximal point algorithms
- The Proximal Average: Basic Theory
- An inexact interior point proximal method for the variational inequality problem
- Asymptotic Convergence Analysis of a New Class of Proximal Point Methods
- Bregman-like functions and proximal methods for variational problems with nonlinear constraints
- Title not available (Why is that?)
- An infeasible interior proximal method for convex programming problems with linear constraints
Cited In (9)
- Convergence of a proximal-like algorithm in the presence of computational errors
- Title not available (Why is that?)
- A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors
- Inexact proximal point methods in metric spaces
- The proximal point algorithm revisited
- A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors
- Title not available (Why is that?)
- Comments on ``The proximal point algorithm revisited
- Convergence of a proximal point method in the presence of computational errors in Hilbert spaces
This page was built for publication: Maximal monotone operators and the proximal point algorithm in the presence of computational errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q637560)
