Scholarlink

Abstract <p>This paper proposes a new variant of the adaptive Frank–Wolfe algorithm for relatively smooth convex minimization problems. It suggests using a divergence different from half of the squared Euclidean norm in the step size adjustment formula. Convergence rate estimates for this algorithm are proven for minimization problems involving relatively smooth convex functions with the triangle scaling property. We also conducted computational experiments for the Poisson linear inverse problem and SVM models. The paper also identifies the conditions under which the proposed algorithm shows a clear advantage over the adaptive proximal gradient Bregman method and its accelerated variants.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

An Adaptive Variant of The Frank–Wolfe Method for Relative Smooth Convex Optimization Problems

  • 期刊论文

  • 发表日期：

    2025年3月1日

查看全文
  • A. A. Vyguzov,
  • F. S. Stonyakin

摘要

Abstract

This paper proposes a new variant of the adaptive Frank–Wolfe algorithm for relatively smooth convex minimization problems. It suggests using a divergence different from half of the squared Euclidean norm in the step size adjustment formula. Convergence rate estimates for this algorithm are proven for minimization problems involving relatively smooth convex functions with the triangle scaling property. We also conducted computational experiments for the Poisson linear inverse problem and SVM models. The paper also identifies the conditions under which the proposed algorithm shows a clear advantage over the adaptive proximal gradient Bregman method and its accelerated variants.