# An Away-Step Frank-Wolfe Method for Minimizing Logarithmically-Homogeneous Barriers

arXiv: https://arxiv.org/abs/2305.17808 · HTML: https://mlsanity.com/paper/2305.17808/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 28 May 2023.

## Built on by (most cited first, 2 of 2)

- [NewVEM: A Newton Vertex Exchange Method for a Class of Constrained Self-Concordant Minimization Problems](https://mlsanity.com/paper/2407.03294/) (2024)
- [Beyond Averaging in John Ellipsoid Approximation: High-Accuracy Algorithms in the Leverage-Score Model](https://mlsanity.com/paper/2606.20082/) (2026)

## Abstract (arXiv)

We present and analyze an away-step Frank-Wolfe method for the convex optimization problem minx∈X ; f(mathsfA x) + langlec,xrangle, where f is a θ-logarithmically-homogeneous self-concordant barrier, mathsfA is a linear operator that may be non-invertible, langlec,·rangle is a linear function and X is a nonempty polytope. The applications of primary interest include D-optimal design, inference of multivariate Hawkes processes, and TV-regularized Poisson image de-blurring. We establish affine-invariant and norm-independent global linear convergence rates of our method, in terms of both the objective gap and the Frank-Wolfe gap. When specialized to the D-optimal design problem, our results settle a question left open since Ahipasaoglu, Sun and Todd (2008). We also show that the iterates generated by our method will land on and remain in a face of X within a bounded number of iterations, which can lead to improved local linear convergence rates (for both the objective gap and the Frank-Wolfe gap). We conduct numerical experiments on D-optimal design and inference of multivariate Hawkes processes, and our results not only demonstrate the efficiency and effectiveness of our method compared to other principled first-order methods, but also corroborate our theoretical results quite well.