Efficient Convex Optimization with Oracles (Q3295271): Difference between revisions

@@ Property / author @@
-Santosh Vempala
@@ Property / author: Santosh Vempala / rank @@
-Normal rank
@@ Property / author @@
+Santosh Vempala
@@ Property / author: Santosh Vempala / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-662-59204-5_10
+Normal rank
@@ Property / OpenAlex ID @@
+W3005196415
@@ Property / OpenAlex ID: W3005196415 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving convex programs by random walks
@@ Property / cites work: Solving convex programs by random walks / rank @@
+Normal rank
@@ Property / cites work @@
+Exploratory distributions for convex functions
@@ Property / cites work: Exploratory distributions for convex functions / rank @@
+Normal rank
@@ Property / cites work @@
+Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Simulated Annealing for Convex Optimization
@@ Property / cites work: Simulated Annealing for Convex Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
+Normal rank
@@ Property / cites work @@
+A new approach to computing maximum flows using electrical flows
+Normal rank
@@ Property / cites work @@
+Random gradient-free minimization of convex functions
+Normal rank
@@ Property / cites work @@
+Algorithms for approximate calculation of the minimum of a convex function from its values
+Normal rank
@@ Property / cites work @@
+Area-convexity, l             <sub>∞</sub>             regularization, and undirected multicommodity flow
+Normal rank
@@ Property / cites work @@
+Sharp \(L^1\)-Poincaré inequalities correspond to optimal hypersurface cuts
+Normal rank