Duality for Bregman projections onto translated cones and affine subspaces. (Q1874472)

The author proves differently the dual characterization of Bregman projection onto linear constraints presented by \textit{S. Della Peitra}, \textit{V. Della Pietra} and \textit{J. Lafferty} [Duality and auxiliary functions for Bregman distances, Technical Report CMU-CS-01-109, School of Computer Science, Carnegie Mellon University (2002)] using the framework of convex analysis. Assuming a standard constraint qualification, the given proof is much shorter and cleaner and reveals the strange nonconvex component as a reformulation of a convex optimization problem.