arXiv (All)
open access
Randomized Submanifold Subgradient Method for Optimization over Stiefel Manifolds
Optimization over the Stiefel manifold is a fundamental computational problem in many scientific and engineering applications. Despite considerable research effort, high-dimensional optimization problems over the Stiefel manifold remain challenging, particularly when the objective function is nonsmo
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Why can genetic algorithms work in high-dimensional search spaces?#1130204
- Bayesian Optimization with Rich Auxiliary Information via LLMs#1014031
- Can Adaptive Gradient Methods Converge under Heavy-Tailed Noise? A Case Study of AdaGrad#200482
- High-Probability Convergence Theory for Distributed Composite Optimization with Sub-Weibull Noises#160903
- A Riemannian Inertial Adaptive Gradient Method with Momentum Restart#1117709
Record · ID 1116072
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive