Cover Image

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhang, Chenyu, Jiang, Rujun
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control 90C30, 65K05, 90C26, 90C60, 68Q25
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Riemannian Trust Region Methods for SC$^1$ Minimization
by: Zhang, Chenyu, et al.
Published: (2023)

Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
by: Marumo, Naoki, et al.
Published: (2023)

Distributed Gradient-Regularized Newton Method: Scheduled Consensus and O(epsilon^{-1}) Global Iteration Complexity
by: Hu, Wei, et al.
Published: (2026)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
by: Zhou, Juan, et al.
Published: (2024)

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

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
by: Takahashi, Shota, et al.
Published: (2025)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
by: Deng, Kangkang, et al.
Published: (2024)

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

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
by: Marumo, Naoki
Published: (2025)

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

An Augmented Lagrangian Method for Training Recurrent Neural Networks
by: Wang, Yue, et al.
Published: (2024)

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
by: Li, Qia, et al.
Published: (2024)

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

Convergence-Guaranteed Algorithms for l1/2-Regularized Quadratic Programs with Assignment Constraints
by: Xie, Lijun, et al.
Published: (2025)

Barrier Algorithms for Constrained Non-Convex Optimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

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

A Busemann hybrid projection-proximal point algorithm for optimization problems on Hadamard manifolds
by: Millán, R. Díaz, et al.
Published: (2026)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
by: Niu, Yi-Shuai, et al.
Published: (2018)

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
by: Brosch, Daniel, et al.
Published: (2025)

Delayed Feedback in Online Non-Convex Optimization: A Non-Stationary Approach with Applications
by: Lara, Felipe, et al.
Published: (2024)

Preconditioned Proximal Gradient Methods with Conjugate Momentum: A Subspace Perspective
by: Chen, Jian, et al.
Published: (2026)

Efficient parameter-free restarted accelerated gradient methods for convex and strongly convex optimization
by: Sujanani, Arnesh, et al.
Published: (2024)

Grassmannian optimization is NP-hard
by: Lai, Zehua, et al.
Published: (2024)

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

Local Convergence Analysis of ADMM for Nonconvex Composite Optimization
by: Xie, Xiyuan, et al.
Published: (2026)

MoSSP: A Momentum-Based Single-Loop Stochastic Penalty Method for Nonconvex Constrained DC-Regularized Optimization
by: Li, Luxuan, et al.
Published: (2026)

Steering exact penalty DCA for nonsmooth DC optimization problems with equality and inequality constraints
by: Dolgopolik, M. V.
Published: (2021)

Randomized block proximal method with locally Lipschitz continuous gradient
by: Pérez-Aros, Pedro, et al.
Published: (2025)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
by: Kanzow, Christian, et al.
Published: (2025)

A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
by: Zhou, Junpeng, et al.
Published: (2025)

Effectively Leveraging Momentum Terms in Stochastic Line Search Frameworks for Fast Optimization of Finite-Sum Problems
by: Lapucci, Matteo, et al.
Published: (2024)

Convergence Conditions for Stochastic Line Search Based Optimization of Over-parametrized Models
by: Lapucci, Matteo, et al.
Published: (2024)

Extragradient method with feasible inexact projection to variational inequality problem
by: Millán, R. Díaz, et al.
Published: (2023)

A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
by: He, Chuan, et al.
Published: (2023)

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

First- and Second-Order Stochastic Adaptive Regularization with Cubics: High Probability Iteration and Sample Complexity
by: Scheinberg, Katya, et al.
Published: (2023)

On the convergence of proximal gradient methods for convex simple bilevel optimization
by: Latafat, Puya, et al.
Published: (2023)

Adaptive Inertial Method
by: Long, Han, et al.
Published: (2025)

Tight Error Bounds for the Sign-Constrained Stiefel Manifold
by: Chen, Xiaojun, et al.
Published: (2022)

An Inexact Regularized Proximal Newton Method without Line Search
by: Dahl, Simeon vom, et al.
Published: (2024)