arXiv (All)
open access
On the convexification of a bilinearly constrained set with a common variable
We study the convexification of sets defined by box constraints and bilinear inequality constraints in which all bilinear terms share a common variable. For this structured class of nonconvex sets, we provide a complete characterization of the extreme points of the convex hull and derive an explicit
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
- Convex Hulls of Reachable Sets#144182
- Streaming algorithms for robust max-min diversification#1156728
- A DC-Reformulation for Gradient-$L^0$-Constrained Problems#1142541
- Norms of Constatives#91454
- An elementary solution of the polarization problem#1361473
Record · ID 1327706
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