Pages that link to "Item:Q1384057"
From MaRDI portal
The following pages link to Generalized Bregman projections in convex feasibility problems (Q1384057):
Displaying 13 items.
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods (Q494329) (← links)
- Relaxed outer projections, weighted averages and convex feasibility (Q751771) (← links)
- A multiprojection algorithm using Bregman projections in a product space (Q1344108) (← links)
- Iterative averaging of entropic projections for solving stochastic convex feasibility problems (Q1360219) (← links)
- Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces (Q1364216) (← links)
- A non-interior continuation algorithm for solving the convex feasibility problem (Q1634140) (← links)
- Iterative algorithm for solving a class of convex feasibility problem (Q1736385) (← links)
- Duality for Bregman projections onto translated cones and affine subspaces. (Q1874472) (← links)
- Steered sequential projections for the inconsistent convex feasibility problem (Q1888607) (← links)
- Dykstras algorithm with bregman projections: A convergence proof (Q2709445) (← links)
- Non-Convex feasibility problems and proximal point methods (Q4673320) (← links)
- Bregman functions and auxiliary problem principle (Q5459819) (← links)
- Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization (Q5959328) (← links)
