Finite termination of inexact proximal point algorithms in Hilbert spaces
DOI10.1007/s10957-014-0689-1zbMath1332.49017OpenAlexW1984051602MaRDI QIDQ493258
Jen-Chih Yao, Chong Li, Jin-Hua Wang
Publication date: 3 September 2015
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-014-0689-1
optimization problemsprojected gradient methodmaximal monotonicityinexact proximal point algorithmsset-valued operators
Numerical optimization and variational techniques (65K10) Monotone operators and generalizations (47H05) Set-valued and variational analysis (49J53) Iterative procedures involving nonlinear operators (47J25) Set-valued operators (47H04) Variational and other types of inclusions (47J22)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convergence properties of the projected gradient method for convex optimization
- A proximal point algorithm converging strongly for general errors
- Four parameter proximal point algorithms
- Inexact Halpern-type proximal point algorithm
- Finite termination of the proximal point algorithm in Banach spaces
- Error bounds for nondegenerate monotone linear complementarity problems
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions
- An inexact interior point proximal method for the variational inequality problem
- Weak convergence theorems for nonexpansive mappings in Banach spaces
- Finite termination of the proximal point algorithm
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Approximation of fixed points of nonexpansive mappings
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
- Approximating solutions of maximal monotone operators in Hilbert spaces
- On the contraction-proximal point algorithms with multi-parameters
- On the maximal monotonicity of subdifferential mappings
- Weak sharp minima revisited. II: Application to linear regularity and error bounds
- Characterization of solution sets of convex programs
- On convergence of the proximal point algorithm in Banach spaces
- Weak Sharp Minima in Mathematical Programming
- Iterative Algorithms for Nonlinear Operators
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- Monotone vector fields and the proximal point algorithm on Hadamard manifolds
- Projected gradient methods for linearly constrained problems
- Nonlinear Perturbation of Linear Programs
- New Proximal Point Algorithms for Convex Minimization
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Proximité et dualité dans un espace hilbertien
- Fixed points of nonexpanding maps
- Nonlinear mappings of nonexpansive and accretive type in Banach spaces
- Convex analysis and monotone operator theory in Hilbert spaces
- Weak and strong convergence of solutions to accretive operator inclusions and applications
This page was built for publication: Finite termination of inexact proximal point algorithms in Hilbert spaces
