Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization (Q2355319): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-014-0795-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2035507034 / 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: Q3361866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Convergent Incremental Gradient Method with a Constant Step Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sample size selection in optimization methods for machine learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Deterministic-Stochastic Methods for Data Fitting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented $\ell_1$ and Nuclear-Norm Models with a Globally Linearly Convergent Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm / 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: Non-asymptotic convergence analysis of inexact gradient methods for machine learning without strong convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descent methods for convex essentially smooth minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:44, 10 July 2024

scientific article
Language Label Description Also known as
English
Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization
scientific article

    Statements

    Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization (English)
    0 references
    0 references
    0 references
    22 July 2015
    0 references
    restricted strong convexity
    0 references
    gradient method
    0 references
    inexact gradient method
    0 references
    rate of linear convergence
    0 references

    Identifiers