The DOI matches its Crossref record; 69 of the 69 references it cites were found in a registry or an index.
Real-Time Convex Optimization in Signal Processing
Abstract
Convex optimization has been used in signal processing for a long time to choose coefficients for use in fast (linear) algorithms, such as in filter or array design; more recently, it has been used to carry out (nonlinear) processing on the signal itself. Examples of the latter case include total variation denoising, compressed sensing, fault detection, and image classification. In both scenarios, the optimization is carried out on time scales of seconds or minutes and without strict time constraints. Convex optimization has traditionally been considered computationally expensive, so its use has been limited to applications where plenty of time is available. Such restrictions are no longer justified. The combination of dramatically increased computing power, modern algorithms, and new coding approaches has delivered an enormous speed increase, which makes it possible to solve modest-sized convex optimization problems on microsecond or millisecond time scales and with strict deadlines. This enables real-time convex optimization in signal processing.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
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
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Linear Matrix Inequalities in System and Control Theory
Boyd, S., El Ghaoui, L., Feron, E., & Balakrishnan, V. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970777 · Cited by 21,687
Self-citationDonoho, D. L. (2004) · Cited by 16,703
Nonlinear total variation based noise removal algorithms
Rudin, L. I., Osher, S., & Fatemi, E. (1992) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(92)90242-f · Cited by 15,704
An Introduction to Support Vector Machines and Other Kernel-based Learning Methods
Cristianini, N., & Shawe-Taylor, J. (2000) · doi:10.1017/cbo9780511801389 · Cited by 13,855
Haykin, S. (1986) · Cited by 12,603
The Elements of Statistical Learning: Data Mining, Inference, and Prediction
John Lu, Z. Q. (2010) · Journal of the Royal Statistical Society Series A: Statistics in Society · doi:10.1111/j.1467-985x.2010.00646_6.x · Cited by 12,390
The Nature of Statistical Learning Theory
Vapnik, V. N. (2000) · Springer eBooks · doi:10.1007/978-1-4757-3264-1 · Cited by 10,696
An Introduction To Compressive Sampling
Candes, E. J., & Wakin, M. B. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914731 · Cited by 10,017
Rogers, S. (1996) · Control Engineering Practice · doi:10.1016/0967-0661(96)82838-3 · Cited by 9,278
YALMIP : a toolbox for modeling and optimization in MATLAB
Lofberg, J. (2005) · 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508) · doi:10.1109/cacsd.2004.1393890 · Cited by 9,149
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
Decoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
Stable signal recovery from incomplete and inaccurate measurements
Candès, E. J., Romberg, J. K., & Tao, T. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20124 · Cited by 7,036
Linear Programming and Extensions
Dantzig, G. (1963) · RAND Corporation eBooks · doi:10.7249/r366 · Cited by 5,755
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600523 · Cited by 5,021
Markowitz, H. (1952) · The Journal of Finance · doi:10.2307/2975974 · Cited by 4,599
Predictive Control With Constraints
Maciejowski, J. M. (2001) · Cambridge University Engineering Department Publications Database · Cited by 4,368
Interior-Point Polynomial Algorithms in Convex Programming
Nesterov, Y., & Nemirovskii, A. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970791 · Cited by 4,334
Predictive control with constraints
Camacho, E. F. (2003) · Automatica · doi:10.1016/s0005-1098(03)00056-6 · Cited by 3,530
chambolle (2004) · doi:10.1023/b:jmiv.0000011321.19549.88 · Cited by 3,227
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600523 · Cited by 2,399
Primal-Dual Interior-Point Methods
Wright, S. J. (1997) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971453 · Cited by 2,391
Fundamentals of Adaptive Filtering
Ramirez, P. S. (2002) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-1-4757-3637-3_2 · Cited by 1,958
Array Signal Processing: Concepts and Techniques
Johnson, D. H., & Dudgeon, D. E. (1993) · Medical Entomology and Zoology · Cited by 1,940
SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
Toh, K. C., Todd, M. J., & Tütüncü, R. H. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805762 · Cited by 1,894
Fundamentals of adaptive filtering
Sayed, A. H. (2003) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 1,673
Graham, R., Grötschel, M., & Lovász, L. (1995) · Medical Entomology and Zoology · Cited by 1,526
Vorobyov, S. A., Gershman, A. B., & Luo, Z.-Q. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2002.806865 · Cited by 1,504
On robust Capon beamforming and diagonal loading
Li, J., Stoica, P., & Wang, Z. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.812831 · Cited by 1,439
Just relax: convex programming methods for identifying sparse signals in noise
Tropp, J. A. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.864420 · Cited by 1,407
Fast Model Predictive Control Using Online Optimization
Wang, Y., & Boyd, S. (2010) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2009.2017934 · Cited by 1,372
Self-citationLayering as Optimization Decomposition: A Mathematical Theory of Network Architectures
Chiang, M., Low, S. H., Calderbank, A. R., & Doyle, J. C. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887322 · Cited by 1,352
Linear controller design: limits of performance
Boyd, S., & Barratt, C. H. (1991) · Prentice-Hall, Inc eBooks · Cited by 1,196
Self-citationSolving semidefinite-quadratic-linear programs using SDPT3
T�t�nc�, R. H., Toh, K. C., & Todd, M. J. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0347-5 · Cited by 1,152
Robust Solutions to Least-Squares Problems with Uncertain Data
El Ghaoui, L., & Lebret, H. (1997) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479896298130 · Cited by 1,076
Disciplined Convex Programming
Grant, M., Boyd, S., & Ye, Y. (2006) · Nonconvex Optimization and Its Applications · doi:10.1007/0-387-30528-9_7 · Cited by 1,026
Self-citationFAST TCP: Motivation, Architecture, Algorithms, Performance
Wei, D. X., Jin, C., Low, S. H., & Hegde, S. (2006) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2006.886335 · Cited by 955
Handbook of Antennas in Wireless Communications
(2001) · Electrical Engineering & Applied Signal Processing Series · doi:10.1201/9781420042146 · Cited by 863
Robust Modeling With Erratic Data
Claerbout, J. F., & Muir, F. (1973) · Geophysics · doi:10.1190/1.1440378 · Cited by 833
Robust minimum variance beamforming
Lorenz, R. G., & Boyd, S. P. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.845436 · Cited by 774
Self-citationThe identification of nonlinear biological systems: Wiener and Hammerstein cascade models
Hunter, I. W., & Korenberg, M. J. (1986) · Biological Cybernetics · doi:10.1007/bf00341929 · Cited by 639
Robust solution to least squares problems with uncertain data
Ghaoui, L. E., & Lebret, H. (1997) · Cited by 638
Kim, S.-J., Koh, K., Boyd, S., & Gorinevsky, D. (2009) · SIAM Review · doi:10.1137/070690274 · Cited by 615
Self-citationConvex Optimization in Signal Processing and Communications
(2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511804458 · Cited by 554
Optimal design of a CMOS op-amp via geometric programming
Hershenson, M. D., Boyd, S. P., & Lee, T. H. (2001) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.905671 · Cited by 548
Self-citationAntenna array pattern synthesis via convex optimization
Lebret, H., & Boyd, S. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.558465 · Cited by 520
Self-citationControl of Uncertain Systems: A Linear Programming Approach
Dahleh, M. A., & Diaz-Bobillo, I. J. (1995) · Medical Entomology and Zoology · Cited by 489
Deconvolution with the l 1 norm
Taylor, H. L., Banks, S. C., & McCoy, J. F. (1979) · Geophysics · doi:10.1190/1.1440921 · Cited by 436
Optimization Methods in Finance
Cornuejols, G., & Tütüncü, R. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511753886 · Cited by 347
Candès, E. J., & Guo, F. (2002) · Signal Processing · doi:10.1016/s0165-1684(02)00300-6 · Cited by 290
Optimal linear filtering under parameter uncertainty
Geromel, J. C. (1999) · IEEE Transactions on Signal Processing · doi:10.1109/78.738249 · Cited by 283
Digital Circuit Optimization via Geometric Programming
Boyd, S. P., Kim, S.-J., Patil, D. D., & Horowitz, M. A. (2005) · Operations Research · doi:10.1287/opre.1050.0254 · Cited by 175
Self-citationFIR filter design via semidefinite programming and spectral factorization
Wu, S.-P., Boyd, S., & Vandenberghe, L. (2002) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.1996.574313 · Cited by 172
Self-citationDesigning optimal quantum detectors via semidefinite programming
Eldar, Y. C., Megretski, A., & Verghese, G. C. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.809510 · Cited by 167
Optimization of inductor circuits via geometric programming
Hershenson, M. D. M., Mohan, S. S., Boyd, S., & Lee, T. H. (1999) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/309847.310112 · Cited by 154
Self-citationReceive antenna selection in MIMO systems using convex optimization
Dua, A., Medepalli, K., & Paulraj, A. J. (2006) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2006.1687757 · Cited by 145
Convex optimization problems involving finite autocorrelation sequences
Alkire, B., & Vandenberghe, L. (2002) · Mathematical Programming · doi:10.1007/s10107-002-0334-x · Cited by 119
Linear Minimax Regret Estimation of Deterministic Parameters with Bounded Data Uncertainties
Eldar, Y. C., Ben‐Tal, A., & Nemirovski, A. S. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.831144 · Cited by 99
A Semidefinite Programming Approach to Optimal Unambiguous Discrimination of Quantum StatesPreprint
Eldar, Y. C. (2002) · Cited by 87
On the parameterization of positive real sequences and MA parameter estimation
Dumitrescu, B., Tabus, I., & Stoica, P. (2001) · IEEE Transactions on Signal Processing · doi:10.1109/78.960409 · Cited by 83
Design of orthogonal pulse shapes for communications via semidefinite programming
Davidson, T. N., Luo, Z.-Q. T., & Wong, K. M. (2000) · IEEE Transactions on Signal Processing · doi:10.1109/78.839988 · Cited by 67
Python Optimization Modeling Objects (Pyomo)
Hart, W. E. (2009) · Springer eBooks · doi:10.1007/978-0-387-88843-9_1 · Cited by 39
Vorobyov, S. A., Gershman, A. B., & Luo, Z.-Q. T. (2002) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2002.5745255 · Cited by 35
Solving Demodulation as an Optimization Problem
Sell, G., & Slaney, M. (2010) · IEEE Transactions on Audio Speech and Language Processing · doi:10.1109/tasl.2010.2041108 · Cited by 26
Cited by
Semidefinite Relaxation of Quadratic Optimization Problems
Luo, Z.-Q., Ma, W.-K., So, A., Ye, Y., & Zhang, S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936019 · Cited by 3,715
OSQP: an operator splitting solver for quadratic programs
Stellato, B., Banjac, G., Goulart, P., Bemporad, A., & Boyd, S. (2020) · Mathematical Programming Computation · doi:10.1007/s12532-020-00179-2 · Cited by 1,213
Self-citationCVXGEN: a code generator for embedded convex optimization
Mattingley, J., & Boyd, S. (2012) · Optimization and Engineering · doi:10.1007/s11081-011-9176-9 · Cited by 790
Self-citationConvex Optimization-Based Beamforming
Gershman, A., Sidiropoulos, N., Shahbazpanahi, S., Bengtsson, M., & Ottersten, B. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936015 · Cited by 571
Model Predictive Control for Vehicle Stabilization at the Limits of Handling
Beal, C. E., & Gerdes, J. C. (2013) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2012.2200826 · Cited by 465
Metadata
- Authors
- Mattingley, J., & Boyd, S.
- Venue
- IEEE Signal Processing Magazine
- Published
- 2010-05
- Volume
- 27
- Issue
- 3
- Pages
- 50-61
- ISSN
- 1053-5888 (ISSN-L)
- OpenAlex
- W2101986122
- Cited by
- 300
- References
- 69
- FWCI
- 25.58
- Type
- journal article
- Language
- en
- Open access
- closed
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.