Image de couverture de livre

A Riemannian Accelerated Proximal Gradient Method

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Feng, Shuailing, Jiang, Yuhang, Huang, Wen, Ying, Shihui
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control 90C25, 90C26, 90C48
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

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

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

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

A Set-Valued Lagrange Theorem based on a Process for Convex Vector Programming
par: García-Castaño, Fernando, et autres
Publié: (2024)

Lagrange Multipliers, Duality, and Sensitivity in Set-Valued Convex Programming via Pointed Closed Convex Processes
par: García-Castaño, Fernando, 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)

A new dual spectral projected gradient method for log-determinant semidefinite programming with hidden clustering structures
par: Namchaisiri, Charles, et autres
Publié: (2024)

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
par: Marumo, Hiroki, et autres
Publié: (2024)

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

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
par: Kojima, Masakazu, et autres
Publié: (2025)

Constructing QCQP Instances Equivalent to Their SDP Relaxations
par: Kojima, Masakazu, et autres
Publié: (2025)

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
par: Arima, Naohiko, et autres
Publié: (2023)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
par: Arima, Naohiko, et autres
Publié: (2024)

Separable QCQPs and Their Exact SDP Relaxations
par: Kojima, Masakazu, et autres
Publié: (2026)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
par: Zhang, Chenyu, et autres
Publié: (2023)

Projected Gradient Methods with Momentum
par: Lapucci, Matteo, et autres
Publié: (2026)

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

A Normal Map-Based Proximal Stochastic Gradient Method: Convergence and Identification Properties
par: Qiu, Junwen, et autres
Publié: (2023)

Decentralized projected Riemannian stochastic recursive momentum method for nonconvex optimization
par: Deng, Kangkang, et autres
Publié: (2024)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
par: Xie, Xiyuan, et autres
Publié: (2025)

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

A Modified Proximal Bundle Method Under A Frank-Wolfe Perspective
par: Fersztand, David, et autres
Publié: (2024)

Multivariate approximation by polynomial and generalised rational functions
par: Millán, R. Díaz, et autres
Publié: (2021)

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
par: Zhang, Liwei, et autres
Publié: (2025)

On Tackling High-Dimensional Nonconvex Stochastic Optimization via Stochastic First-Order Methods with Non-smooth Proximal Terms and Variance Reduction
par: Xie, Yue, et autres
Publié: (2025)

Symmetric and Non-Symmetric Cone Separation via Bishop-Phelps Cones in Normed Spaces
par: García-Castaño, Fernando, et autres
Publié: (2025)

Exact Convex Reformulations of Linear Neural Networks via Completely Positive Lifting
par: Prakhya, Karthik, et autres
Publié: (2026)

Alternating minimization for square root principal component pursuit
par: Deng, Shengxiang, et autres
Publié: (2024)

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
par: Li, Qia, et autres
Publié: (2024)

Kurdyka-Łojasiewicz exponent via square transformation
par: Ouyang, Wenqing
Publié: (2025)

Kurdyka-Łojasiewicz exponent via Hadamard parametrization
par: Ouyang, Wenqing, et autres
Publié: (2024)

A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-quadratic Regularized Optimal Transport Problems
par: Yang, Lei, et autres
Publié: (2023)

Splitting Proximal Point Algorithms for the Sum of Prox-Convex Functions
par: de Brito, Jose, et autres
Publié: (2026)

Riemannian Federated Learning via Averaging Gradient Streams
par: Huang, Zhenwei, et autres
Publié: (2024)

Extending Linear Convergence of the Proximal Point Algorithm: The Quasar-Convex Case
par: de Brito, José, et autres
Publié: (2025)

On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation
par: Bollapragada, Raghu, et autres
Publié: (2025)

Tractable downfall of basis pursuit in structured sparse optimization
par: Marmary, Maya V., et autres
Publié: (2025)

Tight Semidefinite Relaxations for Verifying Robustness of Neural Networks
par: Azuma, Godai, et autres
Publié: (2025)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
par: Takahashi, Shota, et autres
Publié: (2025)