Efficient Nonnegative Matrix Factorization by DC Programming and DCA | Citedby Results | Neural Computation | MIT Press

Skip to Main Content

Skip Nav Destination

Efficient Nonnegative Matrix Factorization by DC Programming and DCA

Neural Computation (2016) 28 (6): 1163–1216.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

Open issues and recent advances in DC programming and DCA

Hoai An Le Thi
Tao Pham Dinh

Journal of Global Optimization (2023)

Alternating DC algorithm for partial DC programming problems

Tao Pham Dinh
Van Ngai Huynh
Hoai An Le Thi
Vinh Thanh Ho

Journal of Global Optimization (2022) 82 (4): 897.

A novel dictionary learning method for sparse representation with nonconvex regularizations

Benying Tan
Yujie Li
Haoli Zhao
Xiang Li
Shuxue Ding

Neurocomputing (2020) 417: 128.

DC programming and DCA: thirty years of developments

Hoai An Le Thi
Tao Pham Dinh

Mathematical Programming (2018) 169 (1): 5.

DC programming for solving a sparse modeling problem of video key frame extraction

Benying Tan
Yujie Li
Shuxue Ding
Incheon Paik
Atsunori Kanemura

Digital Signal Processing (2018) 83: 214.

Nonnegative Sparse Representation of Signals With a Determinant-Type Sparsity Measure Based on the DC Programming

Benying Tan
Shuxue Ding
Yujie Li
Xiang Li

IEEE Access (2018) 6: 67301.

Analysis Sparse Representation for Nonnegative Signals Based on Determinant Measure by DC Programming

Yujie Li
Benying Tan
Atsunori Kanemura
Shuxue Ding
Wuhui Chen

Complexity (2018) 2018: 1.

Device-Free Localization via Dictionary Learning with Difference of Convex Programming

Xiang Li
Shuxue Ding
Zhenni Li
Benying Tan

IEEE Sensors Journal 1.