Generalized Bregman projections in convex feasibility problems

作     者：Kiwiel, KC 

作者机构：Polish Acad Sci Syst Res Inst PL-01447 Warsaw Poland 

出 版 物：《JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS》 (优选法理论与应用杂志)

年 卷 期：1998年第96卷第1期

页      面：139-157页

核心收录：

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：Komitet Badań Naukowych, (8T11A02610) Komitet Badań Naukowych 

主　　题：convex feasibility problems successive projections Bregman functions B-functions subgradient algorithms nondifferentiable optimization 

摘      要：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 Borvein 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.