Random Coordinate Descent Methods for Nonseparable Composite Optimization-Reference-Cited by-同舟云学术

Random Coordinate Descent Methods for Nonseparable Composite Optimization

Published:2023-08-17 Issue:3 Volume:33 Page:2160-2190
ISSN:1052-6234
Container-title:SIAM Journal on Optimization
language:en
Short-container-title:SIAM J. Optim.

Author:

Chorobura Flavia¹,Necoara Ion²

Affiliation:

1. Automatic Control and Systems Engineering, University Politehnica Bucharest, 060042 Bucharest, Romania.

2. Automatic Control and Systems Engineering, University Politehnica Bucharest, 060042 Bucharest, Romania and Gheorghe Mihoc-Caius Iacob Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy, 050711 Bucharest, Romania.

Funder

H2020 Marie Skłodowska-Curie Actions

Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

Theoretical Computer Science,Software,Applied Mathematics

Reference37 articles.

1. An Accelerated Coordinate Gradient Descent Algorithm for Non-separable Composite Optimization

2. Minimization of functions having Lipschitz continuous first partial derivatives

3. Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization

4. On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes

5. On the Convergence of Block Coordinate Descent Type Methods

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Coordinate descent methods beyond smoothness and separability;Computational Optimization and Applications;2024-02-13