Universal method for stochastic composite optimization problems (Q1746349): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q130189478, #quickstatements; #temporary_batch_1733738735016
 
(2 intermediate revisions by 2 users not shown)
Property / cites work
 
Property / cites work: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient methods for minimizing composite functions / 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: Universal gradient methods for convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic intermediate gradient method for convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic intermediate gradient method for convex problems with stochastic inexact oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3967357 / 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: Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints / 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: Efficient numerical methods for entropy-linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive restart for accelerated gradient schemes / 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: Q5491447 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1134/s0965542518010050 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2790570656 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130189478 / rank
 
Normal rank

Latest revision as of 11:08, 9 December 2024

scientific article
Language Label Description Also known as
English
Universal method for stochastic composite optimization problems
scientific article

    Statements

    Universal method for stochastic composite optimization problems (English)
    0 references
    0 references
    0 references
    25 April 2018
    0 references
    fast gradient method
    0 references
    composite optimization
    0 references
    universal method
    0 references
    strongly convex case
    0 references
    stochastic optimization
    0 references
    method of similar triangles
    0 references

    Identifiers