Convex Optimization in Computer Graphics
Loading...
Date
2026
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association
Abstract
A number of tasks in computer graphics can be conceived as critical point conditions for an optimization problem. These optimization problems, however, often involve nonlinear or nonconvex formulations that cannot be solved easily with standard tools. In this course, we will go over how convex relaxation techniques can make solving these optimization problems more efficient. In particular, we will explore how convex optimization is used to solve for shape matching, contour models, geodesic distances, PDEs, and optimal transport tasks in computer graphics. We will also cover modern convex optimization software tools. The goal of the course is to equip students with a beginner’s toolkit to apply convex optimization strategies to problems that they might encounter in their own research. All course materials will be available at https://convex-optimization-graphics.github.io/.
Description
@inproceedings{10.2312:egt.20261005,
booktitle = {Eurographics 2026 - Tutorials},
editor = {},
title = {{Convex Optimization in Computer Graphics}},
author = {Mattos Da Silva, Leticia},
year = {2026},
publisher = {The Eurographics Association},
ISSN = {1017-4656},
ISBN = {978-3-03868-267-7},
DOI = {10.2312/egt.20261005}
}