Coordinate descent algorithms
The DOI matches its Crossref record; 59 of the 63 references it cites were found in a registry or an index.
Abstract
Coordinate descent algorithms solve optimization problems by successively performing approximate minimization along coordinate directions or coordinate hyperplanes. They have been used in applications for many years, and their popularity continues to grow because of their usefulness in data analysis, machine learning, and other areas of current interest. This paper describes the fundamentals of the coordinate descent approach, together with variants and extensions and their convergence properties, mostly with reference to convex objectives. We pay particular attention to a certain problem structure that arises frequently in machine learning applications, showing that efficient implementations of accelerated coordinate descent algorithms are possible for problems of this type. We also present some parallel variants and discuss their convergence properties under several models of parallel execution.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“The model parameter partitioned edge learning approach [72] proposed to train only a block of model parameters based on the coordinate decent method for the decomposable ML models [154] or the alternating minimization approach for the general DL models [155].”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [154]
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
Regularization Paths for Generalized Linear Models via Coordinate Descent
Friedman, J., Hastie, T., & Tibshirani, R. (2010) · Journal of Statistical Software · doi:10.18637/jss.v033.i01 · Cited by 19,927
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
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
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
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
Sparse inverse covariance estimation with the graphical lasso
Friedman, J., Hastie, T., & Tibshirani, R. (2008) · Biostatistics · doi:10.1093/biostatistics/kxm045 · Cited by 6,355
Advances in kernel methods: support vector learning
Schölkopf, B., Burges, C. J. C., & Smola, A. J. (1999) · doi:10.5555/299094 · Cited by 5,789
Research works printed but not linked: 5
- Bradley, J.K., Kyrola, A., Bickson, D., Guestrin, C.: Parallel coordunate descent for $$\ell _1$$ ℓ 1 -regularized loss minimization. In: Proceedings of the 28 International Conference on Machine Learning (ICML 2011) (2011)
- Kaczmarz, S.: Angenäherte auflösung von systemen linearer gleichungen. Bulletin International de l’Academie Polonaise des Sciences et des Lettres 35, 355–357 (1937)
- Lin, Q., Lu, Z., Xiao, L.: An accelerated proximal coordinate gradient method and its application to empirical risk minimization. Technical Report, Microsoft Research (2014). arXiv:1407.1296 · arXiv
- Liu, J., Wright, S.J., Ré, C., Bittorf, V., Sridhar, S.: An asynchronous parallel stochastic coordinate descent algorithm. Technical Report, Computer Sciences Department, University of Wisconsin-Madison (2013). (To appear in Journal of Machine Learning Research). arXiv:1311.1873 · arXiv
- Nesterov, Y.: A method for unconstrained convex problem with the rate of convergence $$O(1/k^2)$$ O ( 1 / k 2 ) . Doklady AN SSSR 269, 543–547 (1983)
Cited by
Items 101–200 of 1,002
Finite element model updating using deterministic optimisation: A global pattern search approach
Hofmeister, B., Bruns, M., & Rolfes, R. (2019) · Engineering Structures · doi:10.1016/j.engstruct.2019.05.047 · Cited by 68
Coordinate descent with arbitrary sampling II: expected separable overapproximation
Qu, Z., & Richtárik, P. (2016) · Optimization methods & software · doi:10.1080/10556788.2016.1190361 · Cited by 80
Bagherian, M. A., Mehranzamir, K., Pour, A. B., Rezania, S., Taghavi, E., Afrouzi, H. N., Dalvi‐Esfahani, M., & Alizadeh, S. M. (2021) · Processes · doi:10.3390/pr9020339 · Cited by 66
Xie, Z., Xu, X., Walker, M., Knebel, J., Palaniswamy, K., Hébert, N., Hu, J., Yang, H., Chen, Y., & Das, S. (2021) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/3466752.3480064 · Cited by 66
Yue, K., Deng, J., & Zhou, F. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-58555-6_19 · Cited by 73
A stochastic subspace approach to gradient-free optimization in high dimensions
Kozak, D., Becker, S., Doostan, A., & Tenorio, L. (2021) · Computational Optimization and Applications · doi:10.1007/s10589-021-00271-w · Cited by 82
Compressive sensing adaptation for polynomial chaos expansions
Tsilifis, P., Huan, X., Safta, C., Sargsyan, K., Lacaze, G., Oefelein, J. C., Najm, H. N., & Ghanem, R. (2019) · Journal of Computational Physics · doi:10.1016/j.jcp.2018.12.010 · Cited by 67
Stochastic Dual Coordinate Ascent with Adaptive Probabilities
Csiba, D., Qu, Z., & Richtárik, P. (2015) · Edinburgh Research Explorer (University of Edinburgh) · doi:10.48550/arxiv.1502.08053 · Cited by 75
Joint Parameter-and-Bandwidth Allocation for Improving the Efficiency of Partitioned Edge Learning
Wen, D., Bennis, M., & Huang, K. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.3021177 · Cited by 64
Retrieving Complex Tables with Multi-Granular Graph Representation Learning
Wang, F., Sun, K., Chen, M., Pujara, J., & Szekely, P. A. (2021) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3404835.3462909 · Cited by 80
Unsupervised Nonlinear Spectral Unmixing Based on a Multilinear Mixing Model
Wei, Q., Chen, M., Tourneret, J., & Godsill, S. (2017) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2017.2693366 · Cited by 64
A Low Complexity Data Detection Algorithm for Uplink Multiuser Massive MIMO Systems
Chen, J.-C. (2017) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2017.2710878 · Cited by 67
Raies, A. B., & Bajić, V. B. (2017) · Wiley Interdisciplinary Reviews Computational Molecular Science · doi:10.1002/wcms.1352 · Cited by 66
Quadratically Regularized Optimal Transport
Lorenz, D. A., Manns, P., & Meyer, C. (2019) · Applied Mathematics & Optimization · doi:10.1007/s00245-019-09614-w · Cited by 61
Online learning with adversarial delays
Quanrud, K., & Khashabi, D. (2015) · neural information processing systems · Cited by 129
Chen, C., Li, M., Liu, X., & Ye, Y. (2017) · Mathematical Programming · doi:10.1007/s10107-017-1205-9 · Cited by 61
Which is the best PID variant for pneumatic soft robots an experimental study
Khan, A. H., Shao, Z., Li, S., Wang, Q., & Guan, N. (2020) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2020.1003045 · Cited by 61
Scaling attributed network embedding to massive graphs
Yang, R., Shi, J., Xiao, X., Yang, Y., Liu, J., & Bhowmick, S. S. (2020) · Proceedings of the VLDB Endowment · doi:10.14778/3421424.3421430 · Cited by 73
Real-Time Video Inference on Edge Devices via Adaptive Model Streaming
Khani, M., Hamadanian, P., Nasr-Esfahany, A., & Alizadeh, M. (2021) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv48922.2021.00453 · Cited by 83
Fast Dynamic Routing Based on Weighted Kernel Density Estimation
Zhang, S., Zhou, Q., & Wu, X. (2019) · Studies in computational intelligence · doi:10.1007/978-3-030-04946-1_30 · Cited by 66
Discrete and Parameter-Free Multiple Kernel k -Means
Wang, R., Lu, J., Lu, Y., Nie, F., & Li, X. (2022) · IEEE Transactions on Image Processing · doi:10.1109/tip.2022.3141612 · Cited by 59
Wang, S., Arroyo, J., Vogelstein, J. T., & Priebe, C. E. (2019) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2019.2948619 · Cited by 74
Xu, J., Cao, X., & Hu, P. (2019) · The Journal of Physical Chemistry C · doi:10.1021/acs.jpcc.9b08939 · Cited by 59
Weighted Bayesian bootstrap for scalable posterior distributions
Newton, M. A., Polson, N. G., & Xu, J. (2020) · Canadian Journal of Statistics · doi:10.1002/cjs.11570 · Cited by 57
Design of Constant Modulus Discrete Phase Radar Waveforms Subject to Multi-Spectral Constraints
Yang, J., Aubry, A., Maio, A. D., Yu, X., & Cui, G. (2020) · IEEE Signal Processing Letters · doi:10.1109/lsp.2020.2991357 · Cited by 57
Efficient and Non-Convex Coordinate Descent for Symmetric Nonnegative Matrix Factorization
Vandaele, A., Gillis, N., Lei, Q., Zhong, K., & Dhillon, I. S. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2591510 · Cited by 56
Stochastic Gradient Descent: Recent Trends
Newton, D. T., Yousefian, F., & Pasupathy, R. (2018) · doi:10.1287/educ.2018.0191 · Cited by 68
Enabling Ubiquitous WiFi Sensing with Beamforming Reports
Wu, C., Huang, X., Huang, J., & Xing, G. (2023) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/3603269.3604817 · Cited by 67
Query-aware sparse coding for web multi-video summarization
Ji, Z., Ma, Y., Pang, Y., & Li, X. (2018) · Information Sciences · doi:10.1016/j.ins.2018.09.050 · Cited by 55
Integration of single-cell multi-omics for gene regulatory network inference
Hu, X., Hu, Y., Wu, F., Leung, R. W. T., & Qin, J. (2020) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2020.06.033 · Cited by 63
Randomized Gradient Boosting Machine
Lu, H., & Mazumder, R. (2020) · SIAM Journal on Optimization · doi:10.1137/18m1223277 · Cited by 67
A bi-objective k -nearest-neighbors-based imputation method for multilevel data
Cubillos, M., Wøhlk, S., & Wulff, J. N. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.117298 · Cited by 57
On computing the distance to stability for matrices using linear dissipative Hamiltonian systems
Gillis, N., & Sharma, P. (2017) · Automatica · doi:10.1016/j.automatica.2017.07.047 · Cited by 54
Randomized nonnegative matrix factorization
Erichson, N. B., Mendible, A., Wihlborn, S., & Kutz, J. N. (2018) · Pattern Recognition Letters · doi:10.1016/j.patrec.2018.01.007 · Cited by 58
Joint Learning of Deep Retrieval Model and Product Quantization based Embedding Index
Zhang, H., Shen, H., Qiu, Y., Jiang, Y., Wang, S., Xu, S., Xiao, Y., Long, B., & Yang, W.-Y. (2021) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3404835.3462988 · Cited by 64
Ang, A. M. S., & Gillis, N. (2019) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2019.2925098 · Cited by 53
Ghojogh, B., Ghodsi, A., Karray, F. O., & Crowley, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.01858 · Cited by 76
Introduction to Nonsmooth Analysis and Optimization
Clason, C., & Valkonen, T. (2026) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611978995 · Cited by 55
Weakly-supervised Relation Extraction by Pattern-enhanced Embedding Learning
Qu, M., Ren, X., Zhang, Y., & Han, J. (2018) · International World Wide Web Conference (WWW) · doi:10.1145/3178876.3186024 · Cited by 66
Asynchronous parallel algorithms for nonconvex optimization
Cannelli, L., Facchinei, F., Kungurtsev, V., & Scutari, G. (2019) · Mathematical Programming · doi:10.1007/s10107-019-01408-w · Cited by 61
Oracle AutoML: a fast and predictive AutoML pipeline
Yakovlev, A., Moghadam, H. F., Moharrer, A., Cai, J., Chavoshi, N., Varadarajan, V., Agrawal, S. R., Idicula, S., Karnagel, T., Jinturkar, S., et al. (2020) · Proceedings of the VLDB Endowment · doi:10.14778/3415478.3415542 · Cited by 64
Acceleration of Primal–Dual Methods by Preconditioning and Simple Subproblem Procedures
Liu, Y., Xu, Y., & Yin, W. (2021) · Journal of Scientific Computing · doi:10.1007/s10915-020-01371-1 · Cited by 74
Shortest Dubins paths through three points
Chen, Z., & Shima, T. Y. (2019) · Automatica · doi:10.1016/j.automatica.2019.04.007 · Cited by 51
Scalable subspace methods for derivative-free nonlinear least-squares optimization
Cartis, C., & Roberts, L. (2022) · Mathematical Programming · doi:10.1007/s10107-022-01836-1 · Cited by 80
Multi-sensor control for multi-object Bayes filters
Wang, X., Hoseinnezhad, R., Gostar, A. K., Rathnayake, T., Xu, B., & Bab‐Hadiashar, A. (2017) · Signal Processing · doi:10.1016/j.sigpro.2017.07.031 · Cited by 56
Unified Analysis of Stochastic Gradient Methods for Composite Convex and Smooth Optimization
Khaled, A., Sebbouh, O., Loizou, N., Gower, R. M., & Richtárik, P. (2023) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-023-02297-y · Cited by 49
Liao, Z.-M., Zhao, Z., Chen, L.-B., Wan, Z., Liu, N., & Lu, X. (2023) · Journal of Fluid Mechanics · doi:10.1017/jfm.2023.435 · Cited by 54
Multi-Marginal Optimal Transport and Probabilistic Graphical Models
Haasler, I., Singh, R., Zhang, Q., Karlsson, J., & Chen, Y. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3077465 · Cited by 63
High Dimensional Quantum Machine Learning With Small Quantum Computers
Marshall, S. C., Gyurik, C., & Dunjko, V. (2023) · Quantum · doi:10.22331/q-2023-08-09-1078 · Cited by 61
Hierarchical Personalized Federated Learning Over Massive Mobile Edge Computing Networks
You, C., Guo, K., Yang, H. H., & Quek, T. Q. S. (2023) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2023.3260141 · Cited by 50
Block coordinate descent energy minimization for dynamic cohesive fracture
Hirmand, M. R., & Papoulia, K. D. (2019) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2019.05.051 · Cited by 47
Machine Learning Optimization Algorithms & Portfolio Allocation
Perrin, S., & Roncalli, T. (2020) · Wiley eBooks · doi:10.1002/9781119751182.ch8 · Cited by 47
Zhou, S., Liu, S., Kang, Y., Cai, J., Xie, H., & Zhang, Q. (2022) · Advanced Engineering Informatics · doi:10.1016/j.aei.2022.101642 · Cited by 47
Yuan, Y., Li, S., Liu, R., Yang, L., & Gao, Z. (2023) · Transportation Research Part C Emerging Technologies · doi:10.1016/j.trc.2023.104393 · Cited by 47
A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching
Swoboda, P., Rother, C., Alhaija, H. A., Kainmueller, D., & Savchynskyy, B. (2017) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2017.747 · Cited by 46
Rubio, F. J., Rachet, B., Giorgi, R., Maringe, C., & Belot, A. (2019) · Biostatistics · doi:10.1093/biostatistics/kxz017 · Cited by 53
Revealing hidden dynamics from time-series data by ODENet
Hu, P., Yang, W., Zhu, Y., & Hong, L. (2022) · Journal of Computational Physics · doi:10.1016/j.jcp.2022.111203 · Cited by 50
Adaptive Target Detection With Polarimetric FDA-MIMO Radar
Lan, L., Rosamilia, M., Aubry, A., Maio, A. D., Liao, G., & Xu, J. (2022) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2022.3210887 · Cited by 45
Second-order Stencil Descent for Interior-point Hyperelasticity
Lan, L., Li, M., Jiang, C., Wang, H., & Yang, Y. (2023) · ACM Transactions on Graphics · doi:10.1145/3592104 · Cited by 47
Worst-case complexity of cyclic coordinate descent: $$O(n^2)$$ gap with randomized version
Sun, R., & Ye, Y. (2019) · Mathematical Programming · doi:10.1007/s10107-019-01437-5 · Cited by 72
Sampling Algorithms, from Survey Sampling to Monte Carlo Methods: Tutorial and Literature ReviewPreprint
Ghojogh, B., Nekoei, H., Ghojogh, A., Karray, F. O., & Crowley, M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.00901 · Cited by 52
EBMGC-GNF: Efficient Balanced Multi-View Graph Clustering via Good Neighbor Fusion
Wu, D., Yang, Z., Lu, J., Xu, J., Xu, X., & Nie, F. (2024) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2024.3398220 · Cited by 44
Non-negative matrix factorization algorithms generally improve topic model fits
Carbonetto, P. S., Sarkar, A., Wang, Z., & Stephens, M. (2026) · Statistics and Computing · doi:10.1007/s11222-026-10866-0 · Cited by 47
Efficient first-order methods for convex minimization: a constructive approach
Drori, Y., & Taylor, A. (2019) · Mathematical Programming · doi:10.1007/s10107-019-01410-2 · Cited by 44
Coordinate Descent Full Configuration Interaction
Wang, Z., Li, Y., & Lu, J. (2019) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.9b00138 · Cited by 55
Selected Mathematical Optimization Methods for Solving Problems of Engineering Practice
Vagaská, A., Gombár, M., & Straka, Ľ. (2022) · Energies · doi:10.3390/en15062205 · Cited by 44
Online Robust Low-Rank Tensor Modeling for Streaming Data Analysis
Li, P., Feng, J., Jin, X., Zhang, L., Xu, X., & Yan, S. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2018.2860964 · Cited by 43
Online Structured Sparsity-Based Moving-Object Detection From Satellite Videos
Zhang, J., Jia, X., Hu, J., & Chanussot, J. (2020) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2020.2976855 · Cited by 43
Information-theoretic waveform design for MIMO radar detection in range-spread clutter
Tang, B., & Stoica, P. (2020) · Signal Processing · doi:10.1016/j.sigpro.2020.107961 · Cited by 43
Nutini, J., Sepehry, B., Laradji, I., Schmidt, M., Koepke, H., & Virani, A. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1612.07838 · Cited by 43
Distributed Asynchronous Optimization with Unbounded Delays: How Slow Can You Go?
Zhou, Z., Mertikopoulos, P., Bambos, N., Glynn, P. W., Ye, Y., Li, L.-J., & Fei-Fei, L. (2018) · HAL · Cited by 61
Alternating Minimization Algorithms for One-Bit Precoding in Massive Multiuser MIMO Systems
Chen, J.-C. (2018) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2018.2836335 · Cited by 43
A Model for Joint Probabilistic Forecast of Solar Photovoltaic Power and Outdoor Temperature
Ramakrishna, R., Scaglione, A., Vittal, V., Dall’Anese, E., & Bernstein, A. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2954973 · Cited by 42
Intelligent Reflecting Surface (IRS)-Enhanced Cognitive Radio System
Yuan, J., Liang, Y., Joung, J., Feng, G., & Larsson, E. G. (2020) · International Conference on Communications · doi:10.1109/icc40277.2020.9148890 · Cited by 42
Block-Sparse Signal Recovery via General Total Variation Regularized Sparse Bayesian Learning
Sant, A., Leinonen, M., & Rao, B. D. (2022) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2022.3144948 · Cited by 41
Shape Synthesis Based on Topology Sensitivity
Čapek, M., Jelínek, L., & Gustafsson, M. (2019) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2019.2902749 · Cited by 41
scBatch: batch-effect correction of RNA-seq data through sample distance matrix adjustment
Fei, T., & Yu, T. (2020) · Bioinformatics · doi:10.1093/bioinformatics/btaa097 · Cited by 42
A new EM algorithm for flexibly tied GMMs with large number of components
Asheri, H., Hosseini, R., & Araabi, B. N. (2021) · Pattern Recognition · doi:10.1016/j.patcog.2021.107836 · Cited by 41
Large Scale Kernel Learning using Block Coordinate DescentPreprint
Tu, S., Roelofs, R., Venkataraman, S., & Recht, B. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.05310 · Cited by 45
Stochastic, Distributed and Federated Optimization for Machine LearningPreprint
Konečný, J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1707.01155 · Cited by 44
PANE: scalable and effective attributed network embedding
Yang, R., Shi, J. Y., Xiao, X., Yang, Y., Bhowmick, S. S., & Liu, J. (2023) · The VLDB Journal · doi:10.1007/s00778-023-00790-4 · Cited by 60
A novel optimization method: wave search algorithm
Zhang, H., San, H., Sun, H., Ding, L., & Wu, X. (2024) · The Journal of Supercomputing · doi:10.1007/s11227-024-06078-w · Cited by 40
Training dynamically balanced excitatory-inhibitory networks
Ingrosso, A., & Abbott, L. F. (2019) · PLoS ONE · doi:10.1371/journal.pone.0220547 · Cited by 47
Free floating electric car sharing design: Data driven optimisation
Cocca, M., Giordano, D., Mellia, M., & Vassio, L. (2019) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2019.02.007 · Cited by 40
Loizou, N., & Richtárik, P. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3113285 · Cited by 48
Nakamoto, T., Takahashi, W., Haga, A., Takahashi, S., Kiryu, S., Nawa, K., Ohta, T., Ozaki, S., Nozawa, Y., Tanaka, S., et al. (2019) · Scientific Reports · doi:10.1038/s41598-019-55922-0 · Cited by 42
Optimized packing multidimensional hyperspheres: a unified approach
Stoyan, Y. G., Yaskov, G., Romanova, Т., Litvinchev, I. S., Yakovlev, S., & Cantú, J. M. V. (2020) · Mathematical Biosciences & Engineering · doi:10.3934/mbe.2020344 · Cited by 40
A weighted linear discriminant analysis framework for multi-label feature extraction
Xu, J. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.05.008 · Cited by 40
Yang, Y., Pesavento, M., Chatzinotas, S., & Ottersten, B. (2018) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2018.2877584 · Cited by 40
FPGA design of a coordinate descent data detector for large-scale MU-MIMO
Wu, M., Dick, C., Cavallaro, J. R., & Studer, C. (2016) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2016.7538942 · Cited by 39
Coercing machine learning to output physically accurate results
Geng, Z., Johnson, D., & Fedkiw, R. P. (2019) · Journal of Computational Physics · doi:10.1016/j.jcp.2019.109099 · Cited by 39
Crowdsourcing human common sense for quantum control
Jensen, J. H. M., Gajdacz, M., Ahmed, S. Z., Czarkowski, J. H., Weidner, C. A., Rafner, J. F., Sørensen, J. J., Mølmer, K., & Sherson, J. F. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013057 · Cited by 44
Integrated optimization algorithm: A metaheuristic approach for complicated optimization
Li, C., Chen, G., Liang, G., Luo, F., Zhao, J., & Dong, Z. Y. (2021) · Information Sciences · doi:10.1016/j.ins.2021.11.043 · Cited by 39
Fully Decentralized Joint Learning of Personalized Models and Collaboration Graphs
Zantedeschi, V., Bellet, A., & Tommasi, M. (2019) · arXiv · doi:10.48550/arxiv.1901.08460 · Cited by 38
“We then build upon the PCD analysis due to Wright (2015), which we adapt to account for our overlapping block structure.”
BackgroundMethodSu, Y.-S., Lin, Y., & Liu, T.-Q. (2022) · Frontiers in Neuroscience · doi:10.3389/fnins.2022.1018005 · Cited by 38
Random permutations fix a worst case for cyclic coordinate descent
Lee, C.-P., & Wright, S. J. (2018) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/dry040 · Cited by 38
Self-citationYousefian, F., Nedić, A., & Shanbhag, U. V. (2018) · Set-Valued and Variational Analysis · doi:10.1007/s11228-018-0472-9 · Cited by 46
Cognitive Radar Waveform Design and Prototype for Coexistence With Communications
Alaee–Kerahroodi, M., Raei, E., Kumar, S., & R., B. S. M. (2022) · IEEE Sensors Journal · doi:10.1109/jsen.2022.3163548 · Cited by 38
Testing and Non-linear Preconditioning of the Proximal Point Method
Valkonen, T. (2018) · Applied Mathematics & Optimization · doi:10.1007/s00245-018-9541-6 · Cited by 39
A Balanced and Scalable Graph-Based Multiview Clustering Method
Zhao, Z., Nie, F., Wang, R., Wang, Z., & Li, X. (2024) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2024.3443534 · Cited by 37
Metadata
- Authors
- Wright, S. J.
- Affiliations
- University of Wisconsin–Madison (US)
- Corresponding author
- Wright, Stephen J.
- ORCID
- Wright, Stephen J.
- Venue
- Mathematical Programming
- Published
- 2015-03-25
- Volume
- 151
- Issue
- 1
- Pages
- 3-34
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2000769684
- Cited by
- 1,438
- References
- 63
- Citations by year
- 2026: 116 · 2025: 130 · 2024: 136 · 2023: 125 · 2022: 141 · 2021: 178 · 2020: 174 · 2019: 156 · 2018: 125 · 2017: 94 · 2016: 50 · 2015: 10
- FWCI
- 91.18
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Mathematical Programming (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
- Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
- Keywords
- coordinate descent, convex optimization, convergence analysis, parallel coordinate descent, machine learning optimization
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.