Cover Image

Gradient Methods with Memory for Minimizing Composite Functions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Florea, Mihai I.
Format:	Preprint
Published:	2022
Subjects:	Optimization and Control Signal Processing 68Q25, 65Y20, 65B99, 90C25
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A template for gradient norm minimization
by: Florea, Mihai I.
Published: (2024)

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

An optimal lower bound for smooth convex functions
by: Florea, Mihai I., et al.
Published: (2024)

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

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

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

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

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

Deep Centralization for the Circumcentered Reflection Method
by: Barros, Pablo
Published: (2025)

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

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

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

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

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

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

Optimization in Theory and Practice
by: Wright, Stephen J.
Published: (2025)

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

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

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

Minimal enclosing balls via geodesics
by: Goodwin, Ariel, et al.
Published: (2026)

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

Accelerated primal dual fixed point algorithm
by: Zhu, Ya-Nan
Published: (2025)

Recursive Bound-Constrained AdaGrad with Applications to Multilevel and Domain Decomposition Minimization
by: Gratton, Serge, et al.
Published: (2025)

Geometry-dependent matching pursuit: a transition phase for convergence on linear regression and LASSO
by: Moucer, Céline, et al.
Published: (2024)

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

Parallel Polyhedral Projection Method for the Convex Feasibility Problem
by: Barros, Pablo, et al.
Published: (2025)

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

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

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

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
by: Zhang, Chenyu, et al.
Published: (2023)

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

Nonsmooth Projection-Free Optimization with Functional Constraints
by: Asgari, Kamiar, et al.
Published: (2023)

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

A finitely convergent circumcenter method for the Convex Feasibility Problem
by: Behling, Roger, et al.
Published: (2023)

Fejér* monotonicity in optimization algorithms
by: Behling, Roger, et al.
Published: (2024)

Essential Convergence Rates of Continuous-Time Models for Optimization Methods
by: Ushiyama, Kansei, et al.
Published: (2025)

On the Convergence of the Sinkhorn-Knopp Algorithm with Sparse Cost Matrices
by: Mena, Jose Rafael Espinosa
Published: (2024)

A practical randomized trust-region method to escape saddle points in high dimension
by: Dragomir, Radu-Alexandru, et al.
Published: (2026)

Accelerating preconditioned ADMM via degenerate proximal point mappings
by: Sun, Defeng, et al.
Published: (2024)

Hybrid hierarchical matrices with adaptive mixed precision storage
by: Khan, Ritesh, et al.
Published: (2026)