Image de couverture de livre

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Takahashi, Shota, Pokutta, Sebastian, Takeda, Akiko
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control 65K05, 90C06, 90C25, 90C26, 90C30
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Simplex Frank-Wolfe: Linear Convergence and Its Numerical Efficiency for Convex Optimization over Polytopes
par: Wang, Haoning, et autres
Publié: (2025)

Bregman Stochastic Proximal Point Algorithm with Variance Reduction
par: Traoré, Cheik, et autres
Publié: (2025)

Heavy-ball Differential Equation Achieves $O(\varepsilon^{-7/4})$ Convergence for Nonconvex Functions
par: Okamura, Kaito, et autres
Publié: (2024)

Splitting the Conditional Gradient Algorithm
par: Woodstock, Zev, et autres
Publié: (2023)

Boosted Stochastic Frank-Wolfe for Constrained Nonconvex Optimization
par: Nandhan, Navil, et autres
Publié: (2026)

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
par: Song, Yongcun, et autres
Publié: (2024)

Fast convergence of Frank-Wolfe algorithms on polytopes
par: Wirth, Elias, et autres
Publié: (2024)

Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization
par: Higuchi, Rei, et autres
Publié: (2024)

Approximate Bregman Proximal Gradient Algorithm for Relatively Smooth Nonconvex Optimization
par: Takahashi, Shota, et autres
Publié: (2023)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
par: Niu, Yi-Shuai, et autres
Publié: (2018)

Fast projection onto the top-k-sum constraint
par: Pan, Jianting, et autres
Publié: (2025)

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
par: Mannel, Florian
Publié: (2024)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
par: Deng, Kangkang, et autres
Publié: (2024)

A structured L-BFGS method and its application to inverse problems
par: Mannel, Florian, et autres
Publié: (2023)

A structured L-BFGS method with diagonal scaling and its application to image registration
par: Mannel, Florian, et autres
Publié: (2024)

Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
par: Marumo, Naoki, et autres
Publié: (2023)

Proximal Limited-Memory Quasi-Newton Methods for Nonsmooth Nonconvex Optimization
par: Dahl, Simeon vom, et autres
Publié: (2026)

Randomized block proximal method with locally Lipschitz continuous gradient
par: Pérez-Aros, Pedro, et autres
Publié: (2025)

Linesearch-free adaptive Bregman proximal gradient for convex minimization without relative smoothness
par: Ou, Hongjia, et autres
Publié: (2025)

On the convergence of proximal gradient methods for convex simple bilevel optimization
par: Latafat, Puya, et autres
Publié: (2023)

cuHALLaR: A GPU Accelerated Low-Rank Augmented Lagrangian Method for Large-Scale Semidefinite Programming
par: Aguirre, Jacob M., et autres
Publié: (2025)

A Frank-Wolfe-based primal heuristic for quadratic mixed-integer optimization
par: Mexi, Gioni, et autres
Publié: (2025)

A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions
par: Bao, Chenglong, et autres
Publié: (2025)

Adaptive proximal gradient methods are universal without approximation
par: Oikonomidis, Konstantinos A., et autres
Publié: (2024)

On a globally convergent semismooth* Newton method in nonsmooth nonconvex optimization
par: Gfrerer, H.
Publié: (2024)

General Optimal Step-size for ADMM-type Algorithms: Domain Parametrization and Optimal Rates
par: Ran, Yifan
Publié: (2023)

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
par: Latafat, Puya, et autres
Publié: (2023)

Line-search and Adaptive Step Sizes for Nonconvex-strongly-concave Minimax Optimization
par: Ma, Bohao, et autres
Publié: (2026)

Bilevel Learning via Inexact Stochastic Gradient Descent
par: Salehi, Mohammad Sadegh, et autres
Publié: (2025)

A Regression-Based Prediction-Correction Method for Stochastic Time-Varying Optimization Problems
par: Kamijima, Tomoya, et autres
Publié: (2025)

Stochastic Block Bregman Projection with Polyak-like Stepsize for Possibly Inconsistent Convex Feasibility Problems
par: Zhang, Lu, et autres
Publié: (2026)

Asymptotic Convergence and Stability of Adaptive Gradient Methods in Smooth Non-convex Optimization
par: Jin, Ruinan, et autres
Publié: (2026)

A Proximal Stochastic Gradient Method with Adaptive Step Size and Variance Reduction for Convex Composite Optimization
par: Fang, Changjie, et autres
Publié: (2025)

Flexible block-iterative analysis for the Frank-Wolfe algorithm
par: Braun, Gábor, et autres
Publié: (2024)

Stability and convergence analysis of AdaGrad for non-convex optimization via novel stopping time-based techniques
par: Jin, Ruinan, et autres
Publié: (2024)

The Global R-linear Convergence of Nesterov's Accelerated Gradient Method with Unknown Strongly Convex Parameter
par: Bao, Chenglong, et autres
Publié: (2023)

On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
par: Latafat, Puya, et autres
Publié: (2023)

Anderson Accelerated Primal-Dual Hybrid Gradient for solving LP
par: Zhou, Yingxin, et autres
Publié: (2025)

Safeguarding adaptive methods: global convergence of Barzilai-Borwein and other stepsize choices
par: Ou, Hongjia, et autres
Publié: (2024)

A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach
par: Monteiro, Renato D. C., et autres
Publié: (2024)