Cover Image

Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Grimmer, Benjamin, Liu, Ning
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Gauges and Accelerated Optimization over Smooth and/or Strongly Convex Sets
by: Liu, Ning, et al.
Published: (2023)

Some Primal-Dual Theory for Subgradient Methods for Strongly Convex Optimization
by: Grimmer, Benjamin, et al.
Published: (2023)

Subgame Perfect Methods in Nonsmooth Convex Optimization
by: Grimmer, Benjamin, et al.
Published: (2025)

Lower Complexity Bounds for Nonconvex-Strongly-Convex Bilevel Optimization with First-Order Oracles
by: Ji, Kaiyi
Published: (2025)

Lower Bounds for Frank-Wolfe on Strongly Convex Sets
by: Halbey, Jannis, et al.
Published: (2026)

Performance Estimation for Smooth and Strongly Convex Sets
by: Luner, Alan, et al.
Published: (2024)

Tight Lower Bounds for the Bit and Inner Product Oracle for Constrained Convex Optimization
by: Basu, Amitabh, et al.
Published: (2025)

A Universally Optimal Primal-Dual Method for Minimizing Heterogeneous Compositions
by: Zoll, Aaron, et al.
Published: (2025)

Some Unified Theory for Variance Reduced Prox-Linear Methods
by: Wu, Yue, et al.
Published: (2024)

The Optimal Smoothings of Sublinear Functions and Convex Cones
by: Samakhoana, Thabo, et al.
Published: (2025)

Inexactly Smooth Performance Estimation and New Optimized Gradient Methods
by: Zoll, Aaron, et al.
Published: (2026)

Scalable Projection-Free Optimization Methods via MultiRadial Duality Theory
by: Samakhoana, Thabo, et al.
Published: (2024)

First-Order Methods for Nonsmooth Nonconvex Functional Constrained Optimization with or without Slater Points
by: Jia, Zhichao, et al.
Published: (2022)

A Practical Adaptive Subgame Perfect Gradient Method
by: Luner, Alan, et al.
Published: (2025)

Goldstein Stationarity in Lipschitz Constrained Optimization
by: Grimmer, Benjamin, et al.
Published: (2023)

Random-Subspace Frank--Wolfe over Strongly Convex Sets
by: Poirion, Pierre-Louis, et al.
Published: (2026)

Robustness of the Frank-Wolfe Method under Inexact Oracles and the Cost of Linear Minimization
by: Hu, Tao
Published: (2025)

Weak Proximal Newton Oracles for Composite Convex Optimization
by: Garber, Dan
Published: (2025)

Strong Convexity of Sets in Riemannian Manifolds
by: Scieur, Damien, et al.
Published: (2023)

Optimal Acceleration for Proximal Minimization of the Sum of Convex and Strongly Convex Functions
by: Chari, Govind M., et al.
Published: (2026)

A Unified and Scalable Method for Optimization over Graphs of Convex Sets
by: Marcucci, Tobia
Published: (2025)

A Proximal Descent Method for Minimizing Weakly Convex Optimization
by: Liao, Feng-Yi, et al.
Published: (2025)

Projection-free Online Learning over Strongly Convex Sets
by: Wan, Yuanyu, et al.
Published: (2020)

Convex Synthesis of First-Order Methods for Time-Varying Smooth Strongly Convex Optimization
by: Van Scoy, Bryan, et al.
Published: (2026)

Lower Bounds and Proximally Anchored SGD for Non-Convex Minimization Under Unbounded Variance
by: Fazla, Arda, et al.
Published: (2026)

Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks
by: Kovalev, Dmitry, et al.
Published: (2024)

Beyond Minimax Optimality: A Subgame Perfect Gradient Method
by: Grimmer, Benjamin, et al.
Published: (2024)

Composing Optimized Stepsize Schedules for Gradient Descent
by: Grimmer, Benjamin, et al.
Published: (2024)

Online Convex Optimization with a Separation Oracle
by: Mhammedi, Zakaria
Published: (2024)

Bayesian Optimization with Lower Confidence Bounds for Minimization Problems with Known Outer Structure
by: Baumgärtner, Katrin, et al.
Published: (2025)

On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms
by: Kovalev, Dmitry, et al.
Published: (2024)

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/ε)$ Overhead
by: Wu, Yue, et al.
Published: (2026)

The Method of Ellipcenters for Strongly Convex Functions
by: Bello-Cruz, Yunier
Published: (2026)

A Randomized Linearly Convergent Frank-Wolfe-type Method for Smooth Convex Minimization over the Spectrahedron
by: Garber, Dan
Published: (2025)

Nonasymptotic Analysis of Accelerated Methods With Inexact Oracle Under Absolute Error Bound
by: Liu, Yin, et al.
Published: (2024)

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions
by: Van Scoy, Bryan, et al.
Published: (2025)

Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization
by: Jiang, Ruichen, et al.
Published: (2024)

On the Set of Possible Minimizers of a Sum of Convex Functions
by: Zamani, Moslem, et al.
Published: (2024)

Local LMO: Constrained Gradient Optimization via a Local Linear Minimization Oracle
by: Richtárik, Peter, et al.
Published: (2026)

An Adaptive Parameter-free and Projection-free Restarting Level Set Method for Constrained Convex Optimization Under the Error Bound Condition
by: Lin, Qihang, et al.
Published: (2020)