Infoscience
metadata only
Greedy algorithms for cone constrained optimization with convergence guarantees
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
- Restart-Free Oracle-Efficient Methods for Strongly Convex Composite Optimization#1012118
- Diffeomorphic Optimization#329103
- Basic Inequalities for First-Order Optimization with Applications to Statistical Risk Analysis#1084105
- Sampled-Max Subgradient Method for Convex Finite-Max Optimization#1117585
- Online Convex Optimization with Sublinear Noisy Probes#271829
Record · ID 304768
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