:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Ji, Yao, Lan, Guanghui
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2511.03723
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Stochastic Auto-conditioned Fast Gradient Methods with Optimal Rates
by: Ji, Yao, et al.
Published: (2026)

Uniformly Optimal and Parameter-free First-order Methods for Convex and Function-constrained Optimization
by: Deng, Qi, et al.
Published: (2024)

Solving Convex Smooth Function Constrained Optimization Is Almost As Easy As Unconstrained Optimization
by: Zhang, Zhe, et al.
Published: (2022)

Complexity of Minimizing Regularized Convex Quadratic Functions
by: Thomsen, Daniel Berg, et al.
Published: (2024)

Nearly Optimal $L_p$ Risk Minimization
by: Jia, Zhichao, et al.
Published: (2024)

Universal Online Convex Optimization Meets Second-order Bounds
by: Zhang, Lijun, et al.
Published: (2021)

Stochastic first-order methods for average-reward Markov decision processes
by: Li, Tianjiao, et al.
Published: (2022)

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

Over-Approximating Minimizer Sets of Constrained Convex Programs with Parametric Uncertainty via Reachability Analysis
by: Gould, Brendan, et al.
Published: (2026)

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

Convex Submodular Minimization with Indicator Variables
by: Gomez, Andres, et al.
Published: (2025)

Convex Submodular Minimization with Indicator Variables
by: Han, Shaoning, et al.
Published: (2022)

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

Universal Adaptive Proximal Gradient Methods via Gradient Mapping Accumulation
by: Wang, Zimeng, et al.
Published: (2026)

High-Resolution Inertial Dynamics with Time-Rescaled Gradients for Nonsmooth Convex Optimization
by: Le, Manh Hung, et al.
Published: (2026)

Auto-conditioned primal-dual hybrid gradient method and alternating direction method of multipliers
by: Lan, Guanghui, et al.
Published: (2024)

A simple uniformly optimal method without line search for convex optimization
by: Li, Tianjiao, et al.
Published: (2023)

Global Solutions to Non-Convex Functional Constrained Problems with Hidden Convexity
by: Fatkhullin, Ilyas, et al.
Published: (2025)

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

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

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

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

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

Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization
by: Lan, Guanghui, et al.
Published: (2023)

Value Mirror Descent for Reinforcement Learning
by: Jia, Zhichao, et al.
Published: (2026)

Regularization in Data-driven Predictive Control: A Convex Relaxation Perspective
by: Shang, Xu, et al.
Published: (2025)

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

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

Extended Zero-Gradient-Sum Approach for Constrained Distributed Optimization with Free Initialization
by: Shi, Xinli, et al.
Published: (2023)

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

Distributed Event-Triggered Bandit Convex Optimization with Time-Varying Constraints
by: Zhang, Kunpeng, et al.
Published: (2024)

A model-free first-order method for linear quadratic regulator with $\tilde{O}(1/\varepsilon)$ sampling complexity
by: Ju, Caleb, et al.
Published: (2022)

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

Convex Chance-Constrained Programs with Wasserstein Ambiguity
by: Shen, Haoming, et al.
Published: (2021)

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

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

Estimating Sequences with Memory for Minimizing Convex Non-smooth Composite Functions
by: Dosti, Endrit, et al.
Published: (2025)

Differentiability and Regularization of Parametric Convex Value Functions in Stochastic Multistage Optimization
by: Franc, Adrien Le, et al.
Published: (2022)

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

Can SGD Handle Heavy-Tailed Noise?
by: Fatkhullin, Ilyas, et al.
Published: (2025)