The following pages link to Cyclic subgradient projections (Q3953572):
Displaying 40 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)
- Relaxed outer projections, weighted averages and convex feasibility (Q751771) (← links)
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem (Q860662) (← links)
- An automatic relaxation method for solving interval linear inequalities (Q1060533) (← links)
- The projection method for solving nonlinear systems of equations under the ''most violated constraint'' control (Q1069671) (← links)
- Strong convergence of projection-like methods in Hilbert spaces (Q1089908) (← links)
- A finitely convergent ``row-action'' method for the convex feasibility problem (Q1109529) (← links)
- On some optimization techniques in image reconstruction from projections (Q1109546) (← links)
- Parallel application of block-iterative methods in medical imaging and radiation therapy (Q1111951) (← links)
- An interior points algorithm for the convex feasibility problem (Q1166775) (← links)
- A method for approximating the solution set of a system of convex inequalities by polytopes (Q1182665) (← links)
- A superlinearly convergent projection algorithm for solving the convex inequality problem (Q1271387) (← links)
- A row-action method for convex programming (Q1330898) (← links)
- Block-iterative surrogate projection methods for convex feasibility problems (Q1347226) (← links)
- Subgradient projectors: extensions, theory, and characterizations (Q1711098) (← links)
- Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems (Q1803652) (← links)
- Primal-dual row-action method for convex programming (Q1904955) (← links)
- An acceleration scheme for cyclic subgradient projections method (Q1938914) (← links)
- Quasi-convex feasibility problems: subgradient methods and convergence rates (Q2076909) (← links)
- On the finite convergence of a projected cutter method (Q2349845) (← links)
- Improved constraint consensus methods for seeking feasibility in nonlinear programs (Q2377177) (← links)
- Extrapolation algorithm for affine-convex feasibility problems (Q2494384) (← links)
- Algorithms for the quasiconvex feasibility problem (Q2570027) (← links)
- Strong convergence of alternating projections (Q2671450) (← links)
- An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem (Q2766137) (← links)
- Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem (Q2841142) (← links)
- Distributed solutions for loosely coupled feasibility problems using proximal splitting methods (Q2943811) (← links)
- Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples (Q3298016) (← links)
- A general iterative scheme with applications to convex optimization and related fields (Q3361812) (← links)
