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

DOI10.1145/3357713.3384284MaRDI QIDQ5144979zbMATH OpenOpenAlexFDO

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

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 optimizationconvex-concave gamescutting plane methodfast rectangular matrix multiplicationmarket equilibrium

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(13)

• Generalized \(\gamma\)-valid cut procedure for concave minimization
• A simple method for convex optimization in the oracle model
• Algorithmic pure states for the negative spherical perceptron
• Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
• scientific article; zbMATH DE number 7559394 (Why is no real title available?)
• Complexity of optimizing over the integers
• Fast algorithms via dynamic-oracle matroids
• A simple method for convex optimization in the oracle model
• Certifying Lyapunov stability of black-box nonlinear systems via counterexample guided synthesis
• Training multi-layer over-parametrized neural network in subquadratic time
• Efficient convex optimization requires superlinear memory
• Majorizing measures for the optimizer
• Quantum computing inspired iterative refinement for semidefinite optimization

This page was built for publication: An improved cutting plane method for convex optimization, convex-concave games, and its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144979)