“ An act, process, or methodology of making something (such as a design, system, or decision) as fully perfect, functional, or effective as possible”

$$\begin{align*} \min \enspace&f(x)\\ \text{subject to: }&x \text{ is in } C\qquad \end{align*}$$

“ A convex function refers to a function whose graph is shaped like a cup.”

Lines between any two points are "inside" the cup.

Lines between any two points are "inside" the cup.

Hard optimization problem $$\Downarrow$$ Easier, bigger, convex problem

Can we solve symmetric convex problems faster?

- How to find symmetries?
- How to exploit symmetries?
- Which problems can we reduce?