ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Speeding up the Frank-Wolfe method using the Orthogonal Jacobi polynomials

Francis, R and Chepuri, SP (2022) Speeding up the Frank-Wolfe method using the Orthogonal Jacobi polynomials. In: 56th Asilomar Conference on Signals, Systems and Computers, ACSSC 2022, 31 October - 2 November 2022, Virtual, Online, pp. 1081-1085.

[img] PDF
acssc_ 2022.pdf - Published Version
Restricted to Registered users only

Download (401kB) | Request a copy
Official URL: https://doi.org/10.1109/IEEECONF56349.2022.1005191...

Abstract

The Frank Wolfe algorithm (FW) is a popular projection-free alternative for solving large-scale constrained optimization problems. However, the FW algorithm suffers from a sublinear convergence rate when minimizing a smooth convex function over a compact convex set. Thus, exploring techniques that yield a faster convergence rate becomes crucial. A classic approach to obtain faster rates is to combine previous iterates to obtain the next iterate. In this work, we extend this approach to the FW setting and show that the optimal way to combine the past iterates is using a set of orthogonal Jacobi polynomials. We also propose a polynomial-based acceleration technique, referred to as Jacobi polynomial accelerated FW, which combines the current iterate with the past iterate using combing weights related to the Jacobi recursion. By carefully choosing parameters of the Jacobi polynomials, we obtain a faster sublinear convergence rate. We provide numerical experiments on real datasets to demonstrate the efficacy of the proposed algorithm.

Item Type: Conference Paper
Publication: Conference Record - Asilomar Conference on Signals, Systems and Computers
Publisher: IEEE Computer Society
Additional Information: The copyright for this article belongs to IEEE Computer Society.
Keywords: Iterative methods; Orthogonal functions; Polynomials; Set theory, Acceleration method; Constrained optimi-zation problems; Convergence rates; Convex functions; Convex set; Frank-wolfe algorithms; Frank-wolfe methods; Jacobi polynomials; Large scale constrained optimization; Sublinear, Constrained optimization
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 24 Apr 2023 10:29
Last Modified: 24 Apr 2023 10:29
URI: https://eprints.iisc.ac.in/id/eprint/81286

Actions (login required)

View Item View Item