Ellipsoid Method for Linear Programming made simple
Sanjeev Saxena
TL;DR
This paper simplifies the derivation of the ellipsoid method for linear programming, making it accessible with minimal algebraic knowledge, and highlights the typical complexity in understanding its correctness.
Contribution
It presents a simplified derivation of the ellipsoid method that requires only basic algebra, contrasting with traditional approaches that demand advanced linear algebra.
Findings
Simplified derivation of the ellipsoid method
Accessible explanation requiring minimal algebra
Highlights complexity in traditional proofs
Abstract
In this paper, ellipsoid method for linear programming is derived using only minimal knowledge of algebra and matrices. Unfortunately, most authors first describe the algorithm, then later prove its correctness, which requires a good knowledge of linear algebra.
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 · Matrix Theory and Algorithms