Adaptive Variants of Frank-Wolfe Method with Relative Inexact Gradient Information
摘要
The article introduces the adaptive versions of the Erroneous Conditional Gradient (ECG) algorithm with an Erroneous Oracle (EO) and a Linear Minimization Oracle (LMO) on a box-constrained feasible set. Two step-size strategies are studied: the first one displaying a dependency on the iteration, while the second one depends on the L-smoothness constant. This paper highlights the results of the implementation of these algorithms tested through computational experiments. PageRank is chosen for the algorithms to be applied to the optimization problem since the complexity of the former remains relevant even nowadays. The quality of the solution aligns with the theoretical expectations. Further research and practical implications of these algorithms are discussed in the conclusion.