A relaxed version of Bregman's method for convex programming |
| |
| Authors: | A R De Pierro A N Iusem |
| |
| Institution: | (1) Instituto de Matemática, Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brazil;(2) Instituto de Matemática Pura e Aplicada, Rio de Janeiro, Brazil |
| |
| Abstract: | A new type of relaxation for Bregman's method, an iterative primal-dual algorithm for linearly constrained convex programming, is presented. It is shown that the new relaxation procedure generalizes the usual concept of relaxation and preserves the convergence properties of Bregman's algorithm for a suitable choice of the relaxation parameters. For convergence, Bregman's method requires that the objective function satisfy certain conditions. A sufficient and easily checkable condition for these requirements to hold is also given. |
| |
| Keywords: | Linearly constrained convex programming entropy optimization large and sparse matrices nonorthogonal projections |
| 本文献已被 SpringerLink 等数据库收录！ |
|
