Generalized Bregman projections in convex feasibility problems
From MaRDI portal
Publication:1384057
DOI10.1023/A:1022619318462zbMath0897.90156OpenAlexW1533930488MaRDI QIDQ1384057
Publication date: 13 April 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022619318462
nondifferentiable optimizationBregman functionsconvex feasibility problemssubgradient algorithmssuccessive projectionsB-functions
Related Items (5)
A non-interior continuation algorithm for solving the convex feasibility problem ⋮ Dykstras algorithm with bregman projections: A convergence proof ⋮ Iterative algorithm for solving a class of convex feasibility problem ⋮ Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods ⋮ Non-Convex feasibility problems and proximal point methods
Cites Work
- Unnamed Item
- Unnamed Item
- Relaxed outer projections, weighted averages and convex feasibility
- An iterative row-action method for interval convex programming
- Convergence of sequential and asynchronous nonlinear paracontractions
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
- Approximate iterations in Bregman-function-based proximal algorithms
- A multiprojection algorithm using Bregman projections in a product space
- Block-iterative surrogate projection methods for convex feasibility problems
- Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- On the Convergence of the Products of Firmly Nonexpansive Mappings
- Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
- Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
- Proximal Minimization Methods with Generalized Bregman Functions
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- On Projection Algorithms for Solving Convex Feasibility Problems
- Convex Analysis
This page was built for publication: Generalized Bregman projections in convex feasibility problems
