The following pages link to Cyclic subgradient projections (Q3953572):
Displaying 12 items.
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space (Q297551) (← links)
- Subgradient projection algorithms and approximate solutions of convex feasibility problems (Q364738) (← links)
- Subgradient method for convex feasibility on Riemannian manifolds (Q415385) (← links)
- Convex feasibility modeling and projection methods for sparse signal recovery (Q442713) (← links)
- Algorithmic approach to a minimization problem (Q448663) (← links)
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods (Q494329) (← links)
- Convergence analysis of a parallel projection algorithm for solving convex feasibility problems (Q501512) (← links)
- Non-monotonous sequential subgradient projection algorithm for convex feasibility problem (Q519264) (← links)
- Minimization of equilibrium problems, variational inequality problems and fixed point problems (Q604954) (← links)
- Finite convergence of a subgradient projections method with expanding controls (Q649124) (← links)
- Hilbertian convex feasibility problem: Convergence of projection methods (Q678107) (← links)
- A generalized projection-based scheme for solving convex constrained optimization problems (Q721952) (← links)