An improved cutting plane method for convex optimization, convex-concave games, and its applications

DOI10.1145/3357713.3384284OpenAlexW3034810578MaRDI QIDQ5144979

Zhao Song, Haotian Jiang, Sam Chiu-wai Wong, Yin Tat Lee

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.04250

zbMATH Keywords

convex optimizationmarket equilibriumcutting plane methodconvex-concave gamesfast rectangular matrix multiplication

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

A simple method for convex optimization in the oracle model ⋮ Algorithmic pure states for the negative spherical perceptron ⋮ Complexity of optimizing over the integers ⋮ Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) ⋮ Unnamed Item