The following pages link to (Q3028739):
Displayed 10 items.
- Convex feasibility modeling and projection methods for sparse signal recovery (Q442713) (← links)
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods (Q494329) (← links)
- Hilbertian convex feasibility problem: Convergence of projection methods (Q678107) (← 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)
- 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)
- On finitely convergent iterative methods for the convex feasibility problem (Q3991358) (← links)
- Speedup of lexicographic optimization by superiorization and its applications to cancer radiotherapy treatment (Q5346631) (← links)