On finitely convergent iterative methods for the convex feasibility problem

DOI10.1007/BF02584829zbMath0742.65045MaRDI QIDQ3991358

Leonardo Moledo, Alfredo Noel Iusem

Publication date: 28 June 1992

Published in: Boletim da Sociedade Brasileira de Matemática (Search for Journal in Brave)

zbMATH Keywords

convex feasibility problemfinitely convergent iterative methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items

Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems, Generalization: One technique of computational and applied mathematical methodology, Finitely convergent iterative methods with overrelaxations revisited, A generalized projection-based scheme for solving convex constrained optimization problems, On the finite convergence of a projected cutter method

Cites Work

• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Cyclic subgradient projections
• Convex Analysis
• The method of projections for finding the common point of convex sets
• The Relaxation Method for Linear Inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item