Generalized inexact proximal point algorithm and its role to linear convergence analysis
From MaRDI portal
Recommendations
- Relatively inexact proximal point algorithm and linear convergence analysis
- On general inexact proximal point algorithms and their contributions to linear convergence analysis
- New approach based on relatively inexact proximal point algorithms to linear convergence analysis and applications
- The hybrid maximal monotonicity with a new approach to general linear convergence analysis
- Hybrid inexact proximal point algorithms based on RMM frameworks with applications to variational inclusion problems
Cited in
(11)- General class of implicit variational inclusions and graph convergence on A-maximal relaxed monotonicity
- New approach based on relatively inexact proximal point algorithms to linear convergence analysis and applications
- On general inexact proximal point algorithms and their contributions to linear convergence analysis
- The hybrid maximal monotonicity with a new approach to general linear convergence analysis
- Tight sublinear convergence rate of the proximal point algorithm for maximal monotone inclusion problems
- The super-relaxed class of relatively proximal point algorithms and their roles to linear convergence analysis
- scientific article; zbMATH DE number 1062747 (Why is no real title available?)
- Generalized inexact proximal algorithms: routine's formation with resistance to change, following worthwhile changes
- A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality
- On convergence criteria of generalized proximal point algorithms
- Relatively inexact proximal point algorithm and linear convergence analysis
This page was built for publication: Generalized inexact proximal point algorithm and its role to linear convergence analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3400258)
