Generalized Bregman Projections in Convex Feasibility Problems |
| |
Authors: | K C Kiwiel |
| |
Institution: | (1) Systems Research Institute, Warsaw, Poland |
| |
Abstract: | We present a method for finding common points of finitely many closed convex sets in Euclidean space. The Bregman extension of the classical method of cyclic orthogonal projections employs nonorthogonal projections induced by a convex Bregman function, whereas the Bauschke and Borwein method uses Bregman/Legendre functions. Our method works with generalized Bregman functions (B-functions) and inexact projections, which are easier to compute than the exact ones employed in other methods. We also discuss subgradient algorithms with Bregman projections. |
| |
Keywords: | Convex feasibility problems successive projections Bregman functions B-functions subgradient algorithms nondifferentiable optimization |
本文献已被 SpringerLink 等数据库收录! |