Proximal Algorithms
The DOI matches its Crossref record; 180 of the 182 references it cites were found in a registry or an index.
Abstract
This monograph is about a class of optimization algorithms called proximal algorithms. Much like Newton’s method is a standard tool for solving unconstrained smooth optimization problems of modest size, proximal algorithms can be viewed as an analogous tool for nonsmooth, constrained, large-scale, or distributed versions of these problems. They are very generally applicable, but are especially well-suited to problems of substantial recent interest involving large or high-dimensional datasets. Proximal methods sit at a higher level of abstraction than classical algorithms like Newton’s method: the base operation is evaluating the proximal operator of a function, which itself involves solving a small convex optimization problem. These subproblems, which generalize the problem of projecting a point onto a convex set, often admit closed-form solutions or can be solved very quickly with standard or simple specialized methods. Here, we discuss the many different interpretations of proximal operators and algorithms, describe their connections to many other topics in optimization and applied mathematics, survey some popular algorithms, and provide a large number of examples of proximal operators that commonly arise in practice.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Self-citationRegression 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
An Algorithm for Least-Squares Estimation of Nonlinear Parameters
Marquardt, D. W. (1963) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0111030 · Cited by 30,728
Regularization and Variable Selection Via the Elastic Net
Zou, H., & Hastie, T. (2005) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00503.x · Cited by 20,957
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
Self-citation(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
Self-citationA method for the solution of certain non-linear problems in least squares
Levenberg, K. (1944) · Quarterly of Applied Mathematics · doi:10.1090/qam/10666 · Cited by 12,359
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
De-noising by soft-thresholding
Donoho, D. L. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.382009 · Cited by 9,619
Research works printed but not linked: 37
- Arrow, 1958, Studies in Linear and Nonlinear Programming
- Attouch, 1977, Convergence de fonctions convexes, de sous-différentiels et semi-groupes, C.R Acad. Sei. Paris, 284, 539
- Beck, 2010, Convex Optimization in Signal Processing and Communications, 42
- Bertsekas, 1999, Nonlinear Programming
- Bertsekas, 1989, Parallel and Distributed Computation: Numerical Methods
- Blackford, 1997, ScaLAPACK user’s guide, 10.1137/1.9780898719642 · DOI · Paper page
- Boyd, 2007, Localization and cutting-plane methods
- Candès, 2009, Robust principal component analysis?
- Chandrasekaran, 2009, Allerton 2009, 962
- Daniilidis, 2013, Orthogonal invariance and identifiability
- Demmel, 1993, Parallel numerical linear algebra, 10.1017/S096249290000235X · doi:10.1017/s096249290000235x
- Dempster, 1972, Covariance selection, Biometrics, 28, 157, 10.2307/2528966 · DOI · Paper page
- Duchi, 2008, Efficient projections onto the Q-ball for learning in high dimensions, 272
- Franklin, 1994, Feedback Control of Dynamic Systems, 10.1115/IMECE1994-0541 · doi:10.1115/imece1994-0541
- Gabay, 1983, Augmented Lagrangian Methods: Applications to the Solution of Boundary-Value Problems
- Goldfarb, 2011, Fast first-order methods for composite convex optimization with line search
- Granas, 2003, Fixed Point Theory, 10.1007/978-0-387-21593-8 · doi:10.1007/978-0-387-21593-8
- Lusem, 1999, Augmented Lagrangian methods and proximal point methods for convex optimization, Investigación Operativa, 8, 11
- Jenatton, 2010, Proximal methods for sparse hierarchical dictionary learning
- Kachurovskii, 1960, Monotone operators and convex functionals, Uspekhi Matematicheskikh Nauk, 15, 213
- Kim, 2009, ℓ1 trend filtering, SIAM Review, 51, 339, 10.1137/070690274 · DOI · Paper page
- Lemaire, 1989, The proximal algorithm, 73
- Ma, 2012, Alternating direction methods for latent variable gaussian graphical model selection
- Martinet, 1970, Régularisation d’inéquations variationnelles par approximations successives
- Martinet, 1972, Détermination approchée d’un point fixe d’une application pseudo-contractante, C.R. Acad. Sei. Paris, 274A, 163
- Nedic, 2010, Convex Optimization in Signal Processing and Communications
- Nesterov, 1983, A method of solving a convex programming problem with convergence rate O(1/k2), Soviet Mathematics Doklady, 27, 372
- Quattoni, 2009, An efficient projection for ℓ1,∞ regularization, 857
- Rockafellar, 1970, Convex Analysis, 10.1515/9781400873173 · DOI · Paper page
- Rockafellar, 1998, Variational Analysis, 10.1007/978-3-642-02431-3 · DOI · Paper page
- Tseng, 2008, On accelerated proximal gradient methods for convex-concave optimization
- Vandenberghe, 2010, Optimization methods for large-scale systems
- von Neumann, 1937, Some matrix inequalities and metrization of matrix space, Tomsk University Review, 1, 286
- von Neumann, Functional Operators, Volume 2: The Geometry of Orthogonal Spaces
- Yosida, 1968, Functional Analysis, 10.1007/978-3-662-11791-0 · doi:10.1007/978-3-662-11791-0
- Zarantonello, 1960, Solving functional equations by contractive averaging
- Zarantonello, 1971, Projections on convex sets in Hilbert space and spectral theory. I. Projections on convex sets, 237
Cited by
Items 301–400 of 1,007
Active Sensing of Social Networks
Wai, H.-T., Scaglione, A., & Leshem, A. (2016) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2016.2555785 · Cited by 76
Fixed Points of Generalized Approximate Message Passing With Arbitrary Matrices
Rangan, S., Schniter, P., Riegler, E., Fletcher, A. K., & Cevher, V. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2619365 · Cited by 91
Multi-task ranking SVM for image cosegmentation
Liang, X., Zhu, L., & Huang, D.-S. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.03.060 · Cited by 74
Line Detection as an Inverse Problem: Application to Lung Ultrasound Imaging
Anantrasirichai, N., Hayes, W. N., Allinovi, M., Bull, D., & Achim, A. (2017) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2017.2715880 · Cited by 73
Yang, H., Lin, H., & Ding, K. (2018) · Journal of Sound and Vibration · doi:10.1016/j.jsv.2018.01.051 · Cited by 68
Diffusion Normalized Least Mean M-estimate Algorithms: Design and Performance Analysis
Yu, Y., He, H., Yang, T., Wang, X., & de Lamare, R. C. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2983905 · Cited by 68
Rodosthenous, T., Shahrezaei, V., & Evangelou, M. (2020) · Bioinformatics · doi:10.1093/bioinformatics/btaa530 · Cited by 67
Edge Federated Learning via Unit-Modulus Over-The-Air Computation
Wang, S., Hong, Y., Wang, R., Hao, Q., Wu, Y., & Ng, D. W. K. (2022) · IEEE Transactions on Communications · doi:10.1109/tcomm.2022.3153488 · Cited by 71
First Order Algorithms in Variational Image Processing
Burger, M., Sawatzky, A., & Steidl, G. (2016) · Scientific computation · doi:10.1007/978-3-319-41589-5_10 · Cited by 75
Proximal Multitask Learning Over Networks With Sparsity-Inducing Coregularization
Nassif, R., Richard, C., Ferrari, A., & Sayed, A. H. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2601282 · Cited by 69
A Memristor-Based Optimization Framework for Artificial Intelligence Applications
Liu, S., Wang, Y., Fardad, M., & Varshney, P. K. (2018) · IEEE Circuits and Systems Magazine · doi:10.1109/mcas.2017.2785421 · Cited by 76
Inferring hidden structure in multilayered neural circuits
Maheswaranathan, N., Kastner, D. B., Baccus, S. A., & Ganguli, S. (2018) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1006291 · Cited by 68
Anderson Accelerated Douglas--Rachford Splitting
Fu, A., Zhang, J., & Boyd, S. (2020) · SIAM Journal on Scientific Computing · doi:10.1137/19m1290097 · Cited by 91
Self-citationPolarization Guided Specular Reflection Separation
Wen, S., Zheng, Y., & Lu, F. (2021) · IEEE Transactions on Image Processing · doi:10.1109/tip.2021.3104188 · Cited by 66
Motion-resolved, reference-free holographic imaging via spatiotemporally regularized inversion
Gao, Y., & Cao, L. (2023) · Optica · doi:10.1364/optica.506572 · Cited by 66
Douglas-rachford splitting: Complexity estimates and accelerated variants
Patrinos, P., Stella, L., & Bemporad, A. (2014) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2014.7040049 · Cited by 66
Memory-Efficient Learning for Large-Scale Computational Imaging
Kellman, M., Zhang, K., Markley, E., Tamir, J. I., Bostan, E., Lustig, M. S., & Waller, L. (2020) · IEEE Transactions on Computational Imaging · doi:10.1109/tci.2020.3025735 · Cited by 79
Dynamic Assortment Personalization in High Dimensions
Kallus, N., & Udell, M. R. (2020) · Operations Research · doi:10.1287/opre.2019.1948 · Cited by 91
Dirty Pixels: Towards End-to-end Image Processing and Perception
Diamond, S., Sitzmann, V., Julca-Aguilar, F., Boyd, S., Wetzstein, G., & Heide, F. (2021) · ACM Transactions on Graphics · doi:10.1145/3446918 · Cited by 143
Self-citationA Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization
Tran-Dinh, Q., Fercoq, O., & Cevher, V. (2018) · SIAM Journal on Optimization · doi:10.1137/16m1093094 · Cited by 97
Sparse Signal Recovery via Generalized Entropy Functions Minimization
Huang, S., & Tran, T. D. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2889951 · Cited by 71
Graph Signal Recovery via Primal-Dual Algorithms for Total Variation Minimization
Berger, P., Hannák, G., & Matz, G. (2017) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2017.2726978 · Cited by 81
Fast convolutional sparse coding using matrix inversion lemma
Šorel, M., & Šroubek, F. (2016) · Digital Signal Processing · doi:10.1016/j.dsp.2016.04.012 · Cited by 66
Energy Efficient Resource Allocation for Wireless Power Transfer Enabled Collaborative Mobile Clouds
Chang, Z., Gong, J., Li, Y., Zhou, Z., Ristaniemi, T., Shi, G., Han, Z., & Niu, Z. (2016) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2016.2611843 · Cited by 63
Matrix completion by least-square, low-rank, and sparse self-representations
Fan, J., & Chow, T. W. S. (2017) · Pattern Recognition · doi:10.1016/j.patcog.2017.05.013 · Cited by 64
Cooperative Activity Detection: Sourced and Unsourced Massive Random Access Paradigms
Shao, X., Chen, X.-M., Ng, D. W. K., Zhong, C., & Zhang, Z. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.3039342 · Cited by 69
Off-grid DOA estimation with nonconvex regularization via joint sparse representation
Liu, Q., So, H. C., & Gu, Y. (2017) · Signal Processing · doi:10.1016/j.sigpro.2017.05.020 · Cited by 64
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
Combining fast inertial dynamics for convex optimization with Tikhonov regularization
Attouch, H., Chbani, Z., & Riahi, H. (2016) · Journal of Mathematical Analysis and Applications · doi:10.1016/j.jmaa.2016.12.017 · Cited by 63
Zhao, P., Liu, S., Chen, P., Hoang, N., Xu, K., Kailkhura, B., & Lin, X. (2019) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00021 · Cited by 82
Provable Convergence of Plug-and-Play Priors With MMSE Denoisers
Xu, X., Sun, Y., Liu, J., Wohlberg, B. E., & Kamilov, U. S. (2020) · IEEE Signal Processing Letters · doi:10.1109/lsp.2020.3006390 · Cited by 101
Signal Recovery With Certain Involved Convex Data-Fidelity Constraints
Ono, S., & Yamada, I. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2472365 · Cited by 65
Sparse portfolio selection via the sorted ℓ1-Norm
Kremer, P. J., Lee, S., Bogdan, M., & Paterlini, S. (2019) · Journal of Banking & Finance · doi:10.1016/j.jbankfin.2019.105687 · Cited by 66
Gong, Y., Li, Z., Zhang, J., Liu, W., Zheng, Y., & Kirsch, C. (2018) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3269206.3271757 · Cited by 63
Deep Proximal Unrolling: Algorithmic Framework, Convergence Analysis and Applications
Liu, R., Cheng, S., Ma, L., Fan, X., & Luo, Z. (2019) · IEEE Transactions on Image Processing · doi:10.1109/tip.2019.2913536 · Cited by 78
Shared Causal Paths underlying Alzheimer’s dementia and Type 2 Diabetes
Hu, Z., Jiao, R., Wang, P., Zhu, Y., Zhao, J., Jager, P. L. D., Bennett, D. A., Li, J., & Xiong, M. (2020) · Scientific Reports · doi:10.1038/s41598-020-60682-3 · Cited by 69
Infeasibility Detection in the Alternating Direction Method of Multipliers for Convex Optimization
Banjac, G., Goulart, P. J., Stellato, B., & Boyd, S. (2019) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-019-01575-y · Cited by 62
Self-citationGPU acceleration of ADMM for large-scale quadratic programming
Schubiger, M., Banjac, G., & Lygeros, J. (2020) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2020.05.021 · Cited by 76
Local Linear Convergence of ISTA and FISTA on the LASSO Problem
Tao, S., Boley, D. L., & Zhang, S. (2016) · SIAM Journal on Optimization · doi:10.1137/151004549 · Cited by 62
Primal-Dual Decomposition by Operator Splitting and Applications to Image Deblurring
O'Connor, D., & Vandenberghe, L. (2014) · SIAM Journal on Imaging Sciences · doi:10.1137/13094671x · Cited by 78
Gibberd, A. J., & Nelson, J. D. B. (2017) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2017.1302340 · Cited by 83
A Variational Model for Joint Motion Estimation and Image Reconstruction
Burger, M., Dirks, H., & Schönlieb, C. (2018) · SIAM Journal on Imaging Sciences · doi:10.1137/16m1084183 · Cited by 72
Proximal extrapolated gradient methods for variational inequalities
Malitsky, Y. (2017) · Optimization methods & software · doi:10.1080/10556788.2017.1300899 · Cited by 72
General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
Wu, Z., & Li, M. (2019) · Computational Optimization and Applications · doi:10.1007/s10589-019-00073-1 · Cited by 62
A Realization of Fog-RAN Slicing via Deep Reinforcement Learning
Xiang, H., Yan, S., & Peng, M. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.2965927 · Cited by 67
Sparsity-promoting algorithms for the discovery of informative Koopman-invariant subspaces
Pan, S., Arnold-Medabalimi, N. A., & Duraisamy, K. (2021) · Journal of Fluid Mechanics · doi:10.1017/jfm.2021.271 · Cited by 76
Using Taylor Expansion and Convolutional Sparse Representation for Image Fusion
Xing, C., Wang, M., Dong, C., Duan, C., & Wang, Z. (2020) · Neurocomputing · doi:10.1016/j.neucom.2020.04.002 · Cited by 62
Deep Generative Adversarial Residual Convolutional Networks for Real-World Super-Resolution
Umer, R. M., Foresti, G. L., & Micheloni, C. (2020) · IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · doi:10.1109/cvprw50498.2020.00227 · Cited by 80
Liu, S., Chen, J., Chen, P., & Hero, A. O. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1710.07804 · Cited by 62
Adaptive Finite Blocklength for Ultra-Low Latency in Wireless Communications
Cheng, W., Xiao, Y., Zhang, S., & Wang, J. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2021.3130269 · Cited by 73
On the equivalence of the primal-dual hybrid gradient method and Douglas–Rachford splitting
O’Connor, D., & Vandenberghe, L. (2018) · Mathematical Programming · doi:10.1007/s10107-018-1321-1 · Cited by 92
Shape and Spatially-Varying Reflectance Estimation from Virtual Exemplars
Hui, Z., & Sankaranarayanan, A. C. (2016) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2016.2623613 · Cited by 61
A Brief Review of Image Denoising Algorithms and Beyond
Gu, S., & Timofte, R. (2019) · The Springer series on challenges in machine learning · doi:10.1007/978-3-030-25614-2_1 · Cited by 80
Model Predictive Convex Programming for Constrained Vehicle Guidance
Hong, H., Maity, A., Holzapfel, F., & Tang, S. (2019) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2018.2890375 · Cited by 60
Adversarial Algorithm Unrolling Network for Interpretable Mechanical Anomaly Detection
An, B., Wang, S., Qin, F., Zhao, Z., Yan, R., & Chen, X. (2023) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2023.3250664 · Cited by 68
Subspace clustering using a symmetric low-rank representation
Chen, J., Mao, H., Sang, Y., & Zhang, Y. (2017) · Knowledge-Based Systems · doi:10.1016/j.knosys.2017.02.031 · Cited by 60
ProxImaL: efficient image optimization using proximal algorithms
Heide, F., Diamond, S., Nießner, M., Ragan‐Kelley, J., Heidrich, W., & Wetzstein, G. (2016) · ACM Transactions on Graphics · doi:10.1145/2897824.2925875 · Cited by 77
Efficient Inexact Proximal Gradient Algorithm for Nonconvex Problems
Yao, Q., Kwok, J. T.-Y., Gao, F., Chen, W. R., & Liu, T. (2017) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/462 · Cited by 60
COSMO: A Conic Operator Splitting Method for Convex Conic Problems
Garstka, M., Cannon, M., & Goulart, P. J. (2021) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-021-01896-x · Cited by 137
Eckert, M.-L., Um, K., & Thuerey, N. (2019) · ACM Transactions on Graphics · doi:10.1145/3355089.3356545 · Cited by 98
Learning Gradient Descent: Better Generalization and Longer HorizonsPreprint
Lv, K., Jiang, S., & Li, J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.03633 · Cited by 68
Empirical Asset Pricing via Machine LearningPreprint
Gu, S., Kelly, B. T., & Xiu, D. (2018) · SSRN Electronic Journal · doi:10.2139/ssrn.3281018 · Cited by 101
Jiang, T., Shi, Y., Zhang, J., & Letaief, K. B. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2881486 · Cited by 60
“, gradient methods, proximal methods [31], alternating direction method of multipliers (ADMM) algorithm [32], fast ADMM algorithm [34] and Nesterov-type algorithms [35].”
MethodFault Sneaking Attack: a Stealthy Framework for Misleading Deep Neural Networks
Zhao, P., Wang, S., Gongye, C., Wang, Y., Fei, Y., & Lin, X. (2019) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/3316781.3317825 · Cited by 87
A multiple scattering algorithm for three dimensional phase contrast atomic electron tomography
Ren, D., Ophus, C., Chen, M., & Waller, L. (2019) · Ultramicroscopy · doi:10.1016/j.ultramic.2019.112860 · Cited by 59
Network classification with applications to brain connectomics
Relión, J. D. A., Kessler, D. A., Levina, E., & Taylor, S. F. (2019) · The Annals of Applied Statistics · doi:10.1214/19-aoas1252 · Cited by 86
Optimal Joint Remote Radio Head Selection and Beamforming Design for Limited Fronthaul C-RAN
Luong, P., Gagnon, F., Despins, C. L., & Tran, L. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2739102 · Cited by 67
Chen, Y., Li, X., & Zhang, S. (2019) · Journal of the American Statistical Association · doi:10.1080/01621459.2019.1635485 · Cited by 95
Exactly Robust Kernel Principal Component Analysis
Fan, J., & Chow, T. W. S. (2019) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2019.2909686 · Cited by 61
Distributed Control and Optimization for Autonomous Power Grids
Dörfler, F., Bolognani, S., Simpson-Porco, J. W., & Grammatico, S. (2019) · European Control Conference (ECC) · doi:10.23919/ecc.2019.8795974 · Cited by 58
Graphical-model based estimation and inference for differential privacyPreprint
McKenna, R., Sheldon, D. R., & Miklau, G. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.09136 · Cited by 171
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
d’Aspremont, A., Scieur, D., & Taylor, A. (2021) · Foundations and Trends® in Optimization · doi:10.1561/2400000036 · Cited by 86
A review of classical methods and Nature-Inspired Algorithms (NIAs) for optimization problems
Mandal, P. K. (2023) · Results in Control and Optimization · doi:10.1016/j.rico.2023.100315 · Cited by 61
Monotonicity and restart in fast gradient methods
Giselsson, P., & Boyd, S. (2014) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2014.7040179 · Cited by 57
Self-citationPatient Flow Prediction via Discriminative Learning of Mutually-Correcting Processes
Xu, H., Wu, W.-C., Nemati, S., & Zha, H. (2016) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2016.2618925 · Cited by 52
Gradient-Domain Image Reconstruction Framework with Intensity-Range and Base-Structure Constraints
Shibata, T., Tanaka, M., & Okutomi, M. (2016) · 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.2016.300 · Cited by 57
Multivariate nonlinear chirp mode decomposition
Chen, Q., Xie, L., & Su, H. (2020) · Signal Processing · doi:10.1016/j.sigpro.2020.107667 · Cited by 59
From differential equation solvers to accelerated first-order methods for convex optimization
Luo, H., & Chen, L. (2021) · Mathematical Programming · doi:10.1007/s10107-021-01713-3 · Cited by 58
Beyond Low Rank + Sparse: Multiscale Low Rank Matrix Decomposition
Ong, F., & Lustig, M. S. (2016) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2016.2545518 · Cited by 60
Differentially Private Federated Stochastic Primal-Dual Learning for Internet of Vehicles
Li, Y., Wang, S., & Chang, T. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3534982 · Cited by 68
Sparsity-Aware Sensor Collaboration for Linear Coherent Estimation
Liu, S., Kar, S., Fardad, M., & Varshney, P. K. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2413381 · Cited by 55
Cao, P., Shan, X., Zhao, D., Huang, M., & Zai͏̈ane, O. R. (2017) · Pattern Recognition · doi:10.1016/j.patcog.2017.07.018 · Cited by 55
Aljadaany, R., Pal, D. K., & Savvides, M. (2019) · 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.2019.01048 · Cited by 61
Image denoising via a new anisotropic total-variation-based model
Pang, Z., Zhou, Y., Wu, T., & Li, D.-J. (2019) · Signal Processing Image Communication · doi:10.1016/j.image.2019.02.003 · Cited by 58
Few Shot Network Compression via Cross Distillation
Bai, H., Wu, J., King, I., & Lyu, M. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i04.5718 · Cited by 50
Zhu, Y., Wen, G., Yu, W., & Yu, X. (2021) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2021.3070398 · Cited by 54
Chen, J., & Zhao, C. (2022) · Control Engineering Practice · doi:10.1016/j.conengprac.2022.105174 · Cited by 57
Li, Y., Lin, Q., Liu, Y., Ai, B., & Wu, Y. (2022) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2022.3211967 · Cited by 60
Hou, B., Zhou, K., & Jiao, L. (2017) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2017.2778191 · Cited by 55
Kankam, K., Pholasa, N., & Cholamjiak, P. (2019) · Mathematical Methods in the Applied Sciences · doi:10.1002/mma.5420 · Cited by 54
Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing
Shehu, Y., Iyiola, O. S., & Ogbuisi, F. U. (2019) · Numerical Algorithms · doi:10.1007/s11075-019-00727-5 · Cited by 54
Holographic 3D Particle Imaging With Model-Based Deep Network
Chen, N., Wang, C., & Heidrich, W. (2021) · IEEE Transactions on Computational Imaging · doi:10.1109/tci.2021.3063870 · Cited by 59
Block-Randomized Stochastic Proximal Gradient for Low-Rank Tensor Factorization
Fu, X., Ibrahim, S., Wai, H.-T., Gao, C., & Huang, K. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2982321 · Cited by 59
Structured microblog sentiment classification via social context regularization
Wu, F., Huang, Y., & Song, Y. (2015) · Neurocomputing · doi:10.1016/j.neucom.2015.10.101 · Cited by 55
Rangan, S., Fletcher, A. K., Schniter, P., & Kamilov, U. S. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2619373 · Cited by 68
Convolutional Sparse and Low-Rank Coding-Based Image Decomposition
Zhang, H., & Patel, V. M. (2017) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2786469 · Cited by 53
Kazantsev, D., Jørgensen, J. S., Andersen, M. S., Lionheart, W. R. B., Lee, P. D., & Withers, P. J. (2018) · Inverse Problems · doi:10.1088/1361-6420/aaba86 · Cited by 53
Inexact model: a framework for optimization and variational inequalities
Stonyakin, F. S., Tyurin, A., Gasnikov, A. V., Dvurechensky, P. E., Agafonov, A., Dvinskikh, D., Alkousa, M., Pasechnyuk, D. A., Artamonov, S., & Piskunova, V. (2021) · Optimization methods & software · doi:10.1080/10556788.2021.1924714 · Cited by 74
Feng, S., Ren, W., Han, M., & Chen, Y. (2019) · Neural Networks · doi:10.1016/j.neunet.2019.05.009 · Cited by 56
Metadata
- Authors
- Parikh, N., & Boyd, S.
- Affiliations
- Stanford University (US)
- Venue
- Foundations and Trends® in Optimization
- Publisher
- Emerald
- Published
- 2014-01-13
- Volume
- 1
- Issue
- 3
- Pages
- 127-239
- ISSN
- 2167-3888 (ISSN-L)
- 2167-3918
- OpenAlex
- W2913535645
- Cited by
- 4,102
- References
- 182
- Citations by year
- 2026: 204 · 2025: 310 · 2024: 331 · 2023: 321 · 2022: 312 · 2021: 432 · 2020: 443 · 2019: 460 · 2018: 407 · 2017: 315 · 2016: 278 · 2015: 189 · 2014: 85
- FWCI
- 299.06
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Foundations and Trends® in Optimization (publishedVersion)
- now publishers, Inc. eBooks (publishedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
- Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
- Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
- Keywords
- proximal operator, proximal algorithms, convex optimization, distributed optimization, nonsmooth optimization, large-scale optimization, high-dimensional data, projection onto convex sets, iterative 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.