A finitely convergent ``row-action method for the convex feasibility problem
From MaRDI portal
Publication:1109529
DOI10.1007/BF01448368zbMATH Open0655.65085MaRDI QIDQ1109529FDOQ1109529
Álvaro Rodolfo De Pierro, Alfredo Iusem
Publication date: 1988
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Slater conditionconvex feasibility problemlinear rate of convergencecyclic subgradient projection methodrow- action methodsparse systems of convex inequalities
Cites Work
- Title not available (Why is that?)
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- The method of projections for finding the common point of convex sets
- The Relaxation Method for Linear Inequalities
- A primal-dual projection method for solving systems of linear inequalities
- Cyclic subgradient projections
- 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
Cited In (23)
- A generalized projection-based scheme for solving convex constrained optimization problems
- On the finite convergence of a projected cutter method
- Asymptotically optimal row-action methods for generalized least squares problems
- Nesterov perturbations and projection methods applied to IMRT
- A finitely convergent circumcenter method for the convex feasibility problem
- A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors
- Finitely convergent iterative methods with overrelaxations revisited
- Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy
- Hilbertian convex feasibility problem: Convergence of projection methods
- Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem
- Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
- Relaxed outer projections, weighted averages and convex feasibility
- Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems
- A row-action method for convex programming
- Linear Convergence of Subgradient Algorithm for Convex Feasibility on Riemannian Manifolds
- A method for approximating the solution set of a system of convex inequalities by polytopes
- The direct-projection methods
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
- Primal-dual row-action method for convex programming
- Finite convergence of a subgradient projections method with expanding controls
- Subgradient projection algorithms and approximate solutions of convex feasibility problems
- Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm
- Generalization: One technique of computational and applied mathematical methodology
This page was built for publication: A finitely convergent ``row-action method for the convex feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109529)
