Image de couverture de livre

A New Complexity Result for Strongly Convex Optimization with Locally $α$-H{ö}lder Continuous Gradients

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chen, Xiaojun, Kelley, C. T., Wang, Lei
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Complexity of Projected Gradient Methods for Strongly Convex Optimization with Hölder Continuous Gradient Terms
par: Chen, Xiaojun, et autres
Publié: (2026)

Generalized conditional gradient methods for multiobjective composite optimization problems with H{ö}lder condition
par: Chen, Wang, et autres
Publié: (2024)

An Adaptive Smoothing Algorithm for Non-Lipschitz Optimization on Manifolds with Complexity Guarantees
par: Wang, Lei, et autres
Publié: (2026)

Faster Newton Methods for Convex and Nonconvex Optimization in Gradient Complexity
par: Chen, Lesi, et autres
Publié: (2025)

HNAG$^{++}$: An Accelerated Gradient Method with a Refined Asymptotic Rate for Strongly Convex Optimization
par: Chen, Long, et autres
Publié: (2025)

Restart-Free (Accelerated) Gradient Sliding Methods for Strongly Convex Composite Optimization
par: Wu, Xinming, et autres
Publié: (2026)

Exponential Stability of Primal-Dual Gradient Dynamics with Non-Strong Convexity
par: Chen, Xin, et autres
Publié: (2019)

Revisiting Stochastic Gradient Descent for Strongly Convex Objectives: Tight Uniform-in-Time Bounds
par: Chen, Kang, et autres
Publié: (2025)

The Sample Complexity of Gradient Descent in Stochastic Convex Optimization
par: Livni, Roi
Publié: (2024)

A New Inexact Gradient Descent Method with Applications to Nonsmooth Convex Optimization
par: Khanh, Pham Duy, et autres
Publié: (2023)

Adaptive Accelerated Gradient Descent Methods for Convex Optimization
par: Xu, Zeyi, et autres
Publié: (2026)

Adaptive Accelerated Gradient Method for Smooth Convex Optimization
par: Wang, Zepeng, et autres
Publié: (2025)

Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization
par: Zhang, Liang, et autres
Publié: (2023)

On Distributionally Robust Multistage Convex Optimization: New Algorithms and Complexity Analysis
par: Zhang, Shixuan, et autres
Publié: (2020)

Universal Gradient Methods for Stochastic Convex Optimization
par: Rodomanov, Anton, et autres
Publié: (2024)

Gradient Descent for Convex and Smooth Noisy Optimization
par: Hu, Feifei, et autres
Publié: (2024)

Revisiting Strong Duality, Hidden Convexity, and Gradient Dominance in the Linear Quadratic Regulator
par: Watanabe, Yuto, et autres
Publié: (2025)

Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity
par: Yu, Qian, et autres
Publié: (2024)

Convex Synthesis of First-Order Methods for Time-Varying Smooth Strongly Convex Optimization
par: Van Scoy, Bryan, et autres
Publié: (2026)

Exponential Convergence of Augmented Primal-dual Gradient Algorithms for Partially Strongly Convex Functions
par: Li, Mengmou, et autres
Publié: (2024)

Distributed Adaptive Gradient Algorithm with Gradient Tracking for Stochastic Non-Convex Optimization
par: Han, Dongyu, et autres
Publié: (2024)

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization
par: Wang, Nuozhou, et autres
Publié: (2025)

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

Continuized Nesterov Acceleration for Non-Convex Optimization
par: Hermant, Julien, et autres
Publié: (2025)

Distributed and Inexact Proximal Gradient Method for Online Convex Optimization
par: Bastianello, Nicola, et autres
Publié: (2020)

Hinge-Proximal Stochastic Gradient Methods for Convex Optimization with Functional Constraints
par: Rajoriya, Vaibhav, et autres
Publié: (2025)

An Adaptive and Parameter-Free Nesterov's Accelerated Gradient Method for Convex Optimization
par: Suh, Jaewook J., et autres
Publié: (2025)

Deterministic and Stochastic Accelerated Gradient Method for Convex Semi-Infinite Optimization
par: Yao, Yao, et autres
Publié: (2023)

Dual Averaging With Non-Strongly-Convex Prox-Functions: New Analysis and Algorithm
par: Zhao, Renbo
Publié: (2025)

Adaptive Acceleration Without Strong Convexity Priors Or Restarts
par: Cavalcanti, Joao V., et autres
Publié: (2025)

Technical Report: A Totally Asynchronous Nesterov's Accelerated Gradient Method for Convex Optimization
par: Pond, Ellie, et autres
Publié: (2024)

Revisit First-order Methods for Geodesically Convex Optimization
par: Shu, Yunlu, et autres
Publié: (2025)

A Support-Set Algorithm for Optimization Problems with Nonnegative and Orthogonal Constraints
par: Wang, Lei, et autres
Publié: (2025)

The Method of Ellipcenters for Strongly Convex Functions
par: Bello-Cruz, Yunier
Publié: (2026)

Strong Convexity of Sets in Riemannian Manifolds
par: Scieur, Damien, et autres
Publié: (2023)

Shuffling Momentum Gradient Algorithm for Convex Optimization
par: Tran, Trang H., et autres
Publié: (2024)

Optimal Acceleration for Proximal Minimization of the Sum of Convex and Strongly Convex Functions
par: Chari, Govind M., et autres
Publié: (2026)

A Zeroth-order Proximal Stochastic Gradient Method for Weakly Convex Stochastic Optimization
par: Pougkakiotis, Spyridon, et autres
Publié: (2022)

Perturbed Gradient Descent via Convex Quadratic Approximation for Nonconvex Bilevel Optimization
par: Abolfazli, Nazanin, et autres
Publié: (2025)

High-Resolution Inertial Dynamics with Time-Rescaled Gradients for Nonsmooth Convex Optimization
par: Le, Manh Hung, et autres
Publié: (2026)