skip to content
Duality and auxiliary functions for Bregman distances Preview this item
ClosePreview this item
Checking...

Duality and auxiliary functions for Bregman distances

Author: Stephen Della Pietra; Vincent Della Pietra; John D Lafferty
Publisher: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [2001]
Series: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-01-109.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
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."
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Stephen Della Pietra; Vincent Della Pietra; John D Lafferty
OCLC Number: 48562779
Notes: "October 8, 2001."
Description: 13 p. ; 28 cm.
Series Title: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-01-109.
Responsibility: Stephen Della Pietra, Vincent Della Pietra, and John Lafferty.

Abstract:

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."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/48562779>
library:oclcnum"48562779"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/48562779>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:creator
schema:datePublished"2001"
schema:description"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.""
schema:exampleOfWork<http://worldcat.org/entity/work/id/1909897737>
schema:inLanguage"en"
schema:name"Duality and auxiliary functions for Bregman distances"
schema:numberOfPages"13"
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.