Linked Data Explorer
Duality and auxiliary functions for Bregman distances
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."
- "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.""@en
- "Duality and auxiliary functions for Bregman distances"@en