Universal gradient methods for convex optimization problems (Q494332): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 8 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-014-0790-0 / rank
Normal rank
 
Property / author
 
Property / author: Sumit K. Garg / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C47 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6477217 / rank
 
Normal rank
Property / zbMATH Keywords
 
convex optimization
Property / zbMATH Keywords: convex optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
black-box methods
Property / zbMATH Keywords: black-box methods / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity bounds
Property / zbMATH Keywords: complexity bounds / rank
 
Normal rank
Property / zbMATH Keywords
 
optimal methods
Property / zbMATH Keywords: optimal methods / rank
 
Normal rank
Property / zbMATH Keywords
 
weakly smooth functions
Property / zbMATH Keywords: weakly smooth functions / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NESUN / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1985240368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth minimization of non-smooth functions / 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: First-order methods of smooth convex optimization with inexact oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector approximation problems in geometric vector optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New variants of bundle methods / 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: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient methods for minimizing composite functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual subgradient methods for convex problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-014-0790-0 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:24, 9 December 2024

scientific article
Language Label Description Also known as
English
Universal gradient methods for convex optimization problems
scientific article

    Statements

    Identifiers