Homotopy methods for convex optimization
- đ¤ Speaker: Andreas Klingler (Innsbruck)
- đ Date & Time: Wednesday 07 February 2024, 14:30 - 15:30
- đ Venue: Centre for Mathematical Sciences MR11, CMS
Abstract
Convex optimization concerns the problem of finding the maximum of a linear function over a convex set. This class covers many optimization problems in quantum information, portfolio optimization, and machine learning.
In this talk, we will introduce a new approach to solving convex optimization problems via a homotopic approach. In this approach, we deform an optimization problem with a trivial solution into the target problem and keep track of the solutions along the homotopy. This is motivated by the field of numerical algebraic geometry, which solves systems of polynomial equations using a similar idea.
We show that our method applies to certain convex optimization problems, including Semidefinite Programs, Hyperbolic Programs, and convex optimization problems with a single convexity constraint. Moreover, we present several benchmark problems in which this method outperforms known methods.
Series This talk is part of the CCIMI Seminars series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- Cambridge Centre for Data-Driven Discovery (C2D3)
- Cambridge talks
- CCIMI
- CCIMI Seminars
- Centre for Mathematical Sciences MR11, CMS
- Centre for Mathematical Sciences MR11, CMS
- Chris Davis' list
- CMS Events
- custom
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- Guy Emerson's list
- Hanchen DaDaDash
- Interested Talks
- ndk22's list
- ob366-ai4er
- rp587
- School of Physical Sciences
- Statistical Laboratory info aggregator
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Andreas Klingler (Innsbruck)
Wednesday 07 February 2024, 14:30-15:30