Efficient Convex Optimization with Oracles

DOI10.1007/978-3-662-59204-5_10zbMath1452.68272OpenAlexW3005196415MaRDI QIDQ3295271

Aaron Sidford, Yin Tat Lee, Santosh Vempala

Publication date: 8 July 2020

Published in: Bolyai Society Mathematical Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-59204-5_10

zbMATH Keywords

convex optimizationreductionsseparationmembership

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Convex programming (90C25) Randomized algorithms (68W20)

Related Items (2)

Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives ⋮ Quantum algorithm design: techniques and applications

Cites Work

• Sharp \(L^1\)-Poincaré inequalities correspond to optimal hypersurface cuts
• Geometric algorithms and combinatorial optimization
• Algorithms for approximate calculation of the minimum of a convex function from its values
• Exploratory distributions for convex functions
• Random gradient-free minimization of convex functions
• Area-convexity, l _∞ regularization, and undirected multicommodity flow
• An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
• Simulated Annealing for Convex Optimization
• Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
• A new approach to computing maximum flows using electrical flows
• Solving convex programs by random walks

This page was built for publication: Efficient Convex Optimization with Oracles