A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems (Q1946618): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078665452 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1203.2070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and monotone operator theory in Hilbert spaces / 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: Q3079664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate duality in convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in Vector Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A first-order primal-dual algorithm for convex problems with applications to imaging / 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: Q2753173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prox-Method with Rate of Convergence <i>O</i>(1/<i>t</i>) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems / 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: 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
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3149262 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:28, 6 July 2024

scientific article
Language Label Description Also known as
English
A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems
scientific article

    Statements

    A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems (English)
    0 references
    0 references
    0 references
    15 April 2013
    0 references
    Fenchel duality
    0 references
    regularization
    0 references
    fast gradient method
    0 references
    image processing
    0 references

    Identifiers