projection-free algorithm

Optimal and Efficient Algorithms for Decentralized Online Convex Optimization JMLR 2025 Projection-Free Online Convex Optimization with Time-Varying Constraints ICML 2024 Unified Projection-Free Algorithms for Adversarial DR-Submodular Optimization ICLR 2024 Universal Online Convex Optimization with $1$ Projection per Round NeurIPS 2024 Improved Dynamic Regret for Online Frank-Wolfe COLT 2023 Projection-free Adaptive Regret with Membership Oracles ALT 2023 Projection-Free Online Convex Optimization via Efficient Newton Iterations NeurIPS 2023 Projection-free Online Exp-concave Optimization COLT 2023 A Projection-free Algorithm for Constrained Stochastic Multi-level Composition Optimization NeurIPS 2022 On Constraints in First-Order Optimization: A View from Non-Smooth Dynamical Systems JMLR 2022 Projection-free Distributed Online Learning with Sublinear Communication Complexity JMLR 2022 Projection-free Decentralized Online Learning for Submodular Maximization over Time-Varying Networks JMLR 2021 Efficient Projection-free Algorithms for Saddle Point Problems NeurIPS 2020 Improved Regret Bounds for Projection-free Bandit Convex Optimization AISTATS 2020 Projection-free Distributed Online Convex Optimization with O(√T) Communication Complexity ICML 2020