Flexible block-iterative analysis for the Frank-Wolfe algorithm

DOI10.1007/S10957-026-03068-1MaRDI QIDQ7316307zbMATH OpenFDO

Authors Gábor Braun, Jannis Halbey, Sebastian Pokutta, Zev C. Woodstock

Publication date 19 August 2026

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10957-026-03068-1

Mathematics Subject Classification ID

Decomposition methods (49M27) Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cites work

• A variational inequality model for the construction of signals from inconsistent nonlinear equations
• Affine reductions for LPs and SDPs
• Complexity of linear minimization and projection on some sets
• Conditional gradient methods. From core principles to AI applications
• Convergence of a block coordinate descent method for nondifferentiable minimization
• Convex analysis and monotone operator theory in Hilbert spaces
• Decomposition methods for differentiable optimization problems over Cartesian product sets
• FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank–Wolfe Algorithms and Conditional Gradients
• scientific article; zbMATH DE number 781821 (Why is no real title available?)
• scientific article; zbMATH DE number 3281235 (Why is no real title available?)
• scientific article; zbMATH DE number 3345848 (Why is no real title available?)
• On the convergence of block coordinate descent type methods
• Projection free methods on product domains
• Scalable Frank-Wolfe on generalized self-concordant functions via simple steps
• Smooth strongly convex interpolation and exact worst-case performance of first-order methods
• Splitting the conditional gradient algorithm
• Strong convergence of projection-like methods in Hilbert spaces
• The cyclic block conditional gradient method for convex optimization problems
• The Frank-Wolfe algorithm: a short introduction
• The matching polytope does not admit fully-polynomial size relaxation schemes
• The matching polytope has exponential extension complexity

This page was built for publication: Flexible block-iterative analysis for the Frank-Wolfe algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7316307)