Convex optimisation constitutes a fundamental area in applied mathematics where the objective is to identify the minimum of a convex function subject to a set of convex constraints. This framework ...

SIAM Journal on Numerical Analysis, Vol. 53, No. 1 (2015), pp. 421-444 (24 pages) We propose a preconditioned version of the Douglas–Rachford splitting method for solving convex-concave saddle-point ...

This paper deals with the packing problem of circles and non-convex polygons, which can be both translated and rotated into a strip with prohibited regions. Using the Ф-function technique, a ...

The field of global optimisation of dynamic systems and differential equations focuses on developing robust mathematical and computational methods to determine best‐case solutions in environments ...