Image de couverture de livre

Projected Gradient Methods with Momentum

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lapucci, Matteo, Liuzzi, Giampaolo, Lucidi, Stefano, Sciandrone, Marco, Scuppa, Diego
Format:	Preprint
Publié:	2026
Sujets:	Optimization and Control 90C29, 90C26, 90C60
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Globally Convergent Gradient Method with Momentum
par: Lapucci, Matteo, et autres
Publié: (2024)

Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
par: Lapucci, Matteo, et autres
Publié: (2024)

Riemannian Gradient Method with Momentum
par: Leggio, Filippo, et autres
Publié: (2026)

Worst-case complexity analysis of derivative-free methods for multi-objective optimization
par: Liuzzi, Giampaolo, et autres
Publié: (2025)

Derivative-Free Bilevel Optimization with Inexact Lower-Level Solutions
par: Cesaroni, Edoardo, et autres
Publié: (2026)

Cardinality-Constrained Multi-Objective Optimization: Novel Optimality Conditions and Algorithms
par: Lapucci, Matteo, et autres
Publié: (2023)

Penalty decomposition derivative free method for the minimization of partially separable functions over a convex feasible set
par: Cecere, Francesco, et autres
Publié: (2025)

Effective Front-Descent Algorithms with Convergence Guarantees
par: Lapucci, Matteo, et autres
Publié: (2024)

Projection-based curve pattern search for black-box optimization over smooth convex sets
par: Jia, Xiaoxi, et autres
Publié: (2025)

A linesearch-based derivative-free method for noisy black-box problems
par: De Santis, Alberto, et autres
Publié: (2025)

On the Computation of the Efficient Frontier in Advanced Sparse Portfolio Optimization
par: Annunziata, Arturo, et autres
Publié: (2025)

An interior point method for nonlinear constrained derivative-free optimization
par: Brilli, Andrea, et autres
Publié: (2021)

Some optimality conditions of set-valued optimization problems in locally convex topological vector spaces
par: Zeng, Renying
Publié: (2024)

Effectively Leveraging Momentum Terms in Stochastic Line Search Frameworks for Fast Optimization of Finite-Sum Problems
par: Lapucci, Matteo, et autres
Publié: (2024)

Depth-first directional search for nonconvex optimization
par: Zhang, Yuxuan, et autres
Publié: (2024)

First and Second Order Necessary and Sufficient Optimality Conditions of Fritz John Type for Vector Problems over Cones
par: Ivanov, Vsevolod I.
Publié: (2024)

Multiobjective Programming and Weighting Scalar Problem
par: Ivanov, Vsevolod I.
Publié: (2025)

Dual Spectral Projected Gradient Method for Generalized Log-det Semidefinite Programming
par: Namchaisiri, Charles, et autres
Publié: (2024)

Norm-induced Cuts: Outer Approximation for Lipschitzian Constraint Functions
par: Göß, Adrian, et autres
Publié: (2024)

Stochastic Gradient Descent Revisited
par: Louzi, Azar
Publié: (2024)

Worst case complexity bounds for linesearch-type derivative-free algorithms
par: Brilli, Andrea, et autres
Publié: (2023)

cuHALLaR: A GPU Accelerated Low-Rank Augmented Lagrangian Method for Large-Scale Semidefinite Programming
par: Aguirre, Jacob M., et autres
Publié: (2025)

A Riemannian Accelerated Proximal Gradient Method
par: Feng, Shuailing, et autres
Publié: (2025)

Efficient globalization of heavy-ball type methods for unconstrained optimization based on curve searches
par: Donnini, Federica, et autres
Publié: (2025)

Scaled Proximal Gradient Methods for Multiobjective Optimization: Improved Linear Convergence and Nesterov's Acceleration
par: Chen, Jian, et autres
Publié: (2024)

Convex quadratic sets and the complexity of mixed integer convex quadratic programming
par: Del Pia, Alberto
Publié: (2023)

Optimization with Trained Machine Learning Models Embedded
par: Schweidtmann, Artur M., et autres
Publié: (2022)

Convergence Conditions for Stochastic Line Search Based Optimization of Over-parametrized Models
par: Lapucci, Matteo, et autres
Publié: (2024)

Generalized Reduced Jacobian Method
par: Maghri, M. El, et autres
Publié: (2025)

$\ell_0$-Norm Multiobjective Optimization Models Motivated by Applications to Proton Therapy
par: Cong, Xiaoda, et autres
Publié: (2025)

A Refined Proximal Algorithm for Nonconvex Multiobjective Optimization in Hilbert Spaces
par: Bento, G. C., et autres
Publié: (2024)

Random Reshuffling with Momentum for Nonconvex Problems: Iteration Complexity and Last Iterate Convergence
par: Qiu, Junwen, et autres
Publié: (2024)

On a minimization problem of the maximum generalized eigenvalue: properties and algorithms
par: Nishioka, Akatsuki, et autres
Publié: (2023)

Minimizing and Maximizing the Shannon Entropy for Fixed Marginals
par: Franke, Paula, et autres
Publié: (2025)

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
par: Borges, Jennifer C., et autres
Publié: (2026)

A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach
par: Monteiro, Renato D. C., et autres
Publié: (2024)

A Subspace Minimization Barzilai-Borwein Method for Multiobjective Optimization Problems
par: Chen, Jian, et autres
Publié: (2024)

Proximal Nonlinear Conjugate Gradient Methods for Composite Optimization
par: Hamana, Shodai, et autres
Publié: (2026)

A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization
par: Mansueto, Pierluigi
Publié: (2025)

A New Linear Programming Approach and a New Backtracking Strategy for Multiple-Gradient Descent in Multi-Objective Optimization
par: Della Santa, Francesco
Publié: (2024)