The condition of a function relative to a polytope

Abstract

The condition number of a smooth convex function, namely the ratio of its smoothness to strong convexity constants, is closely tied to fundamental properties of the function. In particular, the condition number of a quadratic convex function is precisely the square of the diameter-to-width ratio of a canonical ellipsoid associated to the function. Furthermore, the condition number of a function bounds the linear rate of convergence of the gradient descent algorithm for unconstrained minimization. We propose a condition number of a smooth convex function relative to a reference polytope. This relative condition number is defined as the ratio of a relative smooth constant to a relative strong convexity constant of the function, where both constants are relative to the reference polytope. The relative condition number extends the main properties of the traditional condition number. In particular, we show that the condition number of a quadratic convex function relative to a polytope is precisely the square of the diameter-to-facial-distance ratio of a scaled polytope for a canonical scaling induced by the function. Furthermore, we illustrate how the relative condition number of a function bounds the linear rate of convergence of first-order methods for minimization of the function over the polytope.

18 pages

References in corpus (1)

• A single potential governing convergence of conjugate gradient, accelerated gradient and geometric descent

Cited by in corpus (5)

• Blended Conditional Gradients: the unconditioning of conditional gradients
• Projection-Free Optimization on Uniformly Convex Sets
• An algorithm to compute the Hoffman constant of a system of linear constraints
• Parameter-free Locally Accelerated Conditional Gradients
• Frank-Wolfe Methods with an Unbounded Feasible Region and Applications to Structured Learning