Pages that link to "Item:Q3083292"
From MaRDI portal
The following pages link to Convergence of a Proximal Point Method in the Presence of Computational Errors in Hilbert Spaces (Q3083292):
Displayed 10 items.
- Global convergence of a proximal linearized algorithm for difference of convex functions (Q331993) (← links)
- The extragradient method for solving variational inequalities in the presence of computational errors (Q438778) (← links)
- A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors (Q448514) (← links)
- Inexact proximal point methods in metric spaces (Q763334) (← links)
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem (Q2158622) (← links)
- Inexact first-order primal-dual algorithms (Q2181598) (← links)
- A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption (Q2322358) (← links)
- Convergence rates of accelerated proximal gradient algorithms under independent noise (Q2420162) (← links)
- A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors (Q5346620) (← links)
- Perturbation resilience of proximal gradient algorithm for composite objectives (Q5743220) (← links)