Numerical experiments with universal barrier functions for cones of Chebyshev systems

Abstract

Based on previous explicit computations of universal barrier functions, we describe numerical experiments for solving certain classes of convex optimization problems. The comparison is given of the performance of the classical affine-scaling algorithm with the similar algorithm built upon the universal barrier function. © 2007 Springer Science+Business Media, LLC.