OSGA: a fast subgradient algorithm with optimal complexity (Q304218): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1516695992 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1402.1125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms for Convex Minimization in Relative Scale / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal subgradient algorithm with subspace search for costly convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal subgradient algorithm for large-scale bound-constrained convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal subgradient algorithms for large-scale convex optimization in simple domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Gradient and Proximal Methods for Convex and Conic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the rate of convergence of the preconditioned conjugate gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A First-Order Augmented Lagrangian Method for Compressed Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The CoMirror algorithm for solving nonsmooth constrained convex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Templates for convex cone problems with applications to sparse signal recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: A First-Order Smoothing Technique for a Class of Large-Scale Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order methods of smooth convex optimization with inexact oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix-free interior point method for compressed sensing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Constrained Differentiable Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient methods for minimizing composite functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3967358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding of convex sets and efficient gradient methods for linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconstrained Convex Minimization in Relative Scale / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual subgradient methods for convex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal gradient methods for convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning / rank
 
Normal rank

Latest revision as of 10:57, 12 July 2024

scientific article
Language Label Description Also known as
English
OSGA: a fast subgradient algorithm with optimal complexity
scientific article

    Statements

    OSGA: a fast subgradient algorithm with optimal complexity (English)
    0 references
    0 references
    25 August 2016
    0 references
    complexity bound
    0 references
    convex optimization
    0 references
    optimal subgradient method
    0 references
    large-scale optimization
    0 references
    Nesterov's optimal method
    0 references
    nonsmooth optimization
    0 references
    optimal first-order method
    0 references
    smooth optimization
    0 references
    strongly convex
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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