Universal intermediate gradient method for convex problems with inexact oracle (Q5865342): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
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: Universal method of searching for equilibria and stochastic equilibria in transportation networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth Optimization with Approximate Gradient / 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: Stochastic intermediate gradient method for convex problems with stochastic inexact oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stable alternative to Sinkhorn's algorithm for regularized optimal transport / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restarting the accelerated coordinate descent method with a rough strong convexity estimate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive restart of accelerated gradient methods under local quadratic growth condition / 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: Fast gradient descent for convex minimization problems with an oracle producing a \(( \delta, L)\)-model of function at the requested point / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized uniformly optimal methods for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems / 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: An optimal method for stochastic composite 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: Gradient methods for minimizing composite functions / 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: Gradient methods for problems with inexact model of the objective / rank
 
Normal rank

Revision as of 07:00, 29 July 2024

scientific article; zbMATH DE number 7540591
Language Label Description Also known as
English
Universal intermediate gradient method for convex problems with inexact oracle
scientific article; zbMATH DE number 7540591

    Statements

    Universal intermediate gradient method for convex problems with inexact oracle (English)
    0 references
    0 references
    0 references
    0 references
    13 June 2022
    0 references
    convex optimization
    0 references
    first-order methods
    0 references
    inexact oracle
    0 references
    intermediate gradient methods
    0 references
    complexity bounds
    0 references
    0 references

    Identifiers