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 701–800 of 1,002
Discovery of Evolving Semantics through Dynamic Word Embedding Learning.Preprint
Yao, Z., Sun, Y., Ding, W., Rao, N., & Xiong, H. (2017) · arXiv (Cornell University) · Cited by 7
Utility/Privacy Trade-off through the lens of Optimal TransportPreprint
Boursier, É., & Perchet, V. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.11148 · Cited by 11
Combining tensor decomposition and time warping models for multi-neuronal spike train analysisPreprint
Williams, A. H. (2020) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2020.03.02.974014 · Cited by 7
Recht-Ré Noncommutative Arithmetic-Geometric Mean Conjecture is FalsePreprint
Lai, Z., & Lim, L. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.01510 · Cited by 7
Random Coordinate Langevin Monte CarloPreprint
Ding, Z., Li, Q., Lu, J., & Wright, S. J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.01405 · Cited by 8
Self-citationSuccessive Projection for Solving Systems of Nonlinear Equations/InequalitiesPreprint
Zeng, W., & Ye, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.07555 · Cited by 7
Carreira-Perpiñán, M. Á., & Idelbayev, Y. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.04380 · Cited by 8
Dey, R., Coenen, A. R., Solonenko, N., Burris, M., Mackey, A. I., Galasso, J., Sun, C. L., Demory, D., Muratore, D., Beckett, S. J., et al. (2026) · The ISME Journal · doi:10.1093/ismejo/wrag041 · Cited by 6
Neshat, M. (2026) · International Conference on Artificial Intelligence, Computer, Data Sciences and Applications (ACDSA) · doi:10.1109/acdsa67686.2026.11468083 · Cited by 10
Integrated Narrowband Orthogonal Signal Set Design for MIMO DFRC System
Yao, X. L., Wang, Y. F., Pan, B., Yu, X., Cui, G., & Su, L. (2024) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2024.3401228 · Cited by 6
Fast Bayesian modal identification with known seismic excitations
Wang, P., Li, B., Zhang, F., Chen, X., & Ni, Y.-C. (2024) · Earthquake Engineering & Structural Dynamics · doi:10.1002/eqe.4181 · Cited by 6
Sparse feature selection and rare value prediction in imbalanced regression
Guan, Y., & Fu, G. (2024) · Information Sciences · doi:10.1016/j.ins.2024.121145 · Cited by 8
Hyperparameter Estimation for Sparse Bayesian Learning Models
Yu, F., Shen, L., & Song, G. (2024) · SIAM/ASA Journal on Uncertainty Quantification · doi:10.1137/24m162844x · Cited by 6
Joint Latency-Energy Minimization for Fog-Assisted Wireless IoT Networks
Shams, F., Lottici, V., & Tian, Z. (2024) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2024.3522256 · Cited by 6
Parallel splitting method for large-scale quadratic programs
Vandelli, M., Ferrari, F., & Dragoni, D. (2026) · Journal of Heuristics · doi:10.1007/s10732-026-09606-4 · Cited by 6
Absorbing state dynamics of stochastic gradient descent
Zhang, G., & Martiniani, S. (2026) · Physical review. E · doi:10.1103/sbv7-syp7 · Cited by 6
99% of Parallel Optimization is Inevitably a Waste of Time.
Mishchenko, K., Hanzely, F., & Richtárik, P. (2019) · Cited by 8
A Class of Linear Programs Solvable by Coordinate-Wise Minimization
Dlask, T., & Werner, T. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-53552-0_8 · Cited by 6
An Accelerated Coordinate Gradient Descent Algorithm for Non-separable Composite Optimization
Aberdam, A., & Beck, A. (2021) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-021-01957-1 · Cited by 6
Brick Yourself within 3 Minutes
Zhou, G., Luo, L., Xu, H., Zhang, X., Guo, H., & Zhao, H. (2022) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra46639.2022.9812161 · Cited by 6
A novel method for optimizing spectral rotation embedding K-means with coordinate descent
Chen, J., Zhu, J., Feng, B., Xie, S., Yang, H. X., & Nie, F. (2022) · Information Sciences · doi:10.1016/j.ins.2022.09.011 · Cited by 6
Self-Paced and Discrete Multiple Kernel k -Means
Lu, Y., Zheng, X., Lu, J., Wang, R., Nie, F., & Li, X. (2022) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3511808.3557696 · Cited by 6
Risk-averse optimization of reward-based coherent risk measures
Bonetti, M., Bisi, L., & Restelli, M. (2023) · Artificial Intelligence · doi:10.1016/j.artint.2022.103845 · Cited by 6
An Iterative Wiener Filter Based on a Fourth-Order Tensor Decomposition
Benesty, J., Paleologu, C., & Dogariu, L.-M. (2023) · Symmetry · doi:10.3390/sym15081560 · Cited by 6
Global stability of first-order methods for coercive tame functions
Josz, C., & Lai, L. (2023) · Mathematical Programming · doi:10.1007/s10107-023-02020-9 · Cited by 6
Jia, Z., Zhang, W., Cai, X., & Han, D. (2024) · Mathematics of Computation · doi:10.1090/mcom/3867 · Cited by 6
Sorted $$L_1/L_2$$ Minimization for Sparse Signal Recovery
Wang, C., Yan, M., & Yu, J. (2024) · Journal of Scientific Computing · doi:10.1007/s10915-024-02497-2 · Cited by 6
Parameter-Free Multiview K-Means Clustering With Coordinate Descent Method
Nie, F., Liu, H., Wang, R., & Li, X. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2024.3373532 · Cited by 6
Kanaun, S. (2024) · International Journal of Engineering Science · doi:10.1016/j.ijengsci.2024.104078 · Cited by 6
SoK: A Review of Differentially Private Linear Models For High-Dimensional Data
Khanna, A., Raff, E., & Inkawhich, N. (2024) · IEEE Conference on Secure and Trustworthy Machine Learning (SaTML) · doi:10.1109/satml59370.2024.00012 · Cited by 6
Matthews, Y., Holland, P., Matheson, F. E., Craggs, R. J., & Tanner, C. C. (2024) · Land · doi:10.3390/land13060748 · Cited by 6
Duan, Q., Shao, C., Zhou, G., Yang, H., Zhao, Q. G., & Shi, Y. (2024) · Applied Soft Computing · doi:10.1016/j.asoc.2024.112232 · Cited by 8
CCTV image‐based classification of blocked trash screens
Smith, R. C., Barnes, A. P., Wang, J., Dooley, S., Rowlatt, C., & Kjeldsen, T. (2024) · Journal of Flood Risk Management · doi:10.1111/jfr3.13038 · Cited by 6
Scalable network reconstruction in subquadratic time
Peixoto, T. P. (2025) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2025.0345 · Cited by 6
Learning to Race Through Coordinate Descent Bayesian Optimisation
Oliveira, R., Rocha, F. H. M., Ott, L., Guizilini, V., Ramos, F., & Grassi, V. (2018) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2018.8460735 · Cited by 6
Block layer decomposition schemes for training deep neural networks
Palagi, L., & Seccia, R. (2019) · Journal of Global Optimization · doi:10.1007/s10898-019-00856-0 · Cited by 6
Gu, Y., & Yamashita, N. (2021) · Computational and Applied Mathematics · doi:10.1007/s40314-021-01467-w · Cited by 6
EM-based identification of static errors-in-variables systems utilizing Gaussian Mixture models
Cedeño, A. L., Orellana, R., Carvajal, R., & Agüero, J. C. (2020) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2020.12.844 · Cited by 6
Zhang, Y., & Chen, Y. (2022) · Information and Inference A Journal of the IMA · doi:10.1093/imaiai/iaac005 · Cited by 6
Polarimetric FDA-MIMO Radar Detection
Rosamilia, M., Lan, L., Aubry, A., & Maio, A. D. (2022) · IEEE Radar Conference (RadarConf) · doi:10.1109/radarconf2248738.2022.9764223 · Cited by 6
Sparse Graph Learning with Spectrum Prior for Deep Graph Convolutional Networks
Zeng, J., Liu, Y., Cheung, G., & Hu, W. (2023) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp49357.2023.10095900 · Cited by 6
Greedy double subspaces coordinate descent method for solving linear least-squares problems
Jin, L.-L., & Li, H. (2023) · Journal of Computational Science · doi:10.1016/j.jocs.2023.102029 · Cited by 6
IDoser: Improving individualized dosing policies with clinical practice and machine learning
Correa, N., Cerquides, J., Vassena, R., Popovic, M., & Arcos, J. L. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.121796 · Cited by 6
TEA-RFFI: Temperature adjusted radio frequency fingerprint-based smartphone identification
Gu, X., Wu, W., Zhou, Y., Song, A., Yang, M., Ling, Z., & Luo, J. (2023) · Computer Networks · doi:10.1016/j.comnet.2023.110115 · Cited by 6
Optimization Methodology of Polar Direct-Drive Illumination for the National Ignition Facility
Barlow, D. E. M., Colaïtis, A., Viala, D., Rosenberg, M. J., Igumenshchev, I. V., Goncharov, V. N., Ceurvorst, L., Radha, P. B., Theobald, W., Craxton, R. S., et al. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.175101 · Cited by 6
Convergence Rate of Random Scan Coordinate Ascent Variational Inference Under Log-Concavity
Lavenant, H., & Zanella, G. (2024) · SIAM Journal on Optimization · doi:10.1137/24m1670627 · Cited by 6
Gräfen, M., Schweiger, G., Esen, C., & Ostendorf, A. (2017) · Journal of Aerosol Science · doi:10.1016/j.jaerosci.2017.12.003 · Cited by 6
Scalar Quantization as Sparse Least Square Optimization
Wang, C., Yang, X., Fei, S., Zhou, K., Gong, X., Du, M., & Luo, R. (2019) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2019.2952096 · Cited by 6
Tera-scale coordinate descent on GPUs
Parnell, T., Mendler-Dünner, C., Atasu, K., Sifalakis, M., & Pozidis, H. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2018.04.072 · Cited by 6
GLM+: An Efficient System for Generalized Linear Models
Yu, L., Wang, L., Shao, Y., Guo, L., & Cui, B. (2018) · IEEE International Conference on Big Data and Smart Computing (BigComp) · doi:10.1109/bigcomp.2018.00050 · Cited by 6
Optimal Power Allocation for Full-Duplex Communications over OFDMA Cellular Networks
Abrardo, A., & Moretti, M. (2018) · IEEE International Conference on Communications workshops · doi:10.1109/iccw.2018.8403646 · Cited by 6
Bregman reweighted alternating minimization and its application to image deblurring
Sun, T., Qiao, L., & Li, D. (2019) · Information Sciences · doi:10.1016/j.ins.2019.06.024 · Cited by 6
Metzner, C. (2019) · Scientific Reports · doi:10.1038/s41598-019-50514-4 · Cited by 6
Cui, Y., Sun, D., & Toh, K.-C. (2019) · SIAM Journal on Optimization · doi:10.1137/18m1175562 · Cited by 6
Treating Artificial Neural Net Training as a Nonsmooth Global Optimization Problem
Griewank, A., & Rojas, Á. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-37599-7_64 · Cited by 6
Statistical Computational Learning
Cornuéjols, A., Koriche, F., & Nock, R. (2020) · Springer eBooks · doi:10.1007/978-3-030-06164-7_11 · Cited by 6
Crossing Minimal Edge‐Constrained Layout Planning using Benders Decomposition
Sudermann‐Merx, N., Rebennack, S., & Timpe, C. (2021) · Production and Operations Management · doi:10.1111/poms.13441 · Cited by 6
A General Framework of Nonparametric Feature Selection in High-Dimensional Data
Yu, H., Wang, Y., & Zeng, D. (2022) · Biometrics · doi:10.1111/biom.13664 · Cited by 7
Randomized block coordinate descendant STRONG for large-scale Stochastic Optimization
Wang, W., Wan, H., & Chang, K.-H. (2016) · Winter Simulation Conference · doi:10.1109/wsc.2016.7822126 · Cited by 6
Quantifying the benefits of customized vaccination strategies: A network‐based optimization approach
Li, S., & Aprahamian, H. (2023) · Naval Research Logistics (NRL) · doi:10.1002/nav.22134 · Cited by 6
He, H., & Zhang, Z. (2024) · Journal of Scientific Computing · doi:10.1007/s10915-024-02715-x · Cited by 6
Residual-Based Detections and Unified Architecture for Massive MIMO Uplink
Zhang, C., Yang, Y., Zhang, S., Zhang, Z., & You, X. (2018) · Journal of Signal Processing Systems · doi:10.1007/s11265-018-1427-y · Cited by 6
Searching equillibriums in large transport networksPreprint
Gasnikov, A. V. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1607.03142 · Cited by 6
Linear convergence of SDCA in statistical estimationPreprint
Qu, C., & Xu, H. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.07808 · Cited by 6
Feature Selection With Optimal Coordinate Ascent (OCA)Preprint
Saltiel, D., & Benhamou, E. (2018) · SSRN Electronic Journal · doi:10.2139/ssrn.3293503 · Cited by 6
Probabilistic Count Matrix Factorization for Single Cell Expression Data AnalysisPreprint
Durif, G., Modolo, L., Mold, J. E., Lambert‐Lacroix, S., & Picard, F. (2017) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/211938 · Cited by 7
Fast Convolutive Nonnegative Matrix Factorization Through Coordinate and Block Coordinate UpdatesPreprint
Degleris, A., Antin, B., Ganguli, S., & Williams, A. H. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.00139 · Cited by 8
Anderson acceleration of coordinate descentPreprint
Bertrand, Q., & Massias, M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.10065 · Cited by 6
Fast block-coordinate Frank-Wolfe algorithm for semi-relaxed optimal transportPreprint
Fukunaga, T., & Kasai, H. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.05857 · Cited by 6
Efficient Convolutional Auto-Encoding via Random Convexification and Frequency-Domain MinimizationPreprint
Oveneke, M. C., Aliosha-Perez, M., Zhao, Y., Jiang, D., & Hichem Sahli, B. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.09232 · Cited by 6
COMQ: A Backpropagation-Free Algorithm for Post-Training Quantization
Zhang, A., Yang, Z., Wang, N., Qi, Y., Xin, J., Li, X., & Yin, P. (2024) · arXiv · doi:10.48550/arxiv.2403.07134 · Cited by 5
Fuzzy Min-Cut With Soft Balancing Effects
Chen, H., Zhang, R., Wang, R., & Nie, F. (2024) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2024.3491300 · Cited by 5
Fast and direct co-clustering via adaptive anchor graph learning
Nie, J., & Qiang, Q. (2025) · Information Sciences · doi:10.1016/j.ins.2025.122349 · Cited by 5
Clustering with dynamic bipartite graph learning
Liang, Y., Wang, G., Liang, Q., Zhong, C., & Nie, F. (2025) · Neurocomputing · doi:10.1016/j.neucom.2025.130615 · Cited by 5
Cheng, J. T., Kumar, K., & DeJong, M. J. (2025) · Computer-Aided Civil and Infrastructure Engineering · doi:10.1111/mice.70042 · Cited by 5
Efficient High-Dimensional Learning With Adaptive Gaussian RBF Networks
Gao, X., Xie, X., Wang, J., Ablameyko, S., & Pal, N. R. (2025) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2025.3601366 · Cited by 5
Modern Primal–Dual Frameworks for Prior-Free Online Resource Allocation
Niazadeh, R., & Udwani, R. (2026) · doi:10.1287/educ.2026.0304 · Cited by 5
Cao, K., Weinberg, D. H., Miranda, V., Dalal, N. P., Eifler, T. F., Xu, J., Bowden, H., Markovic, K., & PIT, R. H. C. (2026) · The Astrophysical Journal · doi:10.3847/1538-4357/ae9bc0 · Cited by 6
Long, N. V. D., Minh, L. Q., & Lee, M. (2017) · Process Safety and Environmental Protection · doi:10.1016/j.cherd.2017.11.020 · Cited by 5
Asynchronous Distributed Method of Multipliers for Constrained Nonconvex optimization
Farina, F., Garulli, A., Giannitrapani, A., & Notarstefano, G. (2018) · European Control Conference (ECC) · doi:10.23919/ecc.2018.8550098 · Cited by 6
Design and Analysis of Adaptive Sidelobe Blanking Architectures
Aubry, A., Maio, A. D., Maria, G. D., Farina, A., & Iommelli, S. (2020) · IEEE International Radar Conference · doi:10.1109/radar42522.2020.9114863 · Cited by 5
An Empirical Study of Language Model Integration for Transducer based Speech Recognition
Zheng, H., An, K., Ou, Z., Huang, C., Ding, K., & Wan, G. (2022) · Interspeech (USB) · doi:10.21437/interspeech.2022-10576 · Cited by 5
A Novel Semi-Supervised Learning Model for Smartphone-Based Health Telemonitoring
Gaw, N. B., Li, J., & Yoon, H. (2022) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2022.3218132 · Cited by 7
Variable selection for mixed panel count data under the proportional mean model
Ge, L., Liang, B., Hu, T., Sun, J., Zhao, S.-S., & Li, Y. (2023) · Statistical Methods in Medical Research · doi:10.1177/09622802231184637 · Cited by 3
Wang, J.-K. (2026) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-026-03123-x · Cited by 5
Incorporating Digital Footprints into Credit-Scoring Models through Model Averaging
Wang, L., Zhu, J., Zheng, C., & Zhang, Z. (2024) · Mathematics · doi:10.3390/math12182907 · Cited by 7
Bai, Z., & Chen, Y. (2025) · Numerical Linear Algebra with Applications · doi:10.1002/nla.70016 · Cited by 5
A Multi-Token Coordinate Descent Method for Semi-Decentralized Vertical Federated Learning
Valdeira, P., Chi, Y., Soares, C. J. R. S., & Xavier, J. (2026) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2026.3652487 · Cited by 6
Power Allocation Schemes for DAS With OFDM Under Per-Antenna Power Constraint
Yu, X., Xu, W., Leung, S. H., Dang, X., & Teng, T. (2018) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2018.2861773 · Cited by 5
Lu, Y., Xu, S., Zhang, Y., Wu, Q., & Chen, Z. (2019) · IEEE Access · doi:10.1109/access.2019.2953065 · Cited by 5
99% of Worker-Master Communication in Distributed Optimization Is Not Needed.
Mishchenko, K., Hanzely, F., & Richtárik, P. (2020) · King Abdullah University of Science and Technology Repository (King Abdullah University of Science and Technology) · Cited by 18
Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem
Hribar, R., Hrga, T., Papa, G., Petelin, G., Povh, J., Pržulj, N., & Vukašinović, V. (2021) · Journal of Global Optimization · doi:10.1007/s10898-021-01074-3 · Cited by 5
Constant Beamwidth Receiving Beamforming Based on Template Matching
Liu, R., Cui, G., Lu, Q., Yu, X., Feng, L., & Zhu, J. (2021) · IEEE Radar Conference (RadarConf) · doi:10.1109/radarconf2147009.2021.9455192 · Cited by 5
Toward real-time image annotation using marginalized coupled dictionary learning
Roostaiyan, S. M., Hosseini, M. M., Kashani, M. M., & Amiri, S. H. (2022) · Journal of Real-Time Image Processing · doi:10.1007/s11554-022-01210-6 · Cited by 5
Systematic errors in the perception of rhythm
Mansuri, J., Aleem, H., & Grzywacz, N. M. (2022) · Frontiers in Human Neuroscience · doi:10.3389/fnhum.2022.1009219 · Cited by 7
Li, J., Usevich, K., & Comon, P. (2023) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/21m1456972 · Cited by 5
Accelerated Doubly Stochastic Gradient Algorithm for Large-scale Empirical Risk Minimization
Shen, Z., Qian, H., Mu, T., & Zhang, C. (2017) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/378 · Cited by 5
Probabilistic Time Context Framework for Big Data Collaborative Recommendation
Aboagye, E. O., James, G. C., Jianbin, G., Kumar, R., & Khan, R. U. (2018) · International Conference on Computing and Artificial Intelligence (ICCAI) · doi:10.1145/3194452.3194458 · Cited by 5
Optimal designs for dose–response models with linear effects of covariates
Yu, J. Y., Kong, X., Ai, M., & Tsui, K. (2018) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2018.05.017 · Cited by 5
Scalable Dynamic Task Scheduling on Adaptive Many-Core
Venkataramani, V., Pathania, A., Shafique, M., Mitra, T., & Henkel, J. (2018) · IEEE International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC) · doi:10.1109/mcsoc2018.2018.00037 · Cited by 5
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.