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

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

Latest revision as of 01:22, 23 July 2024

scientific article
Language Label Description Also known as
English
Efficient Convex Optimization with Oracles
scientific article

    Statements

    Identifiers