On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems (Q285921): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Marc Teboulle / rank
Normal rank
 
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/s13675-015-0048-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2149119057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Méthodes numériques pour la décomposition et la minimisation de fonctions non différentiables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes / 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: On the Convergence of Block Coordinate Descent Type Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal alternating linearized minimization for nonconvex and nonsmooth problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of the block nonlinear Gauss-Seidel method under convex constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximité et dualité dans un espace hilbertien / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Optimization in Signal Processing and Communications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On search directions for minimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of a block coordinate descent method for nondifferentiable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinate descent algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:13, 12 July 2024

scientific article
Language Label Description Also known as
English
On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
scientific article

    Statements

    On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems (English)
    0 references
    0 references
    0 references
    19 May 2016
    0 references
    non-smooth convex minimization
    0 references
    alternating proximal methods
    0 references
    coordinate descent
    0 references
    non-asymptotic rate of convergence
    0 references

    Identifiers