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
- A new approach to computing maximum flows using electrical flows
- 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
- Area-convexity, _ regularization, and undirected multicommodity flow
- Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs
- Exploratory distributions for convex functions
- Geometric algorithms and combinatorial optimization
- Random gradient-free minimization of convex functions
- Sharp \(L^1\)-Poincaré inequalities correspond to optimal hypersurface cuts
- Simulated Annealing for Convex Optimization
- Solving convex programs by random walks
Cited in
(10)- Quantum algorithm design: techniques and applications
- Approximating convex functions via non-convex oracles under the relative noise model
- On the oracle complexity of smooth strongly convex minimization
- Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives
- A simple method for convex optimization in the oracle model
- Integer conic function minimization based on the comparison oracle
- Proximal-ACCPM: a versatile oracle based optimisation method
- Solving convex programs by random walks
- A simple method for convex optimization in the oracle model
- Distribution testing with a confused collector
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)
