A Complementarity Partition Theorem for Multifold Conic Systems
Javier Pe\~na, Vera Roshchina

TL;DR
This paper extends the Goldman-Tucker Theorem to multifold convex conic systems, establishing a canonical partition of the index set based on complementarity sets linked to interior solutions.
Contribution
It introduces a complementarity partition theorem for multifold convex conic systems, generalizing classical linear programming results to a broader conic setting.
Findings
Established a canonical partition of index sets for conic systems.
Extended Goldman-Tucker Theorem to multifold convex conic systems.
Connected interior solutions to complementarity sets in conic systems.
Abstract
Consider a homogeneous multifold convex conic system and its alternative system where are regular closed convex cones. We show that there is canonical partition of the index set determined by certain complementarity sets associated to the most interior solutions to the two systems. Our results are inspired by and extend the Goldman-Tucker Theorem for linear programming.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Optimization Algorithms Research · Optimization and Variational Analysis · Matrix Theory and Algorithms
