An Extension of Chubanov's Polynomial-Time Linear Programming Algorithm to Second-Order Cone Programming
Tomonari Kitahara, Takashi Tsuchiya
TL;DR
This paper extends Chubanov's polynomial-time algorithm from linear programming to second-order cone programming, broadening its applicability to more complex convex optimization problems.
Contribution
The paper introduces a novel extension of Chubanov's algorithm specifically adapted for second-order cone programming problems.
Findings
Algorithm successfully extended to second-order cone programming
Maintains polynomial-time complexity
Potential for broader application in convex optimization
Abstract
Recently, Chubanov proposed an interesting new polynomial-time algorithm for linear program. In this paper, we extend his algorithm to second-order cone 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 · Advanced Control Systems Optimization · Optimization and Variational Analysis