arXiv (All)
open access
Projected Gradient Method on Hadamard Manifolds
We study constrained smooth optimization problems on Hadamard manifolds with closed geodesically convex feasible sets. We analyze two projected gradient schemes: one with a constant stepsize and another with a backtracking line search. The constant-stepsize scheme is analyzed under the assumption th
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
- A Polynomial-Time Inner Approximation Algorithm for Multi-Objective and Parametric Optimization#179151
- Regularized Extragradient Methods for Solving Equilibrium Problems on Hadamard Manifolds#793453
- Regularized Extragradient Methods for Solving Equilibrium Problems on Hadamard Manifolds#789449
- On the Absence of Identifiable Manifolds in Finite-Max Composite Optimization#625247
- On the Absence of Identifiable Manifolds in Finite-Max Composite Optimization#622974
Record · ID 819979
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