Cover Image

Decentralized projected Riemannian stochastic recursive momentum method for nonconvex optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Deng, Kangkang, Hu, Jiang
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control 90C06, 90C22, 90C26, 90C56
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

A new dual spectral projected gradient method for log-determinant semidefinite programming with hidden clustering structures
by: Namchaisiri, Charles, et al.
Published: (2024)

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

On a globally convergent semismooth* Newton method in nonsmooth nonconvex optimization
by: Gfrerer, H.
Published: (2024)

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

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
by: Mannel, Florian
Published: (2024)

Sum-of-squares hierarchies for polynomial optimization and the Christoffel-Darboux kernel
by: Slot, Lucas
Published: (2021)

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
by: Marumo, Hiroki, et al.
Published: (2024)

A squared smoothing Newton method for semidefinite programming
by: Liang, Ling, et al.
Published: (2023)

Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization based on push-forward measures
by: Slot, Lucas, et al.
Published: (2024)

A preconditioned augmented Lagrangian method for solving semidefinite programming problems
by: Tang, Tianyun, et al.
Published: (2026)

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

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

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

Optimistic Bilevel Optimization with Composite Lower-Level Problem
by: Solla, Mattia, et al.
Published: (2026)

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

Worst-case complexity analysis of derivative-free methods for multi-objective optimization
by: Liuzzi, Giampaolo, et al.
Published: (2025)

ZOBA: An Efficient Single-loop Zeroth-order Bilevel Optimization Algorithm
by: Rando, Marco, et al.
Published: (2026)

A four-operator splitting algorithm for nonconvex and nonsmooth optimization
by: Alcantara, Jan Harold, et al.
Published: (2024)

Dual Spectral Projected Gradient Method for Generalized Log-det Semidefinite Programming
by: Namchaisiri, Charles, et al.
Published: (2024)

Exploiting Sign Symmetries in Minimizing Sums of Rational Functions
by: Guo, Feng, et al.
Published: (2024)

On the convexity for the range set of two quadratic functions
by: Nguyen, Huu-Quang, et al.
Published: (2025)

An Exceptionally Difficult Binary Quadratic Optimization Problem with Symmetry: a Challenge for The Largest Unsolved QAP Instance Tai256c
by: Fujii, Koichi, et al.
Published: (2023)

Alternating minimization for square root principal component pursuit
by: Deng, Shengxiang, et al.
Published: (2024)

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

Sparse Polynomial Optimization with Unbounded Sets
by: Huang, Lei, et al.
Published: (2024)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
by: Arima, Naohiko, et al.
Published: (2024)

Sparse Polynomial Matrix Optimization
by: Miller, Jared, et al.
Published: (2024)

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
by: Arima, Naohiko, et al.
Published: (2023)

A Moment-SOS Hierarchy for Robust Polynomial Matrix Inequality Optimization with SOS-Convexity
by: Guo, Feng, et al.
Published: (2023)

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
by: Kojima, Masakazu, et al.
Published: (2025)

Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
by: Qu, Zheng, et al.
Published: (2023)

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

Beyond binarity: Semidefinite programming for ternary quadratic problems
by: de Meijer, Frank, et al.
Published: (2026)

Separable QCQPs and Their Exact SDP Relaxations
by: Kojima, Masakazu, et al.
Published: (2026)