Dipòsit Digital de Documents de la UAB
metadata only
Separating plane algorithms for convex optimization
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
- Complexities of Weak Proximal Oracle Methods for Composite Convex Optimization#1050601
- Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints#429994
- Reinforcement Learning to Accelerate Primal-Dual Hybrid Gradient for Linear Programming#1156818
- McADMM: A Multi-Clique Augmented Lagrangian-Based Algorithm for Large-Scale Sparse SDPs with Bound Constraints#1156775
- On the Optimal Linear Minimization Oracle Complexity of Active-Hull Methods for Minimizing Convex Hölder Smooth Functions#1119174
Record · ID 429981
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