Copertina

Towards faster first order methods: A continuous-time model to interpolate between speed and function value restart

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Maulén, Juan José, Guo, Huiyuan, Peypouquet, Juan
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A Speed Restart Scheme for a Dynamical System with Hessian-Driven Damping and Three Constant Coefficients
di: Guo, Huiyuan, et al.
Pubblicazione: (2024)

Convergence Rate Analysis for Monotone Accelerated Proximal Gradient Method
di: Wang, Zepeng, et al.
Pubblicazione: (2025)

Accelerated Gradient Methods via Inertial Systems with Hessian-driven Damping
di: Wang, Zepeng, et al.
Pubblicazione: (2025)

Fast convex optimization via inertial systems with asymptotically vanishing viscosity and Hessian-driven damping
di: Wang, Zepeng, et al.
Pubblicazione: (2025)

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

Accelerated Backward Forward Method for Convex Optimization
di: Wang, Zepeng, et al.
Pubblicazione: (2026)

Asymptotic behavior of penalty dynamics for constrained variational inequalities
di: Qu, Siqi, et al.
Pubblicazione: (2025)

Penalty-Based Smoothing of Convex Nonsmooth Supremum Functions with Accelerated Inertial Dynamics
di: Adly, Samir, et al.
Pubblicazione: (2026)

Unifying restart accelerated gradient and proximal bundle methods
di: Liang, Jiaming
Pubblicazione: (2025)

Computer-aided analyses of stochastic first-order methods, via interpolation conditions for stochastic optimization
di: Rubbens, Anne, et al.
Pubblicazione: (2025)

A note on first-order and transversality conditions in infinite-horizon continuous-time optimal control models
di: Bosi, Stefano, et al.
Pubblicazione: (2026)

Last-Iterate Complexity of SGD for Convex and Smooth Stochastic Problems
di: Garrigos, Guillaume, et al.
Pubblicazione: (2025)

Global Optimization Algorithm through High-Resolution Sampling
di: Cortild, Daniel, et al.
Pubblicazione: (2024)

Bias-Optimal Bounds for SGD: A Computer-Aided Lyapunov Analysis
di: Cortild, Daniel, et al.
Pubblicazione: (2025)

Parallel variational quantum algorithms with gradient-informed restart to speed up optimisation in the presence of barren plateaus
di: Mastropietro, Daniel, et al.
Pubblicazione: (2023)

Another approach to build Lyapunov functions for the first order methods in the quadratic case
di: Merkulov, Daniil, et al.
Pubblicazione: (2023)

An accelerated gradient method with adaptive restart for convex multiobjective optimization problems
di: Luo, Hao, et al.
Pubblicazione: (2025)

A line search framework with restarting for noisy optimization problems
di: Berahas, Albert S., et al.
Pubblicazione: (2025)

Stability of first-order methods in tame optimization
di: Lai, Lexiao
Pubblicazione: (2024)

Automated tight Lyapunov analysis for first-order methods
di: Upadhyaya, Manu, et al.
Pubblicazione: (2023)

Simple linesearch-free first-order methods for nonconvex optimization
di: Yagishita, Shotaro, et al.
Pubblicazione: (2025)

On iteratively regularized first-order methods for simple bilevel optimization
di: Samadi, Sepideh, et al.
Pubblicazione: (2025)

Bounds for the tracking error of first-order online optimization methods
di: Madden, Liam, et al.
Pubblicazione: (2020)

A first-order condition for discrete-time distribution steering
di: Corella, Alberto Domínguez, et al.
Pubblicazione: (2025)

An SDE perspective on stochastic convex optimization
di: Maulen-Soto, Rodrigo, et al.
Pubblicazione: (2022)

Attention-based PCA
di: Maulen-Soto, Rodrigo, et al.
Pubblicazione: (2026)

Krasnoselskii-Mann Iterations: Inertia, Perturbations and Approximation
di: Cortild, Daniel, et al.
Pubblicazione: (2024)

Introducing the method of ellipcenters, a new first order technique for unconstrained optimization
di: Behling, Roger, et al.
Pubblicazione: (2025)

An energy optimization method based on mixed-integer model and variational quantum computing algorithm for faster IMPT
di: Zhu, Ya-Nan, et al.
Pubblicazione: (2025)

Worst-case analysis of restarted primal-dual hybrid gradient on totally unimodular linear programs
di: Hinder, Oliver
Pubblicazione: (2023)

Toward generalizable learning of all (linear) first-order methods via memory augmented Transformers
di: Dutta, Sanchayan, et al.
Pubblicazione: (2024)

The AutoLyap software suite for computer-assisted Lyapunov analyses of first-order methods
di: Upadhyaya, Manu, et al.
Pubblicazione: (2025)

Tensor-based empirical interpolation method and its application in model reduction
di: Tripathi, Brij Nandan, et al.
Pubblicazione: (2024)

Modified global finite-time quasi-continuous second-order robust feedback control
di: Ruderman, Michael, et al.
Pubblicazione: (2025)

Higher-order tensor methods for minimizing difference of convex functions
di: Necoara, Ion
Pubblicazione: (2024)

A unified Euler--Lagrange system for analyzing continuous-time accelerated gradient methods
di: Toyoda, Mitsuru, et al.
Pubblicazione: (2024)

An optimal first-order method for smooth and strongly convex composite optimization and its stationary limit
di: Upadhyaya, Manu, et al.
Pubblicazione: (2026)

Nonconvex optimization methods for ground states in disordered continuous-spin models
di: Agrawal, Ramgopal, et al.
Pubblicazione: (2026)

A unified high-resolution ODE framework for first-order methods
di: Wang, Lixia, et al.
Pubblicazione: (2026)

Duality between polyhedral approximation of value functions and optimal quantization of measures
di: Mehamdi, Abdellah Bulaich, et al.
Pubblicazione: (2025)