On Convex Optimization and Quadratic Programming

Convex optimization and quadratic optimization are two important research areas that are involved in various applications and in different disciplines. This minisymposium presents recent advances on both topics:

The first two talks are concerned with solving specific convex problems, the other two talks are devoted to quadratic optimization problems.

Practical implementations are presented and computational evidence is given confirming the success of the proposed methods.