Optimization Online


Playing with Duality: An Overview of Recent Primal-Dual Approaches for Solving Large-Scale Optimization Problems

Nikos Komodakis (nikos.komodakis***at***enpc.fr)
Jean-Christophe Pesquet (jean-christophe.pesquet***at***univ-paris-est.fr)

Abstract: Optimization methods are at the core of many problems in signal/image processing, computer vision, and machine learning. For a long time, it has been recognized that looking at the dual of an optimization problem may drastically simplify its solution. Deriving efficient strategies which jointly brings into play the primal and the dual problems is however a more recent idea which has generated many important new contributions in the last years. These novel developments are grounded on recent advances in convex analysis, discrete optimization, parallel processing, and nonsmooth optimization with emphasis on sparsity issues. In this paper, we aim at presenting the principles of primal-dual approaches, while giving an overview of numerical methods which have been proposed in different contexts. We show the benefits which can be drawn from primal-dual algorithms both for solving large-scale convex optimization problems and discrete ones, and we provide various application examples to illustrate their usefulness.

Keywords: Convex optimization, discrete optimization, duality, linear programming, proximal methods, inverse problems, computer vision, machine learning, big data

Category 1: Applications -- Science and Engineering

Category 2: Convex and Nonsmooth Optimization (Convex Optimization )

Category 3: Integer Programming


Download: [PDF]

Entry Submitted: 06/20/2014
Entry Accepted: 06/20/2014
Entry Last Modified: 12/03/2014

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society