A note on the convergence of an inertial version of a diagonal hybrid projection-point algorithm
From MaRDI portal
Publication:3577847
Recommendations
- Convergence of a Hybrid Projection-Proximal Point Algorithm Coupled with Approximation Methods in Convex Optimization
- Coupling the proximal point algorithm with approximation methods
- scientific article; zbMATH DE number 2107573
- scientific article; zbMATH DE number 5586189
- Convergence theorems for inertial KM-type algorithms
Cites work
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- A dynamical approach to convex minimization coupling approximation with the steepest descent method
- Convergence of a Hybrid Projection-Proximal Point Algorithm Coupled with Approximation Methods in Convex Optimization
- Convergence of some algorithms for convex minimization
- Coupling the proximal point algorithm with approximation methods
- Monotone Operators and the Proximal Point Algorithm
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the Minimizing Property of a Second Order Dissipative System in Hilbert Spaces
- Path-Following Methods for Linear Programming
- Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
Cited in
(1)
This page was built for publication: A note on the convergence of an inertial version of a diagonal hybrid projection-point algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3577847)
