The DOI matches its Crossref record; 69 of the 69 references it cites were found in a registry or an index.
A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
Abstract
This paper considers regularized block multiconvex optimization, where the feasible set and objective function are generally nonconvex but convex in each block of variables. It also accepts nonconvex blocks and requires these blocks to be updated by proximal minimization. We review some interesting applications and propose a generalized block coordinate descent method. Under certain conditions, we show that any limit point satisfies the Nash equilibrium conditions. Furthermore, we establish global convergence and estimate the asymptotic convergence rate of the method by assuming a property based on the Kurdyka--Łojasiewicz inequality. The proposed algorithms are tested on nonnegative matrix and tensor factorization, as well as matrix and tensor recovery from incomplete observations. The tests include synthetic data and hyperspectral data, as well as image sets from the CBCL and ORL databases. Compared to the existing state-of-the-art algorithms, the proposed algorithms demonstrate superior performance in both speed and solution quality. The MATLAB code of nonnegative matrix/tensor decomposition and completion, along with a few demos, are accessible from the authors' homepages.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Learning the parts of objects by non-negative matrix factorization
Lee, D. D., & Seung, H. S. (1999) · Nature · doi:10.1038/44565 · Cited by 13,868
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Lee, D. D., & Seung, H. S. (2000) · neural information processing systems · Cited by 9,873
$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
Aharon, M., Elad, M., & Bruckstein, A. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.881199 · Cited by 9,451
Model Selection and Estimation in Regression with Grouped Variables
Yuan, M., & Lin, Y. (2006) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00532.x · Cited by 7,261
Iterative Solution of Nonlinear Equations in Several Variables
Ortega, J. M., & Rheinboldt, W. C. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719468 · Cited by 6,860
Paatero, P., & Tapper, U. (1994) · Environmetrics · doi:10.1002/env.3170050203 · Cited by 6,023
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (2001) · SIAM Review · doi:10.1137/s003614450037906x · Cited by 5,085
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Seung, D., & Lee, L.-W. (2001) · Cited by 4,753
Monotone Operators and the Proximal Point Algorithm
Rockafellar, R. T. (1976) · SIAM Journal on Control and Optimization · doi:10.1137/0314056 · Cited by 3,559
Some Mathematical Notes on Three-Mode Factor Analysis
Tucker, L. R. (1966) · Psychometrika · doi:10.1007/bf02289464 · Cited by 3,492
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., & Parrilo, P. A. (2010) · SIAM Review · doi:10.1137/070697835 · Cited by 3,471
Removing electroencephalographic artifacts by blind source separation
Jung, T., Makeig, S., Humphries, C., Lee, T.-W., McKeown, M. J., Iragui, V. J., & Sejnowski, T. J. (2000) · Psychophysiology · doi:10.1017/s0048577200980259 · Cited by 3,334
Non-negative matrix factorization with sparseness constraints
Hoyer, P. O. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0408058 · Cited by 2,591
Blind separation of sources, part I: An adaptive algorithm based on neuromimetic architecture
Jutten, C., & Herault, J. (1991) · Signal Processing · doi:10.1016/0165-1684(91)90079-x · Cited by 2,521
Efficient sparse coding algorithms
Lee, H., Battle, A., Raina, R., & Ng, A. Y. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0105 · Cited by 2,394
Online dictionary learning for sparse coding
Mairal, J., Bach, F., Ponce, J., & Sapiro, G. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553463 · Cited by 2,114
Tensor Completion for Estimating Missing Values in Visual Data
Liu, J., Musialski, P., Wonka, P., & Ye, J. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.39 · Cited by 2,063
Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization
Tseng, P. (2001) · Journal of Optimization Theory and Applications · doi:10.1023/a:1017501703105 · Cited by 1,989
Introduction to linear and nonlinear programming
Luenberger, D. G. (1973) · Medical Entomology and Zoology · Cited by 1,915
A New Learning Algorithm for Blind Signal Separation
Амари, Ш.-И., Cichocki, A. S., & Yang, H. H. (1995) · Cited by 1,904
Document clustering based on non-negative matrix factorization
Xu, W., Liu, X., & Gong, Y. (2003) · Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval · doi:10.1145/860435.860485 · Cited by 1,860
Projected Gradient Methods for Nonnegative Matrix Factorization
Lin, C.-J. (2007) · Neural Computation · doi:10.1162/neco.2007.19.10.2756 · Cited by 1,737
Algorithms and applications for approximate nonnegative matrix factorization
Berry, M. W., Browne, M., Langville, A. N., Pauca, V. P., & Plemmons, R. J. (2007) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2006.11.006 · Cited by 1,512
A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
Razaviyayn, M., Hong, M., & Luo, Z.-Q. (2013) · SIAM Journal on Optimization · doi:10.1137/120891009 · Cited by 1,304
(2014) · Choice Reviews Online · doi:10.5860/choice.51-3296 · Cited by 1,260
Attouch, H., Bolte, J., Redont, P., & Soubeyran, A. (2010) · Mathematics of Operations Research · doi:10.1287/moor.1100.0449 · Cited by 1,172
Learning spatially localized, parts-based representation
Li, S. Z., Hou, X. W., Zhang, H. J., & Cheng, Q. S. (2005) · Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001 · doi:10.1109/cvpr.2001.990477 · Cited by 776
Blind Source Separation by Sparse Decomposition in a Signal Dictionary
Zibulevsky, M., & Pearlmutter, B. A. (2001) · Neural Computation · doi:10.1162/089976601300014385 · Cited by 766
A coordinate gradient descent method for nonsmooth separable minimization
Tseng, P., & Yun, S. (2009) · Mathematical Programming · doi:10.1007/s10107-007-0170-0 · Cited by 728
Underdetermined blind source separation using sparse representations
Bofill, P., & Zibulevsky, M. (2001) · Signal Processing · doi:10.1016/s0165-1684(01)00120-7 · Cited by 715
When Does Non-Negative Matrix Factorization Give a Correct Decomposition into Parts?
Donoho, D. L., & Stodden, V. (2004) · doi:10.7916/d88d05n7 · Cited by 685
On the convergence of the block nonlinear Gauss–Seidel method under convex constraints
Grippo, L., & Sciandrone, M. (2000) · Operations Research Letters · doi:10.1016/s0167-6377(99)00074-7 · Cited by 678
Bolte, J., Daniilidis, A., & Lewis, A. (2007) · SIAM Journal on Optimization · doi:10.1137/050644641 · Cited by 671
Nonnegative matrix factorization for spectral data analysis
Pauca, V. P., Piper, J., & Plemmons, R. J. (2006) · Linear Algebra and its Applications · doi:10.1016/j.laa.2005.06.025 · Cited by 584
Fast Local Algorithms for Large Scale Nonnegative Matrix and Tensor Factorizations
CICHOCKI, A., & PHAN, A.-H. (2009) · IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences · doi:10.1587/transfun.e92.a.708 · Cited by 575
Kim, H., & Park, H. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/07069239x · Cited by 574
On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
Attouch, H., & Bolte, J. (2007) · Mathematical Programming · doi:10.1007/s10107-007-0133-5 · Cited by 568
Non-negative tensor factorization with applications to statistics and computer vision
Shashua, A., & Hazan, T. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102451 · Cited by 490
On gradients of functions definable in o-minimal structures
Kurdyka, K. (1998) · Annales de l'Institut Fourier · doi:10.5802/aif.1638 · Cited by 461
Error bounds and convergence analysis of feasible descent methods: a general approach
Luo, Z.-Q., & Tseng, P. (1993) · Annals of Operations Research · doi:10.1007/bf02096261 · Cited by 420
A quadratic programming procedure
Hildreth, C. (1957) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800040113 · Cited by 378
Blind Source Separation and Independent Component Analysis: A Review
Lee, S.-Y. (2005) · International Conference on Neural Information Processing · Cited by 374
An alternating direction algorithm for matrix completion with nonnegative factors
Xu, Y., Yin, W., Wen, Z., & Zhang, Y. (2012) · Frontiers of Mathematics in China · doi:10.1007/s11464-012-0194-5 · Cited by 339
Self-citationOn search directions for minimization algorithms
Powell, M. J. D. (1973) · Mathematical Programming · doi:10.1007/bf01584660 · Cited by 338
Text Mining using Non-Negative Matrix Factorizations
Pauca, V. P., Shahnaz, F., Berry, M. W., & Plemmons, R. J. (2004) · Proceedings of the 2004 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.45 · Cited by 302
Nonnegative Tucker Decomposition
Kim, Y.-D., & Choi, S. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383405 · Cited by 232
Toward Faster Nonnegative Matrix Factorization: A New Algorithm and Comparisons
Kim, J., & Park, H. (2008) · 2008 Eighth IEEE International Conference on Data Mining · doi:10.1109/icdm.2008.149 · Cited by 220
Mansour, A. (1999) · HAL · Cited by 214
Optimisation : méthodes numériques
Auslender, A. (1976) · Masson eBooks · Cited by 210
Sur la géométrie semi- et sous- analytique
Łojasiewicz, S. (1993) · Annales de l'Institut Fourier · doi:10.5802/aif.1384 · Cited by 203
Hybrid huberized support vector machines for microarray classification and gene selection
Wang, L., Zhu, J., & Zou, H. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btm579 · Cited by 189
Lai, M.-J., & Wang, J. (2011) · SIAM Journal on Optimization · doi:10.1137/090775397 · Cited by 188
Welling, M., & Weber, M. (2001) · Pattern Recognition Letters · doi:10.1016/s0167-8655(01)00070-8 · Cited by 168
Algorithms for Sparse Nonnegative Tucker Decompositions
Mørup, M., Hansen, L. K., & Arnfred, S. M. (2008) · Neural Computation · doi:10.1162/neco.2008.11-06-407 · Cited by 167
Non-negative matrix factorization for semi-supervised data clustering
Chen, Y., Rege, M., Dong, M., et al. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-008-0134-6 · Cited by 131
Tensor methods for hyperspectral data analysis: a space object material identification study
Zhang, Q., Wang, H., Plemmons, R. J., et al. (2008) · Journal of the Optical Society of America A · doi:10.1364/josaa.25.003001 · Cited by 99
Minimizing Certain Convex Functions
Warga, J. (1963) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0111043 · Cited by 97
Applications of neural blind separation to signal and image processing
Karhunen, J., Hyvärinen, A., Vigário, R., et al. (2002) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1997.599569 · Cited by 88
Computing non-negative tensor factorizations
Friedlander, M. P., & Hatz, K. (2008) · Optimization methods & software · doi:10.1080/10556780801996244 · Cited by 83
SZ and CMB reconstruction using generalized morphological component analysis
Bobin, J., Moudden, Y., Starck, J., Fadili, J. M., & Aghanim, N. (2007) · Statistical Methodology · doi:10.1016/j.stamet.2007.10.003 · Cited by 80
Fast Nonnegative Tensor Factorization with an Active-Set-Like Method
Kim, J., & Park, H. (2012) · Springer eBooks · doi:10.1007/978-1-4471-2437-5_16 · Cited by 68
On the convergence of sequential minimization algorithms
Sargent, R. W. H., & Sebastian, D. J. (1973) · Journal of Optimization Theory and Applications · doi:10.1007/bf00934779 · Cited by 52
Block Coordinate Descent Methods for Semidefinite Programming
Wen, Z., Goldfarb, D., & Scheinberg, K. (2011) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-1-4614-0769-0_19 · Cited by 49
Kim, H., Park, H., & Eldén, L. (2007) · Proceedings-- IEEE International Symposium on Bioinformatics and Bioengineering · doi:10.1109/bibe.2007.4375705 · Cited by 36
Algorithms for Nonnegative Tensor Factorization
Zafeiriou, S. P. (2009) · Advances in pattern recognition · doi:10.1007/978-1-84882-299-3_5 · Cited by 27
Cited by
Accessing From the Sky: A Tutorial on UAV Communications for 5G and Beyond
Zeng, Y., Wu, Q., & Zhang, R. (2019) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2952892 · Cited by 1,589
A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
Razaviyayn, M., Hong, M., & Luo, Z.-Q. (2013) · SIAM Journal on Optimization · doi:10.1137/120891009 · Cited by 1,304
Global Convergence of ADMM in Nonconvex Nonsmooth Optimization
Wang, Y., Yin, W., & Zeng, J. (2019) · Journal of Scientific Computing · doi:10.1007/s10915-018-0757-z · Cited by 1,268
Self-citationWeighted Sum-Rate Maximization for Reconfigurable Intelligent Surface Aided Wireless Networks
Guo, H., Liang, Y.-C., Chen, J., & Larsson, E. G. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.2970061 · Cited by 1,013
Problem formulations and solvers in linear SVM: a review
Chauhan, V. K., Dahiya, K., & Sharma, A. (2019) · Artificial Intelligence Review · doi:10.1007/s10462-018-9614-6 · Cited by 660
Metadata
- Authors
- Xu, Y., & Yin, W.
- Venue
- SIAM Journal on Imaging Sciences
- Published
- 2013-01
- Volume
- 6
- Issue
- 3
- Pages
- 1758-1789
- ISSN
- 1936-4954 (ISSN-L)
- OpenAlex
- W1968154520
- Cited by
- 1,160
- References
- 69
- FWCI
- 16.57
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.