Lower Bounds for Parallel and Randomized Convex Optimization (Q4969036): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Sharp uniform convexity and smoothness inequalities for trace norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Variable Density Sampling with Block-Constrained Acquisition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated Methods for NonConvex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth Optimization with Approximate Gradient / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Affine-Invariant Smooth Minimization Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Smoothing for Stochastic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preserving Statistical Validity in Adaptive Data Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lower complexity bounds for large-scale smooth convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The best constants in the Khintchine inequality / 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: On parallel complexity of nonsmooth convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal methods of smooth convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3967358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On first-order algorithms for<i>l</i><sub>1</sub>/nuclear norm minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040885 / 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: High-Dimensional Statistics / rank
 
Normal rank

Latest revision as of 17:05, 23 July 2024

scientific article; zbMATH DE number 7255036
Language Label Description Also known as
English
Lower Bounds for Parallel and Randomized Convex Optimization
scientific article; zbMATH DE number 7255036

    Statements

    0 references
    0 references
    5 October 2020
    0 references
    lower bounds
    0 references
    convex optimization
    0 references
    parallel algorithms
    0 references
    randomized algorithms
    0 references
    non-Euclidean optimization
    0 references
    math.OC
    0 references
    cs.DS
    0 references
    cs.LG
    0 references
    stat.ML
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references