scientific article; zbMATH DE number 776083
From MaRDI portal
Publication:4840103
Recommendations
- Approximate iterations in Bregman-function-based proximal algorithms
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Proximal point algorithms with Bregman functions in Banach spaces
- The proximal point algorithm revisited
- Bregman distance and strong convergence of proximal-type algorithms
Cited in
(12)- Approximate iterations in Bregman-function-based proximal algorithms
- A primal-dual proximal point algorithm for constrained convex programs
- Bregman primal-dual first-order method and application to sparse semidefinite programming
- Theoretical aspect of diagonal Bregman proximal methods
- Bregman three-operator splitting methods
- A proximal method with logarithmic barrier for nonlinear complementarity problems
- Ergodic convergence of a stochastic proximal point algorithm
- Ergodic convergence in subgradient optimization with application to simplical decomposition of convex programs
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Ergodic convergence in subgradient optimization
- Convergence of a proximal point algorithm for solving minimization problems
- On the linear convergence of a Bregman proximal point algorithm
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4840103)
