On the convergence of broadcast incremental algorithms with applications
From MaRDI portal
Cites work
- A generalized hybrid steepest descent method and applications
- A multi-step approximant for fixed point problem and convex optimization problem in Hadamard spaces
- A new method for solving variational inequalities and fixed points problems of demi-contractive mappings in Hilbert spaces
- A proximal decomposition method for solving convex variational inverse problems
- A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
- A subgradient method based on gradient sampling for solving convex optimization problems
- Additive Schwarz methods for convex optimization with backtracking
- An extended projected residual algorithm for solving smooth convex optimization problems
- An iterative approach to quadratic optimization
- Approximation of solutions of the split minimization problem with multiple output sets and common fixed point problems in real Banach spaces
- Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
- Convergence of projection and contraction algorithms with outer perturbations and their applications to sparse signals recovery
- Convex analysis and monotone operator theory in Hilbert spaces
- Extension of the Hybrid Steepest Descent Method to a Class of Variational Inequalities and Fixed Point Problems with Nonself-Mappings
- Fixed Point Strategies in Data Science
- Gradient-based local formulations of the Vickrey-Clarke-Groves mechanism for truthful minimization of social convex objectives
- Hybrid viscosity implicit scheme for variational inequalities over the fixed point set of an asymptotically nonexpansive mapping in the intermediate sense in Banach spaces
- Mean Value Methods in Iteration
- On the removal of weak compactness arguments in proof mining
- Potential Function-Based Framework for Minimizing Gradients in Convex and Min-Max Optimization
- Some iterative methods for finding fixed points and for solving constrained convex minimization problems
- Subgradient ellipsoid method for nonsmooth convex problems
- The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
This page was built for publication: On the convergence of broadcast incremental algorithms with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6612687)
