Geometric optimisation and approximation algorithms form a vibrant research area that intersects computational geometry, combinatorial optimisation and algorithm design.

A new outer approximation algorithm is proposed for solving general convex programs. A remarkable advantage of the algorithm over existing outer approximation methods is that the approximation of the ...

This paper presents a generalization of the Remez multiple-exchange (ME) algorithm for solving complex Chebyshev approximation by polynomials on the unit circle. The difficulties of implementing the ...