Belief Propagation, Dykstra's Algorithm, and Iterated Information Projections
IEEE Transactions on Information Theory, 2010Belief propagation is shown to be an instance of a hybrid between two projection algorithms in the convex programming literature: Dykstra's algorithm with cyclic Bregman projections and an alternating Bregman projections algorithm. Via this connection, new results concerning the convergence and performance of belief propagation can be proven by ...
John MacLaren Walsh, Phillip A. Regalia
openaire +1 more source
Iterative projection algorithms for ab initio phasing in virus crystallography
Journal of Structural Biology, 2016Iterative projection algorithms are proposed as a tool for ab initio phasing in virus crystallography. The good global convergence properties of these algorithms, coupled with the spherical shape and high structural redundancy of icosahedral viruses, allows high resolution phases to be determined with no initial phase information.
Victor L, Lo +2 more
openaire +2 more sources
An iteratively approximated gradient projection algorithm for sparse signal reconstruction
Applied Mathematics and Computation, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhongyi Liu, Zhihui Wei, Wenyu Sun
openaire +1 more source
Iterative algorithm for optimal fiducials under weak perspective projection
International Journal of Imaging Systems and Technology, 2009AbstractIn previous work, we designed space fiducials with the aim of making camera pose determination as noise‐insensitive as possible. These fiducials turned out to be sets of points that formed concentric regular polyhedra. Here, we apply an idea of Dementhon and Davis and test and analyze an iterative linear algorithm in conjunction with our ...
Alfred M. Bruckstein +2 more
openaire +1 more source
Performance evaluation of iterative tomography algorithms for incomplete projection data
Applied Optics, 2004Projection data obtained through optical techniques for tomographic measurements, such as interferometry for refractive-index-based measurements, are often incomplete. This is due to limitations in the optical system, data storage, and alignment and vignette issues.
Debasish, Mishra +3 more
openaire +2 more sources
Iterative Subgradient Projection Algorithm
2016In this chapter we study convergence of iterative subgradient projection algorithms for solving convex feasibility problems in a general Hilbert space. Our goal is to obtain an approximate solution of the problem in the presence of computational errors.
openaire +1 more source
Iterative projection algorithms in protein crystallography. I. Theory
Acta Crystallographica Section A Foundations of Crystallography, 2013A general class of iterative projection algorithms is described and proposed as a tool for phasing in protein crystallography in order to improve the radius of convergence over that of conventional density-modification algorithms. Their relationship to conventional density modification is described.
Rick P. Millane, Victor L. Lo
openaire +1 more source
A projection iterative algorithm for strong vector equilibrium problem
Optimization, 2014In this paper, iterative algorithm for strong vector equilibrium problem (SVEP) is studied. Firstly, an auxiliary problem for SVEP is introduced and the relationships between these two problems are discussed. Then, based on the auxiliary problem, a projection iterative algorithm for SVEP is proposed.
San-hua Wang, Qiu-ying Li
openaire +1 more source
Iterative projection algorithms for reconstructing compact binary images
SPIE Proceedings, 2008An algorithm is described for reconstructing compact binary images from limited Fourier amplitude data. This problem arises in macromolecular crystallography where one wishes to reconstruct the molecular envelope from crystal x-ray diffraction amplitudes using a solvent contrast series.
V. L. Lo, R. P. Millane
openaire +1 more source
Convergence of Picard’s iteration using projection algorithm for noncyclic contractions
Indagationes Mathematicae, 2019This paper deals with some of the conditions for the convergence of Picard's iteration for non-cyclic contractions using a projection algorithm in uniformly convex Banach spaces. The author also discusses the existence of common best proximity pairs for a couple of non-cyclical mappings. Some examples are given to illustrate the main conclusions.
openaire +2 more sources

