A finitely convergent ``row-action method for the convex feasibility problem
From MaRDI portal
Publication:1109529
DOI10.1007/BF01448368zbMath0655.65085MaRDI QIDQ1109529
Alvaro Rodolfo de Pierro, Alfredo Noel Iusem
Publication date: 1988
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
convex feasibility problemSlater conditionlinear rate of convergencecyclic subgradient projection methodrow- action methodsparse systems of convex inequalities
Related Items
A row-action method for convex programming, Asymptotically optimal row-action methods for generalized least squares problems, Linear Convergence of Subgradient Algorithm for Convex Feasibility on Riemannian Manifolds, Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems, Primal-dual row-action method for convex programming, Subgradient projection algorithms and approximate solutions of convex feasibility problems, A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors, Finite convergence of a subgradient projections method with expanding controls, The direct-projection methods, Generalization: One technique of computational and applied mathematical methodology, A method for approximating the solution set of a system of convex inequalities by polytopes, Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods, Finitely convergent iterative methods with overrelaxations revisited, Hilbertian convex feasibility problem: Convergence of projection methods, Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy, A generalized projection-based scheme for solving convex constrained optimization problems, Nesterov perturbations and projection methods applied to IMRT, Relaxed outer projections, weighted averages and convex feasibility, Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm, Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem, Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections, On the finite convergence of a projected cutter method
Cites Work
- Unnamed Item
- A primal-dual projection method for solving systems of linear inequalities
- Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Cyclic subgradient projections
- The method of projections for finding the common point of convex sets
- The Relaxation Method for Linear Inequalities
