arXiv (All)
open access
Applications of the Lorentz positive cone in nonconvex quadratic optimization
We consider the Lorentz positive cone of $n\times m$ matrices that map the Lorentz cone in $\Rbb^m$ into the Lorentz cone in $\Rbb^n$. The Lorentz positive cone and its dual, the cone of Lorentz separable matrices, are shown to provide polynomial-time algorithms for the problem of minimizing a bilin
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
- Graphs of Moore-Penrose inverse of matrices possessing the treeangle property#1061888
- Classical and Quantum Speedups for Non-Convex Optimization via Energy Conserving Descent#13076
- Perron similarities and the nonnegative inverse eigenvalue problem#609751
- Symmetric Amplituhedra I: Spinor Helicity#1130258
- A Nuclear-Norm Lower Bound for Dithered Scalar Quantization of Matrix Products#972692
Record · ID 1115973
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