Pages that link to "Item:Q4631817"
From MaRDI portal
The following pages link to Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature (Q4631817):
Displaying 9 items.
- Review on contraction analysis and computation of contraction metrics (Q2696111) (← links)
- First Order Methods for Optimization on Riemannian Manifolds (Q3300552) (← links)
- Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods (Q5003207) (← links)
- A Projected Subgradient Method for the Computation of Adapted Metrics for Dynamical Systems (Q5056852) (← links)
- Path-based incremental target level algorithm on Riemannian manifolds (Q5221271) (← links)
- A Subgradient Algorithm for Data-Rate Optimization in the Remote State Estimation Problem (Q5860639) (← links)
- A communication-efficient and privacy-aware distributed algorithm for sparse PCA (Q6133304) (← links)
- Subgradient algorithm for computing contraction metrics for equilibria (Q6166779) (← links)
- Smoothing algorithms for nonsmooth optimization over the Stiefel manifold with applications to the graph Fourier basis problem (Q6580208) (← links)
