Linear convergence of first order methods for non-strongly convex optimization (Q2414900): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SCS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963830980 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q105946458 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1504.06298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Methods for Linear Constraints: Convergence Rates and Conditioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Asynchronous Parallel Stochastic Coordinate Descent Algorithm / 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: Robust Stochastic Approximation Approach to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinate descent algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4257334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds and convergence analysis of feasible descent methods: A general approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearly convergent away-step conditional gradient for non-strongly convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to error bounds for structured convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds for solutions of linear equations and inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient methods for minimizing composite functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive restart for accelerated gradient schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2809807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conic optimization via operator splitting and homogeneous self-dual embedding / rank
 
Normal rank

Latest revision as of 07:06, 19 July 2024

scientific article
Language Label Description Also known as
English
Linear convergence of first order methods for non-strongly convex optimization
scientific article

    Statements

    Linear convergence of first order methods for non-strongly convex optimization (English)
    0 references
    0 references
    0 references
    0 references
    17 May 2019
    0 references

    Identifiers

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