Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2310.10082
Cited By
A simple uniformly optimal method without line search for convex optimization
16 October 2023
Tianjiao Li
Guanghui Lan
Re-assign community
ArXiv
PDF
HTML
Papers citing
"A simple uniformly optimal method without line search for convex optimization"
8 / 8 papers shown
Title
Analysis of an Idealized Stochastic Polyak Method and its Application to Black-Box Model Distillation
Robert M. Gower
Guillaume Garrigos
Nicolas Loizou
Dimitris Oikonomou
Konstantin Mishchenko
Fabian Schaipp
31
0
0
02 Apr 2025
The inexact power augmented Lagrangian method for constrained nonconvex optimization
Alexander Bodard
Konstantinos A. Oikonomidis
Emanuel Laude
Panagiotis Patrinos
19
0
0
26 Oct 2024
Auto-conditioned primal-dual hybrid gradient method and alternating direction method of multipliers
Guanghui Lan
Tianjiao Li
11
0
0
02 Oct 2024
Optimization on a Finer Scale: Bounded Local Subgradient Variation Perspective
Jelena Diakonikolas
Cristóbal Guzmán
76
1
0
24 Mar 2024
Problem-Parameter-Free Decentralized Nonconvex Stochastic Optimization
Jiaxiang Li
Xuxing Chen
Shiqian Ma
Mingyi Hong
ODL
19
2
0
13 Feb 2024
Adaptive proximal gradient methods are universal without approximation
Konstantinos A. Oikonomidis
Emanuel Laude
P. Latafat
Andreas Themelis
Panagiotis Patrinos
12
6
0
09 Feb 2024
On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
P. Latafat
Andreas Themelis
Panagiotis Patrinos
15
11
0
30 Nov 2023
Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization
Guanghui Lan
Yuyuan Ouyang
Zhe Zhang
11
7
0
18 Oct 2023
1