Pages that link to "Item:Q1109529"

The following pages link to A finitely convergent ``row-action'' method for the convex feasibility problem (Q1109529):

Displaying 17 items.

• Subgradient projection algorithms and approximate solutions of convex feasibility problems (Q364738) (← links)
• Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods (Q494329) (← 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)
• Generalization: One technique of computational and applied mathematical methodology (Q932560) (← links)
• A method for approximating the solution set of a system of convex inequalities by polytopes (Q1182665) (← links)
• A row-action method for convex programming (Q1330898) (← links)
• Primal-dual row-action method for convex programming (Q1904955) (← links)
• Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy (Q2020314) (← links)
• Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems (Q2149580) (← links)
• Finitely convergent iterative methods with overrelaxations revisited (Q2239369) (← links)
• On the finite convergence of a projected cutter method (Q2349845) (← links)
• The direct-projection methods (Q2720131) (← links)
• Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem (Q2841142) (← links)
• Nesterov perturbations and projection methods applied to IMRT (Q4959911) (← links)