Cover Image

Uniformly Optimal and Parameter-free First-order Methods for Convex and Function-constrained Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Deng, Qi, Lan, Guanghui, Lin, Zhenwei
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints
by: Lin, Zhenwei, et al.
Published: (2022)

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

High-order Accumulative Regularization for Gradient Minimization in Convex Programming
by: Ji, Yao, et al.
Published: (2025)

Decentralized Gradient-Free Methods for Stochastic Non-Smooth Non-Convex Optimization
by: Lin, Zhenwei, et al.
Published: (2023)

Optimal Methods for Unknown Piecewise Smooth Problems I: Convex Optimization
by: Lin, Zhenwei, et al.
Published: (2026)

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

Level Constrained First Order Methods for Function Constrained Optimization
by: Boob, Digvijay, et al.
Published: (2022)

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)

Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity
by: Xia, Jingfan, et al.
Published: (2025)

Accelerated Distance-adaptive Methods for Hölder Smooth and Convex Optimization
by: Ren, Yijin, et al.
Published: (2025)

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

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

A Parameter-free Decentralized Algorithm for Composite Convex Optimization
by: Chen, Xiaokai, et al.
Published: (2025)

A Single-Loop Robust Policy Gradient Method for Robust Markov Decision Processes
by: Lin, Zhenwei, et al.
Published: (2024)

Optimal Decentralized Composite Optimization for Convex Functions
by: Ye, Haishan, et al.
Published: (2023)

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

A Smooth Approximation Framework for Weakly Convex Optimization
by: Deng, Qi, et al.
Published: (2025)

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

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

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

A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization
by: Ren, Kunjie, et al.
Published: (2025)

Parameter Optimization in Trajectory Planning via Differentiable Convex Programming
by: Xu, Ziqi, et al.
Published: (2025)

Near-Optimal Convex Simple Bilevel Optimization with a Bisection Method
by: Wang, Jiulin, et al.
Published: (2024)

A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programming
by: Lu, Haihao, et al.
Published: (2023)

First-order methods for Stochastic Variational Inequality problems with Function Constraints
by: Boob, Digvijay, et al.
Published: (2023)

Graph Isomorphism: Mixed-Integer Convex Optimization from First-Order Methods
by: Xiao, Wenjie, et al.
Published: (2025)

Universal and Parameter-free Gradient Sliding for Composite Optimization
by: Wu, Yan, et al.
Published: (2026)

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

A Universal Transfer Theorem for Convex Optimization Algorithms Using Inexact First-order Oracles
by: Kerger, Phillip, et al.
Published: (2024)

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

Stochastic Weakly Convex Optimization Beyond Lipschitz Continuity
by: Gao, Wenzhi, et al.
Published: (2024)

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

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

An Efficient Solution Method for Solving Convex Separable Quadratic Optimization Problems
by: Li, Shaoze, et al.
Published: (2025)

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

Beyond Convexity: Proximal-Perturbed Lagrangian Methods for Efficient Functional Constrained Optimization
by: Moon, Sang Bin, et al.
Published: (2024)

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

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

Polyak Minorant Method for Convex Optimization
by: Devanathan, Nikhil, et al.
Published: (2023)

Entropic Optimal Transport Problem with Convex Functional Cost
by: Kazeykina, Anna, et al.
Published: (2025)