Pages that link to "Item:Q2829569"
From MaRDI portal
The following pages link to Incremental subgradient method for nonsmooth convex optimization with fixed point constraints (Q2829569):
Displaying 14 items.
- Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings (Q288530) (← links)
- Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings (Q312694) (← links)
- Proximal point algorithms for nonsmooth convex optimization with fixed point constraints (Q323195) (← links)
- Convergence of a distributed method for minimizing sum of convex functions with fixed point constraints (Q2073009) (← links)
- Primal-dual incremental gradient method for nonsmooth and convex optimization problems (Q2230784) (← links)
- Fixed point quasiconvex subgradient method (Q2282530) (← links)
- String-averaging incremental subgradients for constrained convex optimization with applications to reconstruction of tomographic images (Q2835449) (← links)
- Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings (Q2897289) (← links)
- A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems (Q3586129) (← links)
- Path-based incremental target level algorithm on Riemannian manifolds (Q5221271) (← links)
- Iterative methods for parallel convex optimization with fixed point constraints (Q5244136) (← links)
- Two stochastic optimization algorithms for convex optimization with fixed point constraints (Q5379458) (← links)
- Stochastic subgradient algorithm for nonsmooth nonconvex optimization (Q6578251) (← links)
- Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem (Q6586914) (← links)
