New posts in Global Optimization

Finding $n$ points $x_i$ in the plane, with $\sum_{i=1}^n \vert x_i \vert^2=1$, minimizing $\sum_{i\neq j}^n \frac{1}{\sqrt{\vert x_i-x_j \vert}}$

Prove that this expression is greater than 1/2

Is this lower bound for a norm of some complex matrices true?

A (reverse)-Minkowski type inequality for symmetric sums

How to fit the parameters of differential equations with known data?

Computational complexity of unconstrained convex optimisation

Robust black box function minimization with extremely expensive cost function

Is all non-convex optimization heuristic?

Software for rigorous optimization of real polynomials