We study the convergence of a proximal-like minimization algorithm using Bregman functions. We extend the convergence results by Censor and Zenios (1992) and by Chen and Teboulle (1993) by showing ...
Projection algorithms are well known for their simplicity and flexibility in solving feasibility problems. They are particularly important in practice owing to minimal requirements for software ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback