``Efficient” Subgradient Methods for General Convex Optimization (Q5506689): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1605.08712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated first-order methods for hyperbolic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:30, 13 July 2024

scientific article; zbMATH DE number 6662672
Language Label Description Also known as
English
``Efficient” Subgradient Methods for General Convex Optimization
scientific article; zbMATH DE number 6662672

    Statements

    Identifiers

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