IPAM Institute for Pure and Applied Mathematics UCLA NSF
Skip Navigation Links
Main Page
Program Poster PDF
Lodging & Air Travel
Schedule and Presentations

Convex Relaxation Methods for Geometric Problems in Scientific Computing

February 11 - 15, 2013


Organizing Committee | Scientific Overview | Speaker List

Application/Registration | Contact Us

Organizing Committee

Xavier Bresson (City University of Hong Kong)
Antonin Chambolle (École Polytechnique)
Tony Chan (Hong Kong University of Science and Technology)
Daniel Cremers (Technische Universtitat München)
Stanley Osher (University of California, Los Angeles (UCLA))
Thomas Pock (Technische Universität Graz, Institute for Computer Graphics and Vision)
Gabriele Steidl (Universität Kaiserslautern)

Back to Top

Scientific Overview

Convex relaxation methods are studied and applied within a variety of disciplines in computer science and mathematics. They aim at providing exact or tight approximations of solutions of difficult problems. In the last few years, they have played a major role in designing efficient algorithms for compressed sensing and level set method. In addition to the substantial impact of convex relaxation methods in applied areas, they also are connected to various branches of mathematical sciences including optimization, functional analysis, geometry, graph theory and combinatorics.

The goal of this workshop is to bring together an interdisciplinary community from mathematics, computer vision, engineering and machine learning to discuss the latest progress and highlight various mathematical questions and algorithmic challenges.

The workshop will discuss the following topics:

  1. connections between convex relaxation methods and nonsmooth/nonlinear optimization algorithms based on L^1 and total variation
  2. relationships between graph theory, combinatorial and continuous optimizations via convex relaxation techniques
  3. relaxation methods to spectral and inference data models in machine learning
  4. opportunities of convex relaxation techniques for novel applications in signal processing, image processing, machine learning, computer vision, and graph theory

This workshop will include a poster session; a request for posters will be sent to registered participants in advance of the workshop.

Back to Top

Confirmed Speakers

Francis Bach (Institut National de Recherche en Informatique Automatique (INRIA))
Amir Beck (Technion - Israel Institute of Technology)
Yuri Boykov (University of Western Ontario)
Xavier Bresson (City University of Hong Kong)
Antonin Chambolle (École Polytechnique)
Daniel Cremers (Technische Universtitat München)
Selim Esedoglu (University of Michigan)
Tom Goldstein (Rice University)
Matthias Hein (Saarland University)
Jan Lellmann (University of Cambridge)
Mila Nikolova (École Normale Supérieure de Cachan)
Stanley Osher (University of California, Los Angeles (UCLA))
Gabriel Peyre (Université de Paris IX (Paris-Dauphine))
Thomas Pock (Technische Universität Graz)
Massimiliano Pontil (University College London)
Christoph Schnörr (University of Heidelberg)
Simon Setzer (Saarland University)
Gabriele Steidl (Universität Kaiserslautern)
Xue-Cheng Tai (University of Bergen)
Luminita Vese (University of California, Los Angeles (UCLA))
Wotao Yin (Rice University)

Back to Top

Back to Top

Contact Us:

Institute for Pure and Applied Mathematics (IPAM)
Attn: CRM2013
460 Portola Plaza
Los Angeles CA 90095-7121
Phone: 310 825-4755
Fax: 310 825-4756
Email:
Website: http://www.ipam.ucla.edu/programs/crm2013/

Back to Top

NSF Math Institutes   |   Webmaster