Saturday 4:00 PM–4:30 PM in C11

Convex.jl: A native Julia package for real or complex domain Convex Optimization

Ayush Pandey

Audience level:


In this talk, I will demonstrate how to use Convex.jl to solve the Logistic Regression, power grid optimization, and quantum information theory problems within few lines of Julia code and benchmark it against the competing open-source tools.


Convex optimization problems require rigorous mathematical understanding to solve them. Convex.jl allows users to solve complex optimization problems easily by providing a simple intuitive user interface to express the objective function and constraints. As it became popular, we saw increased demand to support optimization over complex numbers, from users working in diverse scientific fields including power grid optimization, quantum information theory, wireless communication, and signal processing. Previously, these users relied on various tools such as MATLAB’s cvx and open-source python package PICOS to tackle different problems depending upon their domain of work. Convex’s new support for complex numbers allows users to approach each of these problems in Julia. In this talk, I will show how to the new functionality in Convex.jl provides a single integrated solution for many types of Disciplined Convex Programming Problems and show how to solve real and complex valued problems using Convex.jl in very few lines of code, taking examples from scientific domains mentioned above. I will also present benchmarks comparing Convex.jl with competing open-source tools.

Subscribe to Receive PyData Updates


Get Now