1 / 1

Primal-Dual Iterations for Variational Problems

Primal-Dual Iterations for Variational Problems. Convex Saddle-Point formulation is powerful Nonsmooth variational problems Relaxed combinatorial problems DMDR Optimization 10 times faster Numerically robust.

reba
Download Presentation

Primal-Dual Iterations for Variational Problems

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Primal-Dual Iterations for Variational Problems • Convex Saddle-Point formulation is powerful • Nonsmooth variational problems • Relaxed combinatorial problems • DMDR Optimization • 10 times faster • Numerically robust J. Lellmann, D. Breitenreicher, C. Schnörr Image and Pattern Analysis & HCI, University of Heidelberg

More Related