Efficient controls for finitely convergent sequential algorithms

DOI10.1145/1731022.1731024zbMath1364.65003DBLPjournals/toms/ChenH10OpenAlexW2003797744WikidataQ34189810 ScholiaQ34189810MaRDI QIDQ2989096

Gabor T. Herman, Wei Chen

Publication date: 19 May 2017

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: http://europepmc.org/articles/pmc2952966

zbMATH Keywords

sequential algorithmfinite convergencefeasibility problemalgebraic reconstruction techniquecyclic subgradient projections

Mathematics Subject Classification ID

Nonlinear programming (90C30) Acceleration of convergence in numerical analysis (65B99)

Related Items (4)

The Method of Cyclic Intrepid Projections: Convergence Analysis and Numerical Experiments ⋮ Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems ⋮ On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints ⋮ Finite convergence of a subgradient projections method with expanding controls

This page was built for publication: Efficient controls for finitely convergent sequential algorithms