FrontierMath is a benchmark of hundreds of unpublished and extremely challenging math problems to help us to understand the limits of artificial intelligence.

We show that $$\mathbb {R}^3$$ R 3 can be packed at a density of $$0.222\ldots $$ 0.222 … with tori whose minor radius goes to zero. Furthermore, we show that the same torus arrangement yields an asym...

Smoothed analysis is a method for analyzing the performance of algorithms, used especially for those algorithms whose running time in practice is significantly better than what can be proven through w...

The MOSEK ApS official blog: announcements, new releases, activities, optimization modeling hints and examples.

Let $\mathcal{P}$ be the following primal optimization problem \begin{align} \mathcal{P}: \text{minimize}_x \quad & f_0(x)\\ \text{subject to} \quad & f_i(x) \leq 0, \quad i = 1, ..., m \\ ...