Koc University Digital Collections
metadata only
Rounding on the standard simplex: regular grids for global optimization
Given a point on the standard simplex, we calculate a proximal point on the regular grid which is closest with respect to any norm in a large class, including all l(p)-norms for p >= 1 . We show that the minimal l(p)-distance to the regular grid on the standard simplex can exceed one, even for very
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
- Distributed Santa Claus via Global Rounding#1084194
- The integrability of sesqui-regular graphs with smallest eigenvalue at least $-3$#1064244
- Nonexistence of a Strongly Regular Graph with Parameters (266,45,0,9): A Certificate-Free Lean Proof#985683
- Polynomial Lower Bounds for Distributed Graph Sketching with Tiny Error: Connectivity and Spanning Tree Construction#973425
- Incidence Rank and Bounded Defect for Linear Hypergraphs with Cograph Line Graphs#1064321
Record · ID 954711
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