HAL (France)
open access
Convex optimization for data science : continuous-time Lyapunov analyses, geometry dependent matching pursuit and concentration inequalities
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
- On the Convergence of a Noisy Gradient Method for Non-convex Distributed Resource Allocation: Saddle Point Escape#670365
- On the Convergence of a Noisy Gradient Method for Non-convex Distributed Resource Allocation: Saddle Point Escape#668300
- The Complexity of Convex Optimization with Mismatched Geometry#1117622
- Projection-Free Algorithms for Nonsmooth Stochastic Convex-Concave Saddle-Point Problems#1129869
- Global solutions for the sensors placement problem via weakly convex optimization#974498
Record · ID 274337
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