Metraipolis › archive › dc_ec775b58eebe

Geometric Pairwise Classification of Affine Constraints over Ellipsoidal Regions — arXiv:2611.09860

Source: arXiv (en)
Original: https://arxiv.org/abs/2611.09860
License (as archived): CC0-1.0
Archived: 2026-11-09T22:42:36.862Z
SHA-256 of the archived text: d2a51b1154d1cf49e7cffd55ab819c9a4623fff203d3ccbf075969e0ddc97c89
Stable URL of this page: https://metraipolis.com/documento/dc_ec775b58eebe

How to cite

Geometric Pairwise Classification of Affine Constraints over Ellipsoidal Regions — arXiv:2611.09860 — arXiv (en), https://arxiv.org/abs/2611.09860 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ec775b58eebe (Metraipolis archive dc_ec775b58eebe, sha256 d2a51b1154d1cf49e7cffd55ab819c9a4623fff203d3ccbf075969e0ddc97c89)

BibTeX

@misc{dcec775b58eebe,
  title = {Geometric Pairwise Classification of Affine Constraints over Ellipsoidal Regions — arXiv:2611.09860},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.09860},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ec775b58eebe; sha256 d2a51b1154d1cf49e7cffd55ab819c9a4623fff203d3ccbf075969e0ddc97c89},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.09860. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

This paper presents a deterministic geometric procedure for analysing affine constraints over fixed ellipsoidal regions, motivated by chance-constrained set approximation. Analytical tests classify inequalities as always violated, never violated, or cutting. Pairwise tests determine whether two inequalities can be strictly violated at a common point, yielding a compatibility matrix. The tests follow from quadratic optimisation and the Karush--Kuhn--Tucker conditions, with explicit treatment of tangencies, parallel normals, and degenerate inequalities. The formulation applies in arbitrary finite dimensions and provides geometric information for subsequent bounds on simultaneous sampled violations and safe-region approximation.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC) ; Systems and Control (eess.SY).
Pagina del lavoro: https://arxiv.org/abs/2611.09860 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-09T22:35:32.274Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).