A multiprojection algorithm using Bregman projections in a product space
From MaRDI portal
Publication:1344108
DOI10.1007/BF02142692zbMath0828.65065MaRDI QIDQ1344108
Publication date: 10 January 1996
Published in: Numerical Algorithms (Search for Journal in Brave)
convergence; image recovery; signal detection; convex feasibility problem; linearly constrained optimization; Bregman functions; block-iterative schemes; multiprojection algorithm; Pierra's product space
Related Items
Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization, Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings, On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space, Generalized Bregman projections in convex feasibility problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for maximum entropy image reconstruction from noisy data
- Multiplicative iterative algorithms for convex programming
- Block-iterative methods for consistent and inconsistent linear equations
- A relaxed version of Bregman's method for convex programming
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- An iterative row-action method for interval convex programming
- On some methods for entropy maximization and matrix scaling
- Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
- On the convergence of Han's method for convex programming with quadratic objective
- Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems
- A successive projection method
- Proximal minimization algorithm with \(D\)-functions
- General entropy criteria for inverse problems, with applications to data compression, pattern classification, and cluster analysis
- On the behavior of a block-iterative projection method for solving convex feasibility problems
- Decomposition through formalization in a product space
- On Block-Iterative Entropy Maximization
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- On Projection Algorithms for Solving Convex Feasibility Problems
- Convex Analysis
- The method of projections for finding the common point of convex sets
- Generalized Iterative Scaling for Log-Linear Models
