Duality and Auxiliary Functions for Bregman Distances (2002)
Cached
Download Links
by
Vincent Della Pietra
,
Vincent Della Pietra
,
John Lafferty
| Venue: | School of Computer Science, Carnegie Mellon University |
| Citations: | 23 - 2 self |
BibTeX
@TECHREPORT{Pietra02dualityand,
author = {Vincent Della Pietra and Vincent Della Pietra and John Lafferty},
title = {Duality and Auxiliary Functions for Bregman Distances},
institution = {School of Computer Science, Carnegie Mellon University},
year = {2002}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We formulate and prove a convex duality theorem for Bregman distances and present a technique based on auxiliary functions for deriving and proving convergence of iterative algorithms to minimize Bregman distance subject to linear constraints.
Citations
| 464 | Inducing Features of Random Fields - Pietra, Pietra, et al. - 1997 |
| 183 | Parallel Optimization Theory, Algorithm, and Applications - Censor, Zenios - 1997 |
| 36 | Legendre functions and the method of random Bregman projections - Bauschke, Borwein - 1997 |
| 22 | Inducing features of random - Pietra, S, et al. - 1997 |
