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 401–500 of 1,007
A Manifold Regularized Multi-Task Learning Model for IQ Prediction From Two fMRI Paradigms
Xiao, L., Stephen, J. M., Wilson, T. W., Calhoun, V. D., & Wang, Y. (2019) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2019.2921207 · Cited by 58
Caluya, K. F., & Halder, A. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3060704 · Cited by 53
Kurdyka–Łojasiewicz Exponent via Inf-projection
Yu, P., Li, G., & Pong, T. K. (2021) · Foundations of Computational Mathematics · doi:10.1007/s10208-021-09528-6 · Cited by 53
Empirical Asset Pricing via Machine Learning
Gu, S., Kelly, B. T., & Xiu, D. (2018) · The Review of Financial Studies · doi:10.2139/ssrn.3159577 · Cited by 52
Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
Rauhut, H., & Schwab, C. (2015) · Mathematics of Computation · doi:10.1090/mcom/3113 · Cited by 61
Structured dictionary learning for abnormal event detection in crowded scenes
Yuan, Y., Feng, Y., & Lu, X. (2017) · Pattern Recognition · doi:10.1016/j.patcog.2017.08.001 · Cited by 52
Statistical inference of probabilistic origin-destination demand using day-to-day traffic data
Ma, W., & Qian, S. (2018) · Transportation Research Part C Emerging Technologies · doi:10.1016/j.trc.2017.12.015 · Cited by 54
Cooperative transportation control of multiple mobile manipulators through distributed optimization
Chen, J., & Kai, S. (2018) · Science China Information Sciences · doi:10.1007/s11432-018-9588-0 · Cited by 52
Membership Affinity Lasso for Fuzzy Clustering
Guo, L., Chen, L., Lu, X., & Chen, C. L. P. (2019) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2019.2905114 · Cited by 52
Disciplined multi-convex programming
Shen, X., Diamond, S., Udell, M. R., Gu, Y., & Boyd, S. (2017) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc.2017.7978647 · Cited by 62
Self-citationSIMBA: Scalable Inversion in Optical Tomography Using Deep Denoising Priors
Wu, Z., Sun, Y., Matlock, A. C., Liu, J., Tian, L., & Kamilov, U. S. (2020) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2020.2999820 · Cited by 66
End-to-end Interpretable Learning of Non-blind Image Deblurring
Eboli, T., Sun, J. Z., & Ponce, J. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-58520-4_19 · Cited by 58
Improving EEG Decoding via Clustering-Based Multitask Feature Learning
Zhang, Y., Zhou, T., Wu, W., Xie, H., Zhu, H., Zhou, G., & Cichocki, A. S. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3053576 · Cited by 58
Sparsity-Driven ISAR Imaging Based on Two-Dimensional ADMM
Hashempour, H. R. (2020) · IEEE Sensors Journal · doi:10.1109/jsen.2020.3006105 · Cited by 51
Online Unmixing of Multitemporal Hyperspectral Images Accounting for Spectral Variability
Thouvenin, P.-A., Nicolas Dobigeon, B., & Tourneret, J. (2016) · IEEE Transactions on Image Processing · doi:10.1109/tip.2016.2579309 · Cited by 56
Global Convergence Rate of Proximal Incremental Aggregated Gradient Methods
Vanli, N. D., Gürbüzbalaban, M., & Ozdaglar, A. (2018) · SIAM Journal on Optimization · doi:10.1137/16m1094415 · Cited by 68
Multipolarization Through-Wall Radar Imaging Using Low-Rank and Jointly-Sparse Representations
Tang, V. H., Bouzerdoum, A., & Phung, S. L. (2017) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2786462 · Cited by 51
Encrypted cloud-based MPC for linear systems with input constraints
Darup, M. S., Redder, A., & Quevedo, D. E. (2018) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2018.11.035 · Cited by 59
An improved stochastic EM algorithm for large‐scale full‐information item factor analysis
Zhang, S., Chen, Y., & Liu, Y. (2018) · British Journal of Mathematical and Statistical Psychology · doi:10.1111/bmsp.12153 · Cited by 63
Graph and Rank Regularized Matrix Recovery for Snapshot Spectral Image Demosaicing
Tsagkatakis, G., Bloemen, M., Geelen, B., Jayapala, M., & Tsakalides, P. (2018) · IEEE Transactions on Computational Imaging · doi:10.1109/tci.2018.2888989 · Cited by 51
Linear Global Translation Estimation with Feature Tracks
Cui, Z., Jiang, N., Tang, C., & Tan, P. (2015) · British Machine Vision Conference (BMVC) · doi:10.5244/c.29.46 · Cited by 56
Model Adaptation for Inverse Problems in Imaging
Gilton, D., Ongie, G., & Willett, R. M. (2021) · IEEE Transactions on Computational Imaging · doi:10.1109/tci.2021.3094714 · Cited by 53
Lightweight FISTA-Inspired Sparse Reconstruction Network for mmW 3-D Holography
Wang, M., Wei, S., Liang, J., Liu, S., Shi, J., & Zhang, X. (2021) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2021.3093307 · Cited by 51
Collaborative Ranking with a Push at the Top
Christakopoulou, K., & Banerjee, A. (2015) · International World Wide Web Conference (WWW) · doi:10.1145/2736277.2741678 · Cited by 57
Reality Skins: Creating Immersive and Tactile Virtual Environments
Shapira, L., & Freedman, D. (2016) · Proceedings - International Symposium on Mixed and Augmented Reality, ISMAR · doi:10.1109/ismar.2016.23 · Cited by 59
Multi-block ADMM for big data optimization in smart grid
Liu, L., & Han, Z. (2015) · 2012 International Conference on Computing, Networking and Communications (ICNC) · doi:10.1109/iccnc.2015.7069405 · Cited by 59
3D Point Cloud Super-Resolution via Graph Total Variation on Surface Normals
Dinesh, C., Cheung, G., & Bajić, I. V. (2019) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2019.8803560 · Cited by 50
Convergence Guarantees for Non-Convex Optimisation With Cauchy-Based Penalties
Karakuş, O., Mayo, P., & Achim, A. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.3032231 · Cited by 55
An Optimal Algorithm for Decentralized Finite-Sum Optimization
Hendrikx, H., Bach, F., & Massoulié, L. (2021) · SIAM Journal on Optimization · doi:10.1137/20m134842x · Cited by 77
Reinventing the utility for distributed energy resources: A proposal for retail electricity markets
Haider, R., D’Achiardi, D., Venkataramanan, V., Srivastava, A. K., Bose, A., & Annaswamy, A. M. (2021) · Advances in Applied Energy · doi:10.1016/j.adapen.2021.100026 · Cited by 50
Domain-specific sentiment classification via fusing sentiment knowledge from multiple sources
Wu, F., Huang, Y., & Yuan, Z. (2016) · Information Fusion · doi:10.1016/j.inffus.2016.09.001 · Cited by 49
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
Proximal Algorithms for Large-Scale Statistical Modeling and Sensor/Actuator Selection
Zare, A., Mohammadi, H., Dhingra, N. K., Georgiou, T. T., & Jovanovic, M. R. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2948268 · Cited by 52
Concise Fuzzy System Modeling Integrating Soft Subspace Clustering and Sparse Learning
Xu, P., Deng, Z., Cui, C., Zhang, T., Choi, K., Gu, S., Wang, J., & Wang, S. (2019) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2019.2895572 · Cited by 50
Time-varying Graph Learning Based on Sparseness of Temporal Variation
Yamada, K., Tanaka, Y., & Ortega, A. (2019) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2019.8682762 · Cited by 62
Regularized inverse holographic volume reconstruction for 3D particle tracking
Mallery, K., & Hong, J. (2019) · Optics Express · doi:10.1364/oe.27.018069 · Cited by 64
Weighted discriminative collaborative competitive representation for robust image classification
Gou, J., Wang, L., Zhang, Y., Yuan, Y., Ou, W., & Mao, Q. (2020) · Neural Networks · doi:10.1016/j.neunet.2020.01.020 · Cited by 49
Fixed-Point and Objective Convergence of Plug-and-Play Algorithms
Nair, P., Gavaskar, R. G., & Chaudhury, K. N. (2021) · IEEE Transactions on Computational Imaging · doi:10.1109/tci.2021.3066053 · Cited by 53
Stochastic subgradient method converges at the rate $O(k^{-1/4})$ on weakly convex functionsPreprint
Davis, D., & Drusvyatskiy, D. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.02988 · Cited by 106
Reweighted Proximal Pruning for Large-Scale Language Representation
Guo, F.-M., Liu, S., Mungall, F. S., Lin, X., & Wang, Y. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.12486 · Cited by 41
Adaptive Filter Pruning via Sensitivity Feedback
Zhang, Y., & Freris, N. M. (2023) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2023.3246263 · Cited by 56
Convex Clustering: An Attractive Alternative to Hierarchical Clustering
Chen, G. K., Chi, E. C., Rañola, J. M. O., & Lange, K. L. (2015) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1004228 · Cited by 50
Structure Selective Depth Superresolution for RGB-D Cameras
Kim, Y., Ham, B., Oh, C., & Sohn, K. (2016) · IEEE Transactions on Image Processing · doi:10.1109/tip.2016.2601262 · Cited by 52
Treatment Effect Estimation with Data-Driven Variable Decomposition
Kuang, K., Cui, P., Li, B., Jiang, M., Yang, S., & Wang, F. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10480 · Cited by 74
Fundamental barriers to high-dimensional regression with convex penalties
Celentano, M., & Andrea Montanari, A. (2022) · The Annals of Statistics · doi:10.1214/21-aos2100 · Cited by 48
Online Topology Identification From Vector Autoregressive Time Series
Zaman, B., López-Ramos, L. M., Romero, D., & Beferull‐Lozano, B. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.3042940 · Cited by 48
Gong, C., & Zeng, L. (2019) · Signal Processing · doi:10.1016/j.sigpro.2019.06.031 · Cited by 48
StructADMM: Achieving Ultrahigh Efficiency in Structured Pruning for DNNs
Zhang, T., Ye, S., Feng, X., Ma, X., Zhang, K., Li, Z., Tang, J., Liu, S., Lin, X., Liu, Y., et al. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.3045153 · Cited by 59
Learned convex regularizers for inverse problemsPreprint
Mukherjee, S., Dittmer, S., Shumaylov, Z., Lunz, S., Öktem, O., & Schönlieb, C. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.02839 · Cited by 97
Interpretable Models for Granger Causality Using Self-explaining Neural Networks
Marcinkevičs, R., & Vogt, J. E. (2020) · Repository for Publications and Research Data (ETH Zurich) · doi:10.13140/rg.2.2.20331.16163 · Cited by 100
D3C2-Net: Dual-Domain Deep Convolutional Coding Network for Compressive Sensing
Li, W., Chen, B., Liu, S., Zhao, S., Du, B., Zhang, Y., & Zhang, J. (2024) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2024.3397012 · Cited by 59
Yang, H., Zhu, Y., & Liu, J. (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.01146 · Cited by 56
Wei, Y., Fang, H., Zeng, X., Chen, J., & Pardalos, P. M. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2936355 · Cited by 48
Hassan-Moghaddam, S., & Jovanović, M. R. (2020) · Automatica · doi:10.1016/j.automatica.2020.109311 · Cited by 47
Malavé, M. O., Baron, C. A., Koundinyan, S. P., Sandino, C. M., Ong, F., Cheng, J. Y., & Nishimura, D. G. (2020) · Magnetic Resonance in Medicine · doi:10.1002/mrm.28177 · Cited by 48
Universal Latent Space Model Fitting for Large Networks with Edge Covariates
Ma, Z., Ma, Z., & Yuan, H. (2020) · Journal of Machine Learning Research · Cited by 132
Recommender Systems Based on Graph Embedding Techniques: A Review
Deng, Y. (2022) · IEEE Access · doi:10.1109/access.2022.3174197 · Cited by 60
Tracking Switched Dynamic Network Topologies From Information Cascades
Baingana, B., & Giannakis, G. B. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2628354 · Cited by 49
Florea, M. I., & Vorobyov, S. A. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2988614 · Cited by 46
An ADMM Approach for PAPR Reduction for Large-Scale MIMO-OFDM Systems
Bao, H., Fang, J., Wan, Q., Chen, Z., & Jiang, T. (2018) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2018.2837112 · Cited by 54
Model-Based Deep Learning for One-Bit Compressive Sensing
Khobahi, S., & Soltanalian, M. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.3022319 · Cited by 46
Large-Scale Affine Matrix Rank Minimization With a Novel Nonconvex Regularizer
Wang, Z., Liu, Y., Luo, X., Wang, J., Gao, C., Peng, D., & Chen, W. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3059711 · Cited by 46
MoDL-QSM: Model-based deep learning for quantitative susceptibility mapping
Feng, R., Zhao, J., Wang, H., Yang, B., Feng, J., Shi, Y., Zhang, M., Liu, C., Zhang, Y., Zhuang, J., et al. (2021) · NeuroImage · doi:10.1016/j.neuroimage.2021.118376 · Cited by 58
Sparse inversion of Stokes profiles
Ramos, A. A., & Rodríguez, J. D. L. C. (2015) · Astronomy and Astrophysics · doi:10.1051/0004-6361/201425508 · Cited by 46
Contact Models in Robotics: A Comparative Analysis
Lidec, Q. L., Jallet, W., Montaut, L., Laptev, I., Schmid, C., & Carpentier, J. (2024) · IEEE Transactions on Robotics · doi:10.1109/tro.2024.3434208 · Cited by 93
A Convex Formulation for Magnetic Particle Imaging X-Space Reconstruction
Konkle, J., Goodwill, P. W., Hensley, D. W., Orendorff, R. D., Lustig, M. S., & Conolly, S. (2015) · PLoS ONE · doi:10.1371/journal.pone.0140137 · Cited by 55
Annunziata, R., & Trucco, E. (2016) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2016.2570123 · Cited by 47
Phase-Constrained Spectrum Deconvolution for Fourier Transform Mass Spectrometry
Grinfeld, D., Aizikov, K., Kreutzmann, A., Damoc, E., & Makarov, A. (2016) · Analytical Chemistry · doi:10.1021/acs.analchem.6b03636 · Cited by 45
Yong, P., Liao, W., Huang, J., & Li, Z. (2018) · Inverse Problems · doi:10.1088/1361-6420/aaaf8e · Cited by 49
Griffin–Lim Like Phase Recovery via Alternating Direction Method of Multipliers
Masuyama, Y., Yatabe, K., & Oikawa, Y. (2018) · IEEE Signal Processing Letters · doi:10.1109/lsp.2018.2884026 · Cited by 45
LSCD: Low-rank and sparse cross-domain recommendation
Huang, L., Zhao, Z., Wang, C., Huang, D., & Chao, H. (2019) · Neurocomputing · doi:10.1016/j.neucom.2019.07.091 · Cited by 45
Between hard and soft thresholding: optimal iterative thresholding algorithms
Liu, H., & Barber, R. F. (2019) · Information and Inference A Journal of the IMA · doi:10.1093/imaiai/iaz027 · Cited by 51
Efficient Neural Interaction Function Search for Collaborative Filtering
Yao, Q., Chen, X., Kwok, J. T.-Y., Li, Y., & Hsieh, C. (2020) · International World Wide Web Conference (WWW) · doi:10.1145/3366423.3380237 · Cited by 55
Differentiable Simulation for Physical System Identification
Lidec, Q. L., Kalevatykh, I., Laptev, I., Schmid, C., & Carpentier, J. (2021) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2021.3062323 · Cited by 76
Ren, D., Zhang, H., Zhang, D. D., & Zuo, W. (2015) · Neurocomputing · doi:10.1016/j.neucom.2014.08.101 · Cited by 46
Mardani, M., Monajemi, H., Papyan, V., Vasanawala, S. S., Donoho, D. L., & Pauly, J. M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1711.10046 · Cited by 45
Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online OptimizationPreprint
Goel, G., Lin, Y., Sun, H., & Wierman, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.12776 · Cited by 45
Decentralized control of plug-in electric vehicles under driving uncertainty
Vayá, M. G., Andersson, G., & Boyd, S. (2014) · IEEE PES Innovative Smart Grid Technologies Europe · doi:10.1109/isgteurope.2014.7028989 · Cited by 46
Self-citationEnergy-Aware Sensor Selection in Field Reconstruction
Liu, S., Vempaty, A., Fardad, M., Maşazade, E., & Varshney, P. K. (2014) · IEEE Signal Processing Letters · doi:10.1109/lsp.2014.2342198 · Cited by 44
Derivation and Analysis of the Primal-Dual Method of Multipliers Based on Monotone Operator Theory
Sherson, T., Heusdens, R. R., & Kleijn, W. B. (2018) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2018.2876754 · Cited by 54
Spaceborne Staring Spotlight SAR Tomography—A First Demonstration With TerraSAR-X
Ge, N., González, F. R., Wang, Y., Shi, Y., & Zhu, X. X. (2018) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2018.2851752 · Cited by 44
Sparse Signal Recovery Using Iterative Proximal Projection
Ghayem, F., Sadeghi, M., Babaie‐Zadeh, M., Chatterjee, S., Skoglund, M., & Christian Jutten, B. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2778695 · Cited by 44
Multi-image Semantic Matching by Mining Consistent Features
Wang, Q., Zhou, X., & Daniilidis, K. (2018) · 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.2018.00078 · Cited by 45
ADMMBO: Bayesian Optimization with Unknown Constraints using ADMM.
Ariafar, S., Coll‐Font, J., Brooks, D. H., & Dy, J. (2019) · PubMed · Cited by 62
Robust Subspace Tracking With Missing Data and Outliers: Novel Algorithm With Convergence Guarantee
Thanh, L. T., Nguyen, V.-D., Trung, N. L., & Abed‐Meraim, K. (2021) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2021.3066795 · Cited by 44
Stochastic Variance-Reduced ADMMPreprint
Zheng, S., & Kwok, J. T.-Y. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1604.07070 · Cited by 44
Fine-Grained Analysis of Stability and Generalization for Stochastic Gradient DescentPreprint
Lei, Y., & Ying, Y. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.08157 · Cited by 54
Towards an optimal stochastic alternating direction method of multipliers
Azadi, S., & Sra, S. (2015) · Cited by 53
Co-detecting social spammers and spam messages in microblogging via exploiting social contexts
Wu, F., Shu, J., Huang, Y., & Yuan, Z. (2016) · Neurocomputing · doi:10.1016/j.neucom.2016.03.036 · Cited by 44
Cırık, A. Ç., Biswas, S., Vuppala, S., & Ratnarajah, T. (2016) · IEEE Transactions on Communications · doi:10.1109/tcomm.2016.2606411 · Cited by 43
Knowledge-Aided Covariance Matrix Estimation via Kronecker Product Expansions for Airborne STAP
Sun, G., He, Z., Tong, J., & Zhang, X. (2018) · IEEE Geoscience and Remote Sensing Letters · doi:10.1109/lgrs.2018.2799329 · Cited by 43
Sahu, D. R., Pitea, A., & Verma, M. (2019) · Numerical Algorithms · doi:10.1007/s11075-019-00688-9 · Cited by 43
Scalable Online Convolutional Sparse Coding
Wang, Y., Yao, Q., Kwok, J. T.-Y., & Ni, L. M.-S. (2018) · IEEE Transactions on Image Processing · doi:10.1109/tip.2018.2842152 · Cited by 43
Full waveform inversion by proximal Newton method using adaptive regularization
Aghamiry, H. S., Gholami, A., & Operto, S. (2020) · Geophysical Journal International · doi:10.1093/gji/ggaa434 · Cited by 49
Deep Griffin–Lim Iteration: Trainable Iterative Phase Reconstruction Using Neural Network
Masuyama, Y., Yatabe, K., Koizumi, Y., Oikawa, Y., & Harada, N. (2021) · IEEE Journal on Selected Topics in Signal Processing · doi:10.1109/jstsp.2020.3034486 · Cited by 32
Ju, X., Hu, D., Li, C., He, X., & Feng, G. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2021.3093076 · Cited by 43
High Brightness HDR Projection Using Dynamic Freeform Lensing
Damberg, G., Gregson, J., & Heidrich, W. (2016) · ACM Transactions on Graphics · doi:10.1145/2857051 · Cited by 45
Finding Gangs in War from Signed Networks
Chu, L., Wang, Z., Pei, J., Wang, J., Zhao, Z., & Chen, E. (2016) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2939672.2939855 · Cited by 43
Toulis, P., & Airoldi, E. M. (2015) · Statistics and Computing · doi:10.1007/s11222-015-9560-y · Cited by 53
ISTA-NAS: Efficient and Consistent Neural Architecture Search by Sparse CodingPreprint
Yang, Y., Li, H., You, S., Wang, F., Qian, C., & Lin, Z. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.06176 · Cited by 74
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.