Duality for Bregman projections onto translated cones and affine subspaces.

DOI10.1016/S0021-9045(02)00040-0zbMath1052.90054MaRDI QIDQ1874472

Heinz H. Bauschke

Publication date: 25 May 2003

Published in: Journal of Approximation Theory (Search for Journal in Brave)

zbMATH Keywords

Bregman projectionBregman distanceLegendre functionConvex dualityConvex coneAffine subspaceOrthogonal complement

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items (1)

Cone characterizations of approximate solutions in real vector optimization

Cites Work

• An iterative row-action method for interval convex programming
• Totally convex functions for fixed points computation and infinite dimensional optimization
• Convex analysis and nonlinear optimization. Theory and examples
• Best approximation in inner product spaces
• Logistic regression, AdaBoost and Bregman distances
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Duality for Bregman projections onto translated cones and affine subspaces.