Efficient convex optimization with oracles
From MaRDI portal
Publication:3295271
DOI10.1007/978-3-662-59204-5_10zbMATH Open1452.68272OpenAlexW3005196415MaRDI QIDQ3295271FDOQ3295271
Authors: Yin Tat Lee, Aaron Sidford, Santosh S. 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
Recommendations
- A simple method for convex optimization in the oracle model
- A new algorithm for minimizing convex functions over convex sets
- A cutting plane algorithm for convex programming that uses analytic centers
- Integer convex minimization by mixed integer linear optimization
- Solving convex programs by random walks
Cites Work
- Geometric algorithms and combinatorial optimization
- Random gradient-free minimization of convex functions
- Sharp \(L^1\)-Poincaré inequalities correspond to optimal hypersurface cuts
- Solving convex programs by random walks
- Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs
- Simulated Annealing for Convex Optimization
- Algorithms for approximate calculation of the minimum of a convex function from its values
- An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
- Exploratory distributions for convex functions
- A new approach to computing maximum flows using electrical flows
- Area-convexity, \(\ell_\infty\) regularization, and undirected multicommodity flow
Cited In (6)
- Quantum algorithm design: techniques and applications
- Solving convex programs by random walks
- On the oracle complexity of smooth strongly convex minimization
- Proximal-ACCPM: a versatile oracle based optimisation method
- Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives
- A simple method for convex optimization in the oracle model
This page was built for publication: Efficient convex optimization with oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3295271)