An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem

DOI10.1080/09720529.2001.10697922zbMath0990.65062OpenAlexW2319301439MaRDI QIDQ2766137

Cevdet Aykanat, Hakan Özaktaş, Mustafa Akgül, Mustafa Çelebi Pinar, Tahsin M. Kurç

Publication date: 27 January 2002

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2001.10697922

zbMATH Keywords

performancenumerical examplesconvergence accelerationconvex feasibility problemstep-size controllinear feasibility problemsimultaneous block projection algorithmssuccessive block projection algorithms

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simultaneous projections method for linear inequalities
• A parallel subgradient projections method for the convex feasibility problem
• New iterative methods for linear inequalities
• Block-iterative surrogate projection methods for convex feasibility problems
• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
• Cyclic subgradient projections
• Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem
• On Projection Algorithms for Solving Convex Feasibility Problems
• An iterative method, having linear rate of convergence, for solving a pair of dual linear programs
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities

This page was built for publication: An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem