On the acceleration of the double smoothing technique for unconstrained convex optimization problems (Q4981856): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
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: Duality in Vector Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative regularization with a general penalty term—theory and application to <i>L</i> <sup>1</sup> and <i>TV</i> regularization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excessive Gap Technique in Nonsmooth Convex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing technique and its applications in semidefinite optimization / rank
 
Normal rank

Latest revision as of 20:34, 9 July 2024

scientific article; zbMATH DE number 6417949
Language Label Description Also known as
English
On the acceleration of the double smoothing technique for unconstrained convex optimization problems
scientific article; zbMATH DE number 6417949

    Statements

    Identifiers

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