:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Chen, Xiaojun, Kelley, C. T., Wang, Lei
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control
Acceso en línea:	https://arxiv.org/abs/2505.03506
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Complexity of Projected Gradient Methods for Strongly Convex Optimization with Hölder Continuous Gradient Terms
por: Chen, Xiaojun, et al.
Publicado: (2026)

Generalized conditional gradient methods for multiobjective composite optimization problems with H{ö}lder condition
por: Chen, Wang, et al.
Publicado: (2024)

An Adaptive Smoothing Algorithm for Non-Lipschitz Optimization on Manifolds with Complexity Guarantees
por: Wang, Lei, et al.
Publicado: (2026)

Faster Newton Methods for Convex and Nonconvex Optimization in Gradient Complexity
por: Chen, Lesi, et al.
Publicado: (2025)

HNAG$^{++}$: An Accelerated Gradient Method with a Refined Asymptotic Rate for Strongly Convex Optimization
por: Chen, Long, et al.
Publicado: (2025)

Exponential Stability of Primal-Dual Gradient Dynamics with Non-Strong Convexity
por: Chen, Xin, et al.
Publicado: (2019)

Restart-Free (Accelerated) Gradient Sliding Methods for Strongly Convex Composite Optimization
por: Wu, Xinming, et al.
Publicado: (2026)

Revisiting Stochastic Gradient Descent for Strongly Convex Objectives: Tight Uniform-in-Time Bounds
por: Chen, Kang, et al.
Publicado: (2025)

The Sample Complexity of Gradient Descent in Stochastic Convex Optimization
por: Livni, Roi
Publicado: (2024)

A New Inexact Gradient Descent Method with Applications to Nonsmooth Convex Optimization
por: Khanh, Pham Duy, et al.
Publicado: (2023)

Adaptive Accelerated Gradient Descent Methods for Convex Optimization
por: Xu, Zeyi, et al.
Publicado: (2026)

Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization
por: Zhang, Liang, et al.
Publicado: (2023)

Adaptive Accelerated Gradient Method for Smooth Convex Optimization
por: Wang, Zepeng, et al.
Publicado: (2025)

Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity
por: Yu, Qian, et al.
Publicado: (2024)

On Distributionally Robust Multistage Convex Optimization: New Algorithms and Complexity Analysis
por: Zhang, Shixuan, et al.
Publicado: (2020)

Universal Gradient Methods for Stochastic Convex Optimization
por: Rodomanov, Anton, et al.
Publicado: (2024)

Gradient Descent for Convex and Smooth Noisy Optimization
por: Hu, Feifei, et al.
Publicado: (2024)

Revisiting Strong Duality, Hidden Convexity, and Gradient Dominance in the Linear Quadratic Regulator
por: Watanabe, Yuto, et al.
Publicado: (2025)

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

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

Exponential Convergence of Augmented Primal-dual Gradient Algorithms for Partially Strongly Convex Functions
por: Li, Mengmou, et al.
Publicado: (2024)

Robust Solutions of Nonlinear Least Squares Problems via Min-max Optimization
por: Chen, Xiaojun, et al.
Publicado: (2024)

Distributed Adaptive Gradient Algorithm with Gradient Tracking for Stochastic Non-Convex Optimization
por: Han, Dongyu, et al.
Publicado: (2024)

A Support-Set Algorithm for Optimization Problems with Nonnegative and Orthogonal Constraints
por: Wang, Lei, et al.
Publicado: (2025)

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization
por: Wang, Nuozhou, et al.
Publicado: (2025)

Distributed and Inexact Proximal Gradient Method for Online Convex Optimization
por: Bastianello, Nicola, et al.
Publicado: (2020)

Continuized Nesterov Acceleration for Non-Convex Optimization
por: Hermant, Julien, et al.
Publicado: (2025)

Technical Report: A Totally Asynchronous Nesterov's Accelerated Gradient Method for Convex Optimization
por: Pond, Ellie, et al.
Publicado: (2024)

Shuffling Momentum Gradient Algorithm for Convex Optimization
por: Tran, Trang H., et al.
Publicado: (2024)

Adaptive Acceleration Without Strong Convexity Priors Or Restarts
por: Cavalcanti, Joao V., et al.
Publicado: (2025)

Revisit First-order Methods for Geodesically Convex Optimization
por: Shu, Yunlu, et al.
Publicado: (2025)

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

Hinge-Proximal Stochastic Gradient Methods for Convex Optimization with Functional Constraints
por: Rajoriya, Vaibhav, et al.
Publicado: (2025)

An Adaptive and Parameter-Free Nesterov's Accelerated Gradient Method for Convex Optimization
por: Suh, Jaewook J., et al.
Publicado: (2025)

Deterministic and Stochastic Accelerated Gradient Method for Convex Semi-Infinite Optimization
por: Yao, Yao, et al.
Publicado: (2023)

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

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

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

A Zeroth-order Proximal Stochastic Gradient Method for Weakly Convex Stochastic Optimization
por: Pougkakiotis, Spyridon, et al.
Publicado: (2022)

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