Corpus ID: 226976065

# Simple Iterative Methods for Linear Optimization over Convex Sets

@article{Dadush2020SimpleIM,
title={Simple Iterative Methods for Linear Optimization over Convex Sets},
author={D. Dadush and Christopher Hojny and S. Huiberts and Stefan Weltge},
journal={ArXiv},
year={2020},
volume={abs/2011.08557}
}
• D. Dadush, +1 author Stefan Weltge
• Published 2020
• Mathematics, Computer Science
• ArXiv
• We give simple iterative methods for computing approximately optimal primal and dual solutions for the problem of maximizing a linear functional over a convex set $K$ given by a separation oracle. In contrast to prior work, our algorithms directly output primal and dual solutions and avoid a common requirement of binary search on the objective value. Under the assumption that $K$ contains a ball of radius $r$ and is contained inside the origin centered ball of radius $R$, using \$O(\frac{R^4}{r… CONTINUE READING

#### References

SHOWING 1-10 OF 31 REFERENCES
A new algorithm for minimizing convex functions over convex sets
• P. Vaidya
• Mathematics, Computer Science
• Math. Program.
• 1996
• 257
• PDF
A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization
• Mathematics, Computer Science
• 2015 IEEE 56th Annual Symposium on Foundations of Computer Science
• 2015
• 169
• PDF
Rescaling Algorithms for Linear Conic Feasibility
• Mathematics, Computer Science
• Math. Oper. Res.
• 2020
• 6
• PDF
On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs
• E. Boyd
• Mathematics, Computer Science
• SIAM J. Discret. Math.
• 1996
• 5
• Highly Influential
Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear Time
• Mathematics, Computer Science
• 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
• 2017
• 17
• PDF