Imagen de Portada

Riemannian Gradient Method with Momentum

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Leggio, Filippo, Scuppa, Diego
Formato:	Preprint
Publicado:	2026
Materias:	Optimization and Control 90C26, 90C30, 90C53, 90C60
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Projected Gradient Methods with Momentum
por: Lapucci, Matteo, et al.
Publicado: (2026)

A Globally Convergent Gradient Method with Momentum
por: Lapucci, Matteo, et al.
Publicado: (2024)

A Stochastic Quasi-Newton Method in the Absence of Common Random Numbers
por: Menickelly, Matt, et al.
Publicado: (2023)

Norm-induced Cuts: Outer Approximation for Lipschitzian Constraint Functions
por: Göß, Adrian, et al.
Publicado: (2024)

cuHALLaR: A GPU Accelerated Low-Rank Augmented Lagrangian Method for Large-Scale Semidefinite Programming
por: Aguirre, Jacob M., et al.
Publicado: (2025)

PANOC-lite: A simpler and more efficient algorithm for composite minimization
por: Bodard, Alexander, et al.
Publicado: (2026)

Optimization with Trained Machine Learning Models Embedded
por: Schweidtmann, Artur M., et al.
Publicado: (2022)

A Riemannian Accelerated Proximal Gradient Method
por: Feng, Shuailing, et al.
Publicado: (2025)

Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
por: Lapucci, Matteo, et al.
Publicado: (2024)

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

A new envelope function for nonsmooth DC optimization
por: Themelis, Andreas, et al.
Publicado: (2020)

New vector transport operators extending a Riemannian CG algorithm to generalized Stiefel manifold with low-rank applications
por: Wang, Xuejie, et al.
Publicado: (2023)

Parallelizing the Circumcentered-Reflection Method
por: Barros, Pablo, et al.
Publicado: (2025)

Proximal Nonlinear Conjugate Gradient Methods for Composite Optimization
por: Hamana, Shodai, et al.
Publicado: (2026)

Optimal Subgradient Methods for Lipschitz Convex Optimization with Error Bounds
por: Wang, Alex L.
Publicado: (2025)

On Tackling High-Dimensional Nonconvex Stochastic Optimization via Stochastic First-Order Methods with Non-smooth Proximal Terms and Variance Reduction
por: Xie, Yue, et al.
Publicado: (2025)

Nonsmooth exact penalty methods for equality-constrained optimization: complexity and implementation
por: Diouane, Youssef, et al.
Publicado: (2024)

A Modified Proximal Bundle Method Under A Frank-Wolfe Perspective
por: Fersztand, David, et al.
Publicado: (2024)

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

Star Quasiconvexity: a Unified Approach for Linear Convergence of First-Order Methods Beyond Convexity
por: Khanh, Phan Quoc, et al.
Publicado: (2025)

Depth-first directional search for nonconvex optimization
por: Zhang, Yuxuan, et al.
Publicado: (2024)

Riemannian Interior Point Methods for Constrained Optimization on Manifolds
por: Lai, Zhijian, et al.
Publicado: (2022)

Derivative-Free Bilevel Optimization with Inexact Lower-Level Solutions
por: Cesaroni, Edoardo, et al.
Publicado: (2026)

Optimization over convex polyhedra via Hadamard parametrizations
por: Tang, Tianyun, et al.
Publicado: (2024)

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
por: Quintero, Rodolfo A., et al.
Publicado: (2024)

Effective Front-Descent Algorithms with Convergence Guarantees
por: Lapucci, Matteo, et al.
Publicado: (2024)

Projection-based curve pattern search for black-box optimization over smooth convex sets
por: Jia, Xiaoxi, et al.
Publicado: (2025)

A Surrogate Value Function Formulation for Bilevel Optimization
por: Xu, Mengwei, et al.
Publicado: (2025)

Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization
por: Higuchi, Rei, et al.
Publicado: (2024)

Penalty decomposition derivative free method for the minimization of partially separable functions over a convex feasible set
por: Cecere, Francesco, et al.
Publicado: (2025)

Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
por: González-Díaz, Julio, et al.
Publicado: (2025)

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
por: Ghaffari-Hadigheh, Alireza, et al.
Publicado: (2022)

Global Optimization of Gaussian processes
por: Schweidtmann, Artur M., et al.
Publicado: (2020)

Solving Sparse MIQCQPs: Application to the Unit Commitment Problem with ACOPF Constraints
por: Gómez-Casares, Ignacio, et al.
Publicado: (2025)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
por: Xie, Xiyuan, et al.
Publicado: (2025)

Clash of MINLP Relaxations: Piecewise Linear vs. Global Parabolic
por: Göß, Adrian
Publicado: (2026)

Hidden convexity of quadratic systems and its application to quadratic programming
por: Huy, Nguyen Quang, et al.
Publicado: (2026)

Parabolic Approximation & Relaxation for MINLP
por: Göß, Adrian, et al.
Publicado: (2024)

Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs
por: McRae, Andrew D., et al.
Publicado: (2023)

A minimal face constant rank constraint qualification for reducible conic programming
por: Andreani, Roberto, et al.
Publicado: (2023)