The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Semidefinite Programming
Abstract
In semidefinite programming, one minimizes a linear function subject to the constraint that an affine combination of symmetric matrices is positive semidefinite. Such a constraint is nonlinear and nonsmooth, but convex, so semidefinite programs are convex optimization problems. semidefinite programming unifies several standard problems (e.g., linear and quadratic programming) and finds many applications in engineering and combinatorial optimization. Although semidefinite programs are much more general than linear programs, they are not much harder to solve. Most interior-point methods for linear programming have been generalized to semidefinite programs. As in linear programming, these methods have polynomial worst-case complexity and perform very well in practice. This paper gives a survey of the theory and applications of semidefinite programs and an introduction to primaldual interior-point methods for their solution.
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
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-citationRockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
A new polynomial-time algorithm for linear programming
Karmarkar, N. (1984) · Combinatorica · doi:10.1007/bf02579150 · Cited by 4,794
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
Paige, C. C., & Saunders, M. A. (1982) · ACM Transactions on Mathematical Software · doi:10.1145/355984.355989 · Cited by 4,387
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
Geometric Algorithms and Combinatorial Optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1988) · Algorithms and Combinatorics · doi:10.1007/978-3-642-97881-4 · Cited by 3,431
Axelsson, O. (1994) · Cambridge University Press eBooks · doi:10.1017/cbo9780511624100 · Cited by 2,085
Solution of Sparse Indefinite Systems of Linear Equations
Paige, C. C., & Saunders, M. A. (1975) · SIAM Journal on Numerical Analysis · doi:10.1137/0712047 · Cited by 1,620
Minimization Methods for Non-Differentiable Functions
Shor, N. Z. (1985) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-82118-9 · Cited by 1,551
On a Theorem of Weyl Concerning Eigenvalues of Linear Transformations I
Fan, K. (1949) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.35.11.652 · Cited by 1,016
Cited by
A Comprehensive Survey on Transfer Learning
Zhuang, F., Qi, Z., Duan, K., Xi, D., Zhu, Y., Zhu, H., Xiong, H., & He, Q. (2021) · Proceedings of the IEEE · doi:10.1109/jproc.2020.3004555 · Cited by 6,678
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
Distance Metric Learning for Large Margin Nearest Neighbor Classification
Weinberger, K. Q., & Saul, L. K. (2009) · Journal of Machine Learning Research · doi:10.5555/1577069.1577078 · Cited by 4,044
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
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., & Parrilo, P. A. (2010) · SIAM Review · doi:10.1137/070697835 · Cited by 3,471
Graphical Models, Exponential Families, and Variational Inference
Wainwright, M. J., & Jordan, M. I. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601981851 · Cited by 2,959
Fast linear iterations for distributed averaging
Xiao, L., & Boyd, S. (2004) · Systems & Control Letters · doi:10.1016/j.sysconle.2004.02.022 · Cited by 2,706
Self-citationGraph Implementations for Nonsmooth Convex Programs
Grant, M. C., & Boyd, S. P. (2007) · Lecture Notes in Control and Information Sciences · doi:10.1007/978-1-84800-155-8_7 · Cited by 2,666
Self-citationGlobal Optimization with Polynomials and the Problem of Moments
Lasserre, J. B. (2001) · SIAM Journal on Optimization · doi:10.1137/s1052623400366802 · Cited by 2,474
Gühne, O., & Tóth, G. (2009) · Physics Reports · doi:10.1016/j.physrep.2009.02.004 · Cited by 2,401
Applications of second-order cone programming
Lobo, M. S., Vandenberghe, L., Boyd, S., & Lebret, H. (1998) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(98)10032-0 · Cited by 2,401
Self-citationA Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications
Cai, H., Zheng, V. W., & Chang, K. C.-C. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2807452 · Cited by 2,034
A cone complementarity linearization algorithm for static output-feedback and related problems
El Ghaoui, L., Oustry, F., & AitRami, M. (1997) · IEEE Transactions on Automatic Control · doi:10.1109/9.618250 · Cited by 2,027
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
Graphical Models, Exponential Families, and Variational Inference
Wainwright, M. J., & Jordan, M. I. (2008) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000001 · Cited by 1,820
Semidefinite programming relaxations for semialgebraic problems
Parrilo, P. A. (2003) · Mathematical Programming · doi:10.1007/s10107-003-0387-5 · Cited by 1,527
Alizadeh, F., & Goldfarb, D. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0339-5 · Cited by 1,500
Solving 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
Phase Retrieval with Application to Optical Imaging: A contemporary overview
Shechtman, Y., Eldar, Y. C., Cohen, O., Chapman, H. N., Miao, J., & Segev, M. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2014.2352673 · Cited by 1,131
Protein function prediction via graph kernels
Borgwardt, K. M., Ong, C. S., Schonauer, S., Vishwanathan, S. V. N., Smola, A. J., & Kriegel, H.-P. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti1007 · Cited by 1,105
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-citationIterative Water-Filling for Gaussian Vector Multiple-Access Channels
Yu, W., Rhee, W., Boyd, S., & Cioffi, J. M. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.821988 · Cited by 1,026
Self-citationA non-divergent estimation algorithm in the presence of unknown correlations
Julier, S. J., & Uhlmann, J. K. (1997) · Proceedings of the 1997 American Control Conference (Cat. No.97CH36041) · doi:10.1109/acc.1997.609105 · Cited by 999
Exact matrix completion via convex optimization
Candès, E., & Recht, B. (2012) · Communications of the ACM · doi:10.1145/2184319.2184343 · Cited by 996
All you need to know about model predictive control for buildings
Drgoňa, J., Arroyo, J., Cupeiro Figueroa, I., Blum, D., Arendt, K., Kim, D., Ollé, E. P., Oravec, J., Wetter, M., Vrabie, D. L., et al. (2020) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2020.09.001 · Cited by 1,020
Joint Transmit Beamforming for Multiuser MIMO Communications and MIMO Radar
Liu, X., Huang, T., Shlezinger, N., Liu, Y., Zhou, J., & Eldar, Y. C. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.3004739 · Cited by 992
Linear precoding via conic optimization for fixed MIMO receivers
Wiesel, A., Eldar, Y. C., & Shamai, S. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.861073 · Cited by 974
A rank minimization heuristic with application to minimum order system approximation
Fazel, M., Hindi, H., & Boyd, S. P. (2001) · Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148) · doi:10.1109/acc.2001.945730 · Cited by 956
Self-citationRobust Solutions to Uncertain Semidefinite Programs
El Ghaoui, L., Oustry, F., & Lebret, H. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496305717 · Cited by 935
Fifty Years of MIMO Detection: The Road to Large-Scale MIMOs
Yang, S., & Hanzo, L. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2475242 · Cited by 814
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-citationA nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
Burer, S., & Monteiro, R. D. C. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0352-8 · Cited by 770
Fastest Mixing Markov Chain on a Graph
Boyd, S., Diaconis, P., & Xiao, L. (2004) · SIAM Review · doi:10.1137/s0036144503423264 · Cited by 744
Self-citationPotra, F. A., & Wright, S. J. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00433-7 · Cited by 726
A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
Navascués, M., Pironio, S., & Acín, A. (2008) · New Journal of Physics · doi:10.1088/1367-2630/10/7/073013 · Cited by 721
Interior Methods for Nonlinear Optimization
Forsgren, A., Gill, P. E., & Wright, M. H. (2002) · SIAM Review · doi:10.1137/s0036144502414942 · Cited by 699
Convex Programming Approach to Powered Descent Guidance for Mars Landing
Acikmese, B., & Ploen, S. R. (2007) · Journal of Guidance, Control, and Dynamics · doi:10.2514/1.27553 · Cited by 697
Unsupervised Learning of Image Manifolds by Semidefinite Programming
Weinberger, K. Q., & Saul, L. K. (2006) · International Journal of Computer Vision · doi:10.1007/s11263-005-4939-z · Cited by 692
Rank-Sparsity Incoherence for Matrix Decomposition
Chandrasekaran, V., Sanghavi, S., Parrilo, P. A., & Willsky, A. S. (2011) · SIAM Journal on Optimization · doi:10.1137/090761793 · Cited by 686
Adversarial Attacks and Defenses in Images, Graphs and Text: A Review
Xu, H., Ma, Y., Liu, H.-C., Deb, D., Liu, H., Tang, J.-L., & Jain, A. K. (2020) · International Journal of Automation and Computing · doi:10.1007/s11633-019-1211-x · Cited by 679
A Direct Formulation for Sparse PCA Using Semidefinite Programming
d'Aspremont, A., El Ghaoui, L., Jordan, M. I., & Lanckriet, G. R. G. (2007) · SIAM Review · doi:10.1137/050645506 · Cited by 678
A statistical framework for genomic data fusion
Lanckriet, G. R. G., De Bie, T., Cristianini, N., Jordan, M. I., & Noble, W. S. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth294 · Cited by 671
A rewriting system for convex optimization problems
Agrawal, A., Verschueren, R., Diamond, S., & Boyd, S. (2018) · Journal of Control and Decision · doi:10.1080/23307706.2017.1397554 · Cited by 669
Self-citationWorst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
Ghaoui, L. E., Oks, M., & Oustry, F. (2003) · Operations Research · doi:10.1287/opre.51.4.543.16101 · Cited by 662
Uncertain convex programs: randomized solutions and confidence levels
Calafiore, G., & Campi, M. C. (2005) · Mathematical Programming · doi:10.1007/s10107-003-0499-y · Cited by 659
Determinant Maximization with Linear Matrix Inequality Constraints
Vandenberghe, L., Boyd, S., & Wu, S.-P. (1998) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479896303430 · Cited by 652
Self-citationSums of Squares, Moment Matrices and Optimization Over Polynomials
Laurent, M. (2009) · The IMA Volumes in Mathematics and its Applications · doi:10.1007/978-0-387-09686-5_7 · Cited by 648
Safety Verification of Hybrid Systems Using Barrier Certificates
Prajna, S., & Jadbabaie, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24743-2_32 · Cited by 642
Robustness of Coherence: An Operational and Observable Measure of Quantum Coherence
Napoli, C., Bromley, T. R., Cianciaruso, M., Piani, M., Johnston, N., & Adesso, G. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.150502 · Cited by 581
Fazel, M., Hindi, H., & Boyd, S. P. (2004) · Proceedings of the 2003 American Control Conference, 2003. · doi:10.1109/acc.2003.1243393 · Cited by 574
Self-citationTransmit beamforming for MIMO radar systems using signal cross-correlation
Fuhrmann, D. R., & San Antonio, G. (2008) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2008.4516997 · Cited by 567
Convex Optimization in Signal Processing and Communications
(2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511804458 · Cited by 554
Bounding the Set of Quantum Correlations
Navascués, M., Pironio, S., & Acín, A. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.010401 · Cited by 551
Introducing SOSTOOLS: a general purpose sum of squares programming solver
Prajna, S., Papachristodoulou, A., & Parrilo, P. A. (2003) · Proceedings of the 41st IEEE Conference on Decision and Control, 2002. · doi:10.1109/cdc.2002.1184594 · Cited by 545
Estimation of (near) low-rank matrices with noise and high-dimensional scaling
Negahban, S., & Wainwright, M. J. (2011) · The Annals of Statistics · doi:10.1214/10-aos850 · Cited by 537
Adjiman, C. S., Dallwig, S., Floudas, C. A., & Neumaier, A. (1998) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(98)00027-1 · Cited by 526
Antenna 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-citationQuantum machine learning: a classical perspective
Ciliberto, C., Herbster, M., Ialongo, A. D., Pontil, M., Rocchetto, A., Severini, S., & Wossnig, L. (2018) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2017.0551 · Cited by 518
Learning a kernel matrix for nonlinear dimensionality reduction
Weinberger, K. Q., Sha, F., & Saul, L. K. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015345 · Cited by 517
Ge, X., Han, Q.-L., & Wang, Z. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2769722 · Cited by 500
Xia, F., Sun, K., Yu, S., Aziz, A., Wan, L., Pan, S., & Liu, H. (2021) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2021.3076021 · Cited by 473
Quantum steering: a review with focus on semidefinite programming
Cavalcanti, D., & Skrzypczyk, P. (2017) · Reports on Progress in Physics · doi:10.1088/1361-6633/80/2/024001 · Cited by 454
Optimal Inequalities in Probability Theory: A Convex Optimization Approach
Bertsimas, D., & Popescu, I. (2005) · SIAM Journal on Optimization · doi:10.1137/s1052623401399903 · Cited by 428
Complete family of separability criteria
Doherty, A. C., Parrilo, P. A., & Spedalieri, F. M. (2004) · Physical Review A · doi:10.1103/physreva.69.022308 · Cited by 418
Interior Point Methods for Nonlinear Optimization
Pólik, I., & Terlaky, T. (2010) · Lecture Notes in Mathematics · doi:10.1007/978-3-642-11339-0_4 · Cited by 394
Chadli, M., & Karimi, H. R. (2013) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2012.2197215 · Cited by 388
RetractedLearning the Kernel Matrix with Semi-Definite Programming
Lanckriet, G. R. G., Christianini, N., Bartlett, P. L., Ghaoui, L. E., & Jordan, M. I. (2002) · QUT ePrints (Queensland University of Technology) · doi:10.5555/1005332.1005334 · Cited by 386
A new autocovariance least-squares method for estimating noise covariances
Odelson, B. J., Rajamani, M. R., & Rawlings, J. B. (2006) · Automatica · doi:10.1016/j.automatica.2005.09.006 · Cited by 380
Minimum-Landing-Error Powered-Descent Guidance for Mars Landing Using Convex Optimization
Blackmore, L., Açikmeşe, B., & Scharf, D. P. (2010) · Journal of Guidance, Control, and Dynamics · doi:10.2514/1.47202 · Cited by 378
Interior point methods 25 years later
Gondzio, J. (2012) · European Journal of Operational Research · doi:10.1016/j.ejor.2011.09.017 · Cited by 377
Tao, D., Li, X., Hu, W., Maybank, S., & Wu, X. (2006) · Fifth IEEE International Conference on Data Mining (ICDM'05) · doi:10.1109/icdm.2005.139 · Cited by 373
GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi
Henrion, D., & Lasserre, J.-B. (2003) · ACM Transactions on Mathematical Software · doi:10.1145/779359.779363 · Cited by 369
The scenario approach for systems and control design
Campi, M. C., Garatti, S., & Prandini, M. (2009) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2009.07.001 · Cited by 367
Alternating direction augmented Lagrangian methods for semidefinite programming
Wen, Z., Goldfarb, D., & Yin, W. (2010) · Mathematical Programming Computation · doi:10.1007/s12532-010-0017-1 · Cited by 359
Distinguishing Separable and Entangled States
Doherty, A. C., Parrilo, P. A., & Spedalieri, F. M. (2002) · Physical Review Letters · doi:10.1103/physrevlett.88.187904 · Cited by 352
Priebe, K. E., Rathje, C., Yalunin, S. V., Hohage, T., Feist, A., Schäfer, S., & Ropers, C. (2017) · Nature Photonics · doi:10.1038/s41566-017-0045-8 · Cited by 351
Bootstrapping the O(N ) vector models
Kos, F., Poland, D., & Simmons-Duffin, D. (2014) · Journal of High Energy Physics · doi:10.1007/jhep06(2014)091 · Cited by 350
Portfolio optimization with linear and fixed transaction costs
Lobo, M. S., Fazel, M., & Boyd, S. (2007) · Annals of Operations Research · doi:10.1007/s10479-006-0145-1 · Cited by 350
Self-citationFunnel libraries for real-time robust feedback motion planning
Majumdar, A., & Tedrake, R. (2017) · The International Journal of Robotics Research · doi:10.1177/0278364917712421 · Cited by 350
Quantum optics of chiral spin networks
Pichler, H., Ramos, T., Daley, A. J., & Zoller, P. (2015) · Physical Review A · doi:10.1103/physreva.91.042116 · Cited by 347
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Ma, W.-K., Davidson, T. N., Wong, K. M., Luo, Z.-Q., & Ching, P.-C. (2002) · IEEE Transactions on Signal Processing · doi:10.1109/78.992139 · Cited by 346
Towards IP geolocation using delay and topology measurements
Katz-Bassett, E., John, J. P., Krishnamurthy, A., Wetherall, D., Anderson, T., & Chawathe, Y. (2006) · Proceedings of the 6th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1177080.1177090 · Cited by 346
Wright, M. (2004) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-04-01040-7 · Cited by 345
The QC Relaxation: A Theoretical and Computational Study on Optimal Power Flow
Coffrin, C., Hijazi, H. L., & Van Hentenryck, P. (2016) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2015.2463111 · Cited by 341
On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
Pataki, G. (1998) · Mathematics of Operations Research · doi:10.1287/moor.23.2.339 · Cited by 332
Sparse methods for direction-of-arrival estimation
Yang, Z., Li, J., Stoica, P., & Xie, L. (2018) · Academic Press Library in Signal Processing, Volume 7 · doi:10.1016/b978-0-12-811887-0.00011-0 · Cited by 332
Angular synchronization by eigenvectors and semidefinite programming
Singer, A. (2011) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2010.02.001 · Cited by 329
Taming Multiparticle Entanglement
Jungnitsch, B., Moroder, T., & Gühne, O. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.190502 · Cited by 326
Optimal Scaling of a Gradient Method for Distributed Resource Allocation
Xiao, L., & Boyd, S. (2006) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-006-9080-1 · Cited by 326
Self-citationA semidefinite program for distillable entanglement
Rains, E. M. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.959270 · Cited by 326
KERNEL-BASED DATA FUSION AND ITS APPLICATION TO PROTEIN FUNCTION PREDICTION IN YEAST
LANCKRIET, G. R. G., DENG, M., CRISTIANINI, N., JORDAN, M. I., & NOBLE, W. S. (2003) · Biocomputing 2004 · doi:10.1142/9789812704856_0029 · Cited by 321
Learning with Augmented Features for Heterogeneous Domain Adaptation
Duan, L., Xu, D., & Tsang, I. (2012) · arXiv · doi:10.48550/arxiv.1206.4660 · Cited by 320
MIMO Transceiver Design via Majorization Theory
Palomar, D. P., & Jiang, Y. (2007) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000018 · Cited by 320
Space‐Time Processing for MIMO Communications
(2005) · Wiley eBooks · doi:10.1002/0470010045 · Cited by 319
Robust Markov Decision Processes
Wiesemann, W., Kuhn, D., & Rustem, B. (2013) · Mathematics of Operations Research · doi:10.1287/moor.1120.0566 · Cited by 312
Testing the Dimension of Hilbert Spaces
Brunner, N., Pironio, S., Acin, A., Gisin, N., Méthot, A. A., & Scarani, V. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.210503 · Cited by 304
Metadata
- Authors
- Vandenberghe, L., & Boyd, S.
- Venue
- SIAM Review
- Published
- 1996-03
- Volume
- 38
- Issue
- 1
- Pages
- 49-95
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2912522929
- Cited by
- 4,105
- References
- 37
- FWCI
- 80.65
- 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.