Asymptotic Convergence Analysis of a New Class of Proximal Point Methods
From MaRDI portal
Publication:3525933
Recommendations
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- Asymptotic Convergence Analysis of Some Inexact Proximal Point Algorithms for Minimization
- Asymptotic regularity and the strong convergence of the proximal point algorithm
- scientific article; zbMATH DE number 1062747
- New approach based on relatively inexact proximal point algorithms to linear convergence analysis and applications
- Convergence analysis of a proximal newton method1
- Convergence analysis of a proximal Gauss-Newton method
- Convergence analysis on an accelerated proximal point algorithm for linearly constrained optimization problems
- Convergence analysis of the relaxed proximal point algorithm
- scientific article; zbMATH DE number 7483223
Cited in
(8)- Inexact proximal point methods in metric spaces
- Maximal monotone operators and the proximal point algorithm in the presence of computational errors
- Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem
- On the local convergence of a derivative-free algorithm for least-squares minimization
- An improved proximal alternating direction method for monotone variational inequalities with separable structure
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
- A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors
- The developments of proximal point algorithms
This page was built for publication: Asymptotic Convergence Analysis of a New Class of Proximal Point Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525933)