Copertina

An optimal lower bound for smooth convex functions

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Florea, Mihai I., Nesterov, Yurii
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control 52A41, 90C25, 68Q25, 65Y20, 65B99
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A template for gradient norm minimization
di: Florea, Mihai I.
Pubblicazione: (2024)

Adaptive first-order methods with enhanced worst-case rates
di: Florea, Mihai I.
Pubblicazione: (2024)

Gradient Methods with Memory for Minimizing Composite Functions
di: Florea, Mihai I.
Pubblicazione: (2022)

A Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
di: Yuan, Ya-xiang, et al.
Pubblicazione: (2024)

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
di: Nesterov, Yurii
Pubblicazione: (2025)

Dimension-free estimators of gradients of functions with(out) non-independent variables
di: Lamboni, Matieyendou
Pubblicazione: (2025)

Error Bounds for a Class of Cone-Convex Inclusion Problems
di: Huy, Nguyen Quang, et al.
Pubblicazione: (2025)

Improved global performance guarantees of second-order methods in convex minimization
di: Dvurechensky, Pavel, et al.
Pubblicazione: (2024)

A Proximal-Gradient Method for Solving Regularized Optimization Problems with General Constraints
di: Curtis, Frank E., et al.
Pubblicazione: (2025)

A Proximal-Gradient Method for Constrained Optimization
di: Dai, Yutong, et al.
Pubblicazione: (2024)

Convergence of iterates and improved rates for accelerated augmented Lagrangian methods for linearly constrained convex optimization
di: He, Xin, et al.
Pubblicazione: (2026)

HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming
di: Chen, Kaihuang, et al.
Pubblicazione: (2025)

Discretization of non-uniform rational B-spline (NURBS) models for meshless isogeometric analysis
di: Duh, Urban, et al.
Pubblicazione: (2023)

Fast variable density node generation on parametric surfaces with application to mesh-free methods
di: Duh, Urban, et al.
Pubblicazione: (2020)

Symplectic Discretization Approach for Developing New Proximal Point Algorithm
di: Yuan, Ya-xiang, et al.
Pubblicazione: (2023)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
di: Bot, Radu Ioan, et al.
Pubblicazione: (2024)

Minimization Over the Nonconvex Sparsity Constraint Using A Hybrid First-order method
di: Yang, Xiangyu, et al.
Pubblicazione: (2021)

Identification of Active Subfunctions in Finite-Max Minimisation via a Smooth Reformulation
di: Ras, Charl, et al.
Pubblicazione: (2024)

Restarts subject to approximate sharpness: A parameter-free and optimal scheme for first-order methods
di: Adcock, Ben, et al.
Pubblicazione: (2023)

Optimization in Theory and Practice
di: Wright, Stephen J.
Pubblicazione: (2025)

Small errors in random zeroth-order optimization are imaginary
di: Jongeneel, Wouter, et al.
Pubblicazione: (2021)

Minimal dispersion on the cube and the torus
di: Arman, Andrii, et al.
Pubblicazione: (2024)

Gaussian smoothing gradient descent for minimizing functions (GSmoothGD)
di: Starnes, Andrew, et al.
Pubblicazione: (2023)

Birkhoff interpolation models for optimization with some available derivatives
di: Larson, Jeffrey, et al.
Pubblicazione: (2026)

An adaptive framework for first-order gradient methods
di: Hu, Xiaozhe, et al.
Pubblicazione: (2026)

Accelerated primal dual fixed point algorithm
di: Zhu, Ya-Nan
Pubblicazione: (2025)

Complexity of trust-region methods with unbounded Hessian approximations for smooth and nonsmooth optimization
di: Leconte, Geoffroy, et al.
Pubblicazione: (2023)

Accelerated optimization algorithms and ordinary differential equations: the convex non Euclidean case
di: Dobson, Paul, et al.
Pubblicazione: (2024)

Kahan's Automatic Step-Size Control for Unconstrained Optimization
di: Meng, Yifeng, et al.
Pubblicazione: (2025)

On the Relationships among GPU-Accelerated First-Order Methods for Solving Linear Programming
di: Chen, Kaihuang, et al.
Pubblicazione: (2025)

HPR-LP: An implementation of an HPR method for solving linear programming
di: Chen, Kaihuang, et al.
Pubblicazione: (2024)

Nonlinear conjugate gradient for smooth convex functions
di: Karimi, Sahar, et al.
Pubblicazione: (2021)

Asymmetric Long-Step Primal-Dual Interior-Point Methods with Dual Centering
di: Nesterov, Yurii
Pubblicazione: (2025)

An accelerated randomized Bregman-Kaczmarz method for strongly convex linearly constraint optimization
di: Tondji, Lionel, et al.
Pubblicazione: (2025)

Relaxed Weak Accelerated Proximal Gradient Method: a Unified Framework for Nesterov's Accelerations
di: Li, Hongda, et al.
Pubblicazione: (2025)

Hidden convexity, optimization, and algorithms on rotation matrices
di: Ramachandran, Akshay, et al.
Pubblicazione: (2023)

Memory- and compute-optimized geometric multigrid GMGPolar for curvilinear coordinate representations -- Applications to fusion plasma
di: Litz, Julian, et al.
Pubblicazione: (2025)

Normal cones to sublevel sets of convex and quasi-convex supremum functions
di: Caro, Stephanie, et al.
Pubblicazione: (2026)

New Primal-Dual Algorithm for Convex Problems
di: Liu, Shuning, et al.
Pubblicazione: (2025)

Convex optimization on CAT(0) cubical complexes
di: Goodwin, Ariel, et al.
Pubblicazione: (2024)