• Efficient Controls for Finitel...

Result: Efficient Controls for Finitely Convergent Sequential Algorithms

Title:
Efficient Controls for Finitely Convergent Sequential Algorithms
Authors:
WEI CHEN, HERMAN, Gabor T
Source:
ACM transactions on mathematical software. 37(2)
Publisher Information:
New York, NY: Association for Computing Machinery, 2011.
Publication Year:
2011
Physical Description:
print, 1/4 p
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Intelligence artificielle, Artificial intelligence, Reconnaissance des formes. Traitement numérique des images. Géométrie algorithmique, Pattern recognition. Digital image processing. Computational geometry, Calcul scientifique, Scientific computation, Computación científica, Contrainte, Constraint, Coacción, Cyclique, Cyclic, Cíclico, Evaluation performance, Performance evaluation, Evaluación prestación, Faisabilité, Feasibility, Practicabilidad, Méthode séquentielle, Sequential method, Método secuencial, Optimisation sousgradient, Subgradient optimization, Optimizacíon subgradiente, Programmation convexe, Convex programming, Programación convexa, Reconstruction image, Image reconstruction, Reconstrucción imagen, Résolution problème, Problem solving, Resolución problema, Satisfaction contrainte, Constraint satisfaction, Satisfaccion restricción, Vitesse convergence, Convergence speed, Velocidad convergencia, Algebraic reconstruction technique, Algorithms, Design, Experimentation, Performance, Theory, cyclic subgradient projections, feasibility problem, finite convergence, sequential algorithm
Document Type:
Academic journal Article
File Description:
text
Language:
English
Author Affiliations:
City University of New York, United States
ISSN:
0098-3500
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=24358906
Rights:
Copyright 2015 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.24358906
Database:
PASCAL Archive

Further Information

Finding a feasible point that satisfies a set of constraints is a common task in scientific computing; examples are the linear feasibility problem and the convex feasibility problem. Finitely convergent sequential algorithms can be used for solving such problems; an example of such an algorithm is ART3, which is defined in such a way that its control is cyclic in the sense that during its execution it repeatedly cycles through the given constraints. Previously we found a variant of ART3 whose control is no longer cyclic, but which is still finitely convergent and in practice usually converges faster than ART3. In this article we propose a general methodology for automatic transformation of finitely convergent sequential algorithms in such a way that (1) finite convergence is retained, and (2) the speed of convergence is improved. The first of these properties is proven by mathematical theorems, the second is illustrated by applying the algorithms to a practical problem.