Analysis of the Frank-Wolfe Method for Convex Composite Optimization involving a Logarithmically-Homogeneous Barrier

We present and analyze a new generalized Frank-Wolfe method for the composite optimization problem (P):minx∈ℝn; f(mathsfA x) + h(x), where f is a θ-logarithmically-homogeneous self-concordant barrier, mathsfA is a linear operator and the function h has bounded domain but is possibly non-smooth. We show that our generalized Frank-Wolfe method requires O((δ0 + θ + Rh)ln(δ0) + (θ + Rh)2/varepsilon) iterations to produce an varepsilon-approximate solution, where δ0 denotes the initial optimality gap and Rh is the variation of h on its domain. This result establishes certain intrinsic connections between θ-logarithmically homogeneous barriers and the Frank-Wolfe method. When specialized to the D-optimal design problem, we essentially recover the complexity obtained by Khachiyan using the Frank-Wolfe method with exact line-search. We also study the (Fenchel) dual problem of (P), and we show that our new method is equivalent to an adaptive-step-size mirror descent method applied to the dual problem. This enables us to provide iteration complexity bounds for the mirror descent method despite even though the dual objective function is non-Lipschitz and has unbounded domain. In addition, we present computational experiments that point to the potential usefulness of our generalized Frank-Wolfe method on Poisson image de-blurring problems with TV regularization, and on simulated PET problem instances.