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 701–800 of 1,007
Decentralized Resource Allocation via Dual Consensus ADMM
Banjac, G., Rey, F., Goulart, P. J., & Lygeros, J. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8814988 · Cited by 39
RMTL: an R library for multi-task learning
Cao, H., Zhou, J., & Schwarz, E. (2018) · Bioinformatics · doi:10.1093/bioinformatics/bty831 · Cited by 31
Phase Compensation and Image Autofocusing for Randomized Stepped Frequency ISAR
Wang, L., Huang, T., & Liu, Y. (2019) · IEEE Sensors Journal · doi:10.1109/jsen.2019.2897014 · Cited by 31
Local 3D Point Cloud Denoising via Bipartite Graph Approximation & Total Variation
Dinesh, C., Cheung, G., Bajić, I. V., & Yang, C. (2018) · IEEE International Workshop on Multimedia Signal Processing (MMSP) · doi:10.1109/mmsp.2018.8547067 · Cited by 35
Towards Improving Robustness of Deep Neural Networks to Adversarial Perturbations
Amini, S., & Ghaemmaghami, S. (2020) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2020.2969784 · Cited by 32
Fast Algorithms for Joint Multicast Beamforming and Antenna Selection in Massive MIMO
Ibrahim, M. S., Konar, A., & Sidiropoulos, N. D. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2979545 · Cited by 31
Finite-Alphabet MMSE Equalization for All-Digital Massive MU-MIMO mmWave Communication
Castañeda, O., Jacobsson, S., Durisi, G., Goldstein, T., & Studer, C. (2020) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.3000840 · Cited by 31
Fu, X., Vervliet, N., Lathauwer, L. D., Huang, K., & Gillis, N. (2020) · IEEE Signal Processing Magazine · doi:10.1109/msp.2020.3003544 · Cited by 38
Learning Feature-Sparse Principal Subspace
Nie, F., Tian, L., Wang, R., & Li, X. (2022) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3212646 · Cited by 33
Deep Unrolled Low-Rank Tensor Completion for High Dynamic Range Imaging
Truong, M. T. N., Lam, E. Y. M., & Lee, C. (2022) · IEEE Transactions on Image Processing · doi:10.1109/tip.2022.3201708 · Cited by 33
Constrained composite optimization and augmented Lagrangian methods
Marchi, A. D., Jia, X., Kanzow, C., & Mehlitz, P. (2023) · Mathematical Programming · doi:10.1007/s10107-022-01922-4 · Cited by 49
Divide and Conquer: Distributed Optimization and Robustness Analysis
Pakazad, S. K. (2015) · Linköping studies in science and technology. Dissertations · doi:10.3384/diss.diva-117503 · Cited by 31
Variational Multiplicative Noise Removal by DC Programming
Li, Z., Lou, Y., & Zeng, T. (2016) · Journal of Scientific Computing · doi:10.1007/s10915-016-0175-z · Cited by 35
Li, J., Usevich, K., & Comon, P. (2018) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/17m1116295 · Cited by 31
A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization
Milzarek, A., Xiao, X., Cen, S., Wen, Z., & Ulbrich, M. (2019) · SIAM Journal on Optimization · doi:10.1137/18m1181249 · Cited by 38
Ferranti, L., Wan, Y., & Keviczky, T. (2018) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.4063 · Cited by 31
Oriented Feature Selection SVM Applied to Cancer Prediction in Precision Medicine
Shen, Y., Wu, C., Liu, C., Wu, Y., & Xiong, N. N. (2018) · IEEE Access · doi:10.1109/access.2018.2868098 · Cited by 31
Robust Task Grouping with Representative Tasks for Clustered Multi-Task Learning
Yao, Y., Cao, J., & Chen, H. (2019) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3292500.3330904 · Cited by 31
Item Response Theory: A Statistical Framework for Educational and Psychological Measurement
Chen, Y., Li, X., Liu, J., & Ying, Z. (2025) · Statistical Science · doi:10.1214/23-sts896 · Cited by 30
Topology Design for Stochastically Forced Consensus Networks
Hassan-Moghaddam, S., & Jovanović, M. R. (2017) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2017.2674962 · Cited by 30
ADMM for harmonic retrieval from one-bit sampling with time-varying thresholds
Qian, C., & Li, J. (2017) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2017.7952847 · Cited by 30
Stochastic Blind Motion Deblurring
Xiao, L., Gregson, J., Heide, F., & Heidrich, W. (2015) · IEEE Transactions on Image Processing · doi:10.1109/tip.2015.2432716 · Cited by 33
Efficient Multi-Dimensional Tensor Sparse Coding Using t-Linear Combination
Jiang, F., Liu, X.-Y., Lu, H., & Shen, R. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11620 · Cited by 30
Fused Lasso approach in portfolio selection
Corsaro, S., Simone, V. D., & Marino, Z. (2019) · Annals of Operations Research · doi:10.1007/s10479-019-03289-w · Cited by 31
COSMO: A conic operator splitting method for large convex problems
Garstka, M., Cannon, M., & Goulart, P. J. (2019) · European Control Conference (ECC) · doi:10.23919/ecc.2019.8796161 · Cited by 30
Tang, V. H., Bouzerdoum, A., & Phung, S. L. (2020) · IEEE Transactions on Image Processing · doi:10.1109/tip.2020.2973819 · Cited by 30
Hang, W., Feng, W., Liang, S., Wang, Q., Liu, X., & Choi, K. (2020) · Computer Methods and Programs in Biomedicine · doi:10.1016/j.cmpb.2020.105466 · Cited by 30
Online discriminative graph learning from multi-class smooth signals
Saboksayr, S. S., Mateos, G., & Çetin, M. (2021) · Signal Processing · doi:10.1016/j.sigpro.2021.108101 · Cited by 30
NTIRE 2021 Challenge on Burst Super-Resolution: Methods and Results
Bhat, G., Danelljan, M., Timofte, R., Akita, K., Cho, W., Fan, H., Jia, L., Kim, D., Lecouat, B., Li, Y., et al. (2021) · IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · doi:10.1109/cvprw53098.2021.00073 · Cited by 44
Transferable Self-Supervised Instance Learning for Sleep Recognition
Zhao, A., Wang, Y., & Li, J. (2022) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2022.3176751 · Cited by 30
Peer-to-Peer Local Energy Trading With Voltage Management Under Asynchronous Communication
Ullah, M. H., & Park, J.-D. (2022) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2022.3202695 · Cited by 30
Hou, L., He, H., & Yang, J. (2015) · Computational Optimization and Applications · doi:10.1007/s10589-015-9770-4 · Cited by 32
Abergel, R., & Moisan, L. (2017) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-017-0733-5 · Cited by 44
Alternating direction method of multipliers with difference of convex functions
Sun, T., Yin, P., Cheng, L., & Jiang, H. (2017) · Advances in Computational Mathematics · doi:10.1007/s10444-017-9559-3 · Cited by 31
Coupled Fluid Density and Motion from Single Views
Eckert, M.-L., Heidrich, W., & Thuerey, N. (2018) · Computer Graphics Forum · doi:10.1111/cgf.13511 · Cited by 38
Proximal-Proximal-Gradient Method
Ryu, E. K., & Yin, W. (2019) · Journal of Computational Mathematics · doi:10.4208/jcm.1906-m2018-0282 · Cited by 37
A Fast Proximal Point Method for Wasserstein Distance.Preprint
Xie, Y., Wang, X., Wang, R., & Hongyuan Zha, B. (2018) · arXiv (Cornell University) · Cited by 30
A Primal-Dual Algorithmic Framework for Constrained Convex MinimizationPreprint
Tran-Dinh, Q., & Cevher, V. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.5403 · Cited by 37
A Convergent Incoherent Dictionary Learning Algorithm for Sparse Coding
Bao, C., Quan, Y., & Ji, H. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-10599-4_20 · Cited by 29
Online Regularization by Denoising with Applications to Phase Retrieval
Wu, Z., Sun, Y., Liu, J., & Kamilov, U. S. (2019) · IEEE International Conference on Computer Vision Workshops · doi:10.1109/iccvw.2019.00482 · Cited by 41
Zhang, Y., Zhu, D., Wang, P., Zhang, G., & Leung, H. (2020) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2020.2978263 · Cited by 29
Super-Resolution of 3D Color Point Clouds Via Fast Graph Total Variation
Dinesh, C., Cheung, G., & Bajić, I. V. (2020) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp40776.2020.9053971 · Cited by 29
Multidimensional analysis and detection of informative features in human brain white matter
Richie-Halford, A., Yeatman, J. D., Simon, N., & Rokem, A. (2021) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1009136 · Cited by 33
Granger Causality Inference in EEG Source Connectivity Analysis: A State-Space Approach
Manomaisaowapak, P., Nartkulpat, A., & Songsiri, J. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3096642 · Cited by 31
Multi-Constraint Latent Representation Learning for Prognosis Analysis Using Multi-Modal Data
Ning, Z., Lin, Z., Xiao, Q., Du, D., Feng, Q., Chen, W., & Zhang, Y. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3112194 · Cited by 29
Wang, F., Wang, A., Tang, T., & Shi, J. (2022) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2022.3152161 · Cited by 29
Novel projection neurodynamic approaches for constrained convex optimization
Zhao, Y., Liao, X., & He, X. (2022) · Neural Networks · doi:10.1016/j.neunet.2022.03.011 · Cited by 29
Johnston, J., & Wang, X. (2022) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2022.3179600 · Cited by 31
Lin, Q., Li, Y., & Wu, Y.-C. (2023) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2022.3204786 · Cited by 31
Min-Max Optimization for MIMO Radar Waveform Design With Improved Power Efficiency
Zhang, X., Wang, X., So, H. C., Zoubir, A. M., & Cui, G. (2022) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2022.3233311 · Cited by 29
Beam angle optimization for proton therapy via group‐sparsity based angle generation method
Shen, H., Zhang, G., Lin, Y.-T., Rotondo, R. L., Long, Y. Q., & Gao, H. (2023) · Medical Physics · doi:10.1002/mp.16392 · Cited by 29
A Nonconvex Relaxation Approach for Rank Minimization Problems
Zhong, X., Xu, L., Li, Y., Liu, Z., & Chen, E. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9482 · Cited by 29
A class of customized proximal point algorithms for linearly constrained convex optimization
Ma, F., & Ni, M. (2016) · Computational and Applied Mathematics · doi:10.1007/s40314-016-0371-3 · Cited by 29
Sparse Travel Time Estimation from Streaming Data
Jabari, S. E., Freris, N. M., & Dilip, D. M. (2019) · Transportation Science · doi:10.1287/trsc.2019.0920 · Cited by 30
Yu, H., & Neely, M. J. (2018) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2018.2844284 · Cited by 29
Mini-batch algorithms with Barzilai–Borwein update step
Yang, Z., Wang, C., Zang, Y., & Li, J. (2018) · Neurocomputing · doi:10.1016/j.neucom.2018.06.002 · Cited by 29
Inertial Forward–Backward Algorithms with Perturbations: Application to Tikhonov Regularization
Attouch, H., Cabot, A., Chbani, Z., & Riahi, H. (2018) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-018-1369-3 · Cited by 29
Adaptive ADMM for Dictionary Learning in Convolutional Sparse Representation
Peng, G. (2019) · IEEE Transactions on Image Processing · doi:10.1109/tip.2019.2896541 · Cited by 29
Online learning for sparse PCA in high dimensions: Exact dynamics and phase transitions
Wang, C., & Lu, Y. M. (2016) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2016.7606821 · Cited by 29
Sun, S., Wang, T., & Chu, F. (2021) · Journal of Sound and Vibration · doi:10.1016/j.jsv.2021.116017 · Cited by 29
Proximal Gradient Algorithms: Applications in Signal ProcessingPreprint
Antonello, N., Stella, L., Patrinos, P., & van Waterschoot, T. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1803.01621 · Cited by 39
Optimal Algorithms for Distributed OptimizationPreprint
Uribe, C. A., Lee, S., Gasnikov, A. V., & Nedić, A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.00232 · Cited by 40
Approximate Leave-One-Out for Fast Parameter Tuning in High DimensionsPreprint
Wang, S., Zhou, W., Lu, H., Maleki, A., & Mirrokni, V. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.02694 · Cited by 29
Robust low-rank data matrix approximations
Feng, X., & He, X. (2016) · Science China Mathematics · doi:10.1007/s11425-015-0484-1 · Cited by 28
Artifacts in photoacoustic imaging: Origins and mitigations
Rietberg, M. T., Gröhl, J., Else, T. R., Bohndiek, S. E., Manohar, S., & Cox, B. (2025) · Photoacoustics · doi:10.1016/j.pacs.2025.100745 · Cited by 28
Dose domain regularization of MLC leaf patterns for highly complex IMRT plans
Nguyen, D. T. D., O'Connor, D., Yu, V., Ruan, D., Cao, M., Low, D. A., & Sheng, K. (2015) · Medical Physics · doi:10.1118/1.4915286 · Cited by 28
Misalignment-Robust Joint Filter for Cross-Modal Image Pairs
Shibata, T., Tanaka, M., & Okutomi, M. (2017) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.357 · Cited by 28
VMAT optimization with dynamic collimator rotation
Lyu, Q., O'Connor, D., Ruan, D., Yu, V., Nguyen, D. T. D., & Sheng, K. (2018) · Medical Physics · doi:10.1002/mp.12915 · Cited by 30
Determined Blind Source Separation via Proximal Splitting Algorithm
Yatabe, K., & Kitamura, D. (2018) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2018.8462338 · Cited by 28
Localized Linear Regression in Networked Data
Jung, A., & Tran, N. (2019) · IEEE Signal Processing Letters · doi:10.1109/lsp.2019.2918933 · Cited by 32
Proximal Alternating Direction Network: A Globally Converged Deep Unrolling Framework
Liu, R., Fan, X., Cheng, S., Wang, X., & Luo, Z. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11523 · Cited by 28
Robust Low-Rank Tensor Minimization via a New Tensor Spectral $k$ -Support Norm
Lou, J., & Cheung, Y. (2019) · IEEE Transactions on Image Processing · doi:10.1109/tip.2019.2946445 · Cited by 35
Recovery of Time-Varying Graph Signals via Distributed Algorithms on Regularized Problems
Jiang, J., Tay, D. B. H., Sun, Q., & Ouyang, S. (2020) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2020.3010613 · Cited by 33
A Novel Communication-Less Approach to Economic Dispatch for Microgrids
Lyu, C., Jia, Y., & Xu, Z. (2020) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2020.3018622 · Cited by 28
Multilevel Optimal Transport: A Fast Approximation of Wasserstein-1 Distances
Liu, J., Yin, W., Li, W., & Chow, Y. T. (2021) · SIAM Journal on Scientific Computing · doi:10.1137/18m1219813 · Cited by 42
First-Order Methods for Convex Optimization
Dvurechensky, P. E., Shtern, S., & Staudigl, M. (2021) · EURO Journal on Computational Optimization · doi:10.1016/j.ejco.2021.100015 · Cited by 39
Deep learning approaches to inverse problems in imaging: Past, present and future
López-Tapia, S., Molina, R., & Katsaggelos, A. K. (2021) · Digital Signal Processing · doi:10.1016/j.dsp.2021.103285 · Cited by 34
Gao, Y., Yang, F., & Cao, L. (2022) · Cells · doi:10.3390/cells11131999 · Cited by 31
Thanh, L. T., Abed‐Meraim, K., Trung, N. L., & Hafiane, A. (2022) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2022.3201640 · Cited by 28
A Primal-Dual Algorithm for Link Dependent Origin Destination Matrix Estimation
Michau, G., Pustelnik, N., Borgnat, P., Abry, P., Nantes, A., Bhaskar, A., & Chung, E. (2016) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2016.2623094 · Cited by 31
Online sparse class imbalance learning on big data
Maurya, C. K., Toshniwal, D., & Venkoparao, V. G. (2016) · Neurocomputing · doi:10.1016/j.neucom.2016.07.040 · Cited by 28
Mean Field Type Control with Congestion (II): An Augmented Lagrangian Method
Achdou, Y., & Laurière, M. (2016) · Applied Mathematics & Optimization · doi:10.1007/s00245-016-9391-z · Cited by 28
Rigid body contact problems using proximal operators
Erleben, K. (2017) · ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA) · doi:10.1145/3099564.3099575 · Cited by 28
Bemporad, A. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2735938 · Cited by 28
Explicit Ringing Removal in Image Deblurring
Mosleh, A., Sola, Y. E., Zargari, F., Onzon, E., & Langlois, J. M. P. (2017) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2764625 · Cited by 29
Yue, X., Yan, H., Park, J. G., Liang, Z., & Shi, J. (2017) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2017.2772218 · Cited by 29
Super-Resolution and Sparse View CT Reconstruction
Zang, G., Aly, M., Idoughi, R., Wonka, P., & Heidrich, W. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-01270-0_9 · Cited by 34
Barratt, S. T., & Boyd, S. (2020) · Engineering Optimization · doi:10.1080/0305215x.2020.1754406 · Cited by 37
Self-citationStable Principal Component Pursuit via Convex Analysis
Lei, Y., Parekh, A., & Selesnick, I. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2907264 · Cited by 31
Overcoming the limitations of phase transition by higher order analysis of regularization techniques
Weng, H., Maleki, A., & Zheng, L. (2018) · The Annals of Statistics · doi:10.1214/17-aos1651 · Cited by 28
Ptychographic phase retrieval by proximal algorithms
Yan, H. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab704e · Cited by 28
Multitask Feature Learning Meets Robust Tensor Decomposition for EEG Classification
Zheng, Q., Wang, Y., & Heng, P. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2946914 · Cited by 28
Data-Driven Variable Decomposition for Treatment Effect Estimation
Kuang, K., Cui, P., Zou, H., Li, B., Tao, J., Wu, F. Q., & Yang, S. (2020) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.3006898 · Cited by 38
Distributed Learning to Protect Privacy in Multi-centric Clinical Studies
Damiani, A., Vallati, M., Gatta, R., Dinapoli, N., Jochems, A., Deist, T. M., van Soest, J., Dekker, A. L. A. J., & Valentini, V. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-19551-3_8 · Cited by 38
A Survey on Matrix Completion: Perspective of Signal ProcessingPreprint
Li, X. P., Huang, L., So, H. C., & Zhao, B. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.10885 · Cited by 28
Towards deep neural networks robust to adversarial examples
Matyasko, A. (2020) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/143316 · Cited by 28
Lower Bounds on Ground-State Energies of Local Hamiltonians through the Renormalization Group
Kull, I., Schuch, N., Dive, B., & Navascués, M. (2024) · Physical Review X · doi:10.1103/physrevx.14.021008 · Cited by 48
Self-supervised Scalable Deep Compressed Sensing
Chen, B., Zhang, X., Liu, S., Zhang, Y., & Zhang, J. (2024) · International Journal of Computer Vision · doi:10.1007/s11263-024-02209-1 · Cited by 35
Admixture of Poisson MRFs: A Topic Model with Word Dependencies
Inouye, D. I., Ravikumar, P., & Dhillon, I. S. (2014) · International Conference on Machine Learning · Cited by 31
Compressive data gathering with low-rank constraints for Wireless Sensor networks
He, J., Sun, G., Li, Z., & Zhang, Y. (2016) · Signal Processing · doi:10.1016/j.sigpro.2016.08.002 · Cited by 27
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.