Active Set Complexity of the Away-Step Frank--Wolfe Algorithm
نویسندگان
چکیده
منابع مشابه
New Active-Set Frank-Wolfe Variants for Minimization over the Simplex and the L1- Ball
In this paper, we are concerned with minimization problems over the unit simplex. Here, we propose the use of an active-set estimate that enables us to define an algorithmic framework where the variables estimated active and those estimated non-active are updated separately at each iteration. In particular, we consider different variants of the Frank-Wolfe direction to be combined with the prop...
متن کاملNew Active-set Frank-wolfe Variants for Minimization over the Simplex and the `1-ball
In this paper, we describe a new active-set algorithmic framework for minimizing a function over the simplex. The method is quite general and encompasses different active-set Frank-Wolfe variants. In particular, we analyze convergence (when using Armijo line search in the calculation of the stepsize) for the active-set versions of standard Frank-Wolfe, away-step Frank-Wolfe and pairwise Frank-W...
متن کاملk-Means Clustering via the Frank-Wolfe Algorithm
We show that k-means clustering is a matrix factorization problem. Seen from this point of view, k-means clustering can be computed using alternating least squares techniques and we show how the constrained optimization steps involved in this procedure can be solved efficiently using the Frank-Wolfe algorithm.
متن کاملCorrecting Covariate Shift with the Frank-Wolfe Algorithm
Covariate shift is a fundamental problem for learning in non-stationary environments where the conditional distribution ppy|xq is the same between training and test data while their marginal distributions ptrpxq and ptepxq are different. Although many covariate shift correction techniques remain effective for real world problems, most do not scale well in practice. In this paper, using inspirat...
متن کاملOn the von Neumann and Frank-Wolfe Algorithms with Away Steps
The von Neumann algorithm is a simple coordinate-descent algorithm to determine whether the origin belongs to a polytope generated by a finite set of points. When the origin is in the interior of the polytope, the algorithm generates a sequence of points in the polytope that converges linearly to zero. The algorithm’s rate of convergence depends on the radius of the largest ball around the orig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2020
ISSN: 1052-6234,1095-7189
DOI: 10.1137/19m1309419