The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Second-order cone programming
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
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
A new polynomial-time algorithm for linear programming
Karmarkar, N. (1984) · Combinatorica · doi:10.1007/bf02579150 · Cited by 4,794
Vandenberghe, L., & Boyd, S. (1996) · SIAM Review · doi:10.1137/1038003 · Cited by 4,105
Accuracy and Stability of Numerical Algorithms: Second Edition
Higham, N. J. (2002) · doi:10.1137/1.9780898718027 · Cited by 3,803
Ben-Tal, A., & Nemirovski, A. (1998) · Mathematics of Operations Research · doi:10.1287/moor.23.4.769 · Cited by 2,598
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
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
Computer Solution of Large Sparse Positive Definite Systems.
Pasciak, J. E., George, A., & Liu, J. W. (1982) · Mathematics of Computation · doi:10.2307/2007640 · Cited by 1,874
Robust solutions of uncertain linear programs
Ben-Tal, A., & Nemirovski, A. (1999) · Operations Research Letters · doi:10.1016/s0167-6377(99)00016-4 · Cited by 1,829
Faraut, J., & Korányi, A. (1994) · doi:10.1093/oso/9780198534778.001.0001 · Cited by 1,656
An Interior-Point Method for Semidefinite Programming
Helmberg, C., Rendl, F., Vanderbei, R. J., & Wolkowicz, H. (1996) · SIAM Journal on Optimization · doi:10.1137/0806020 · Cited by 706
Robust solution to least squares problems with uncertain data
Ghaoui, L. E., & Lebret, H. (1997) · Cited by 638
Self-Scaled Barriers and Interior-Point Methods for Convex Programming
Nesterov, Y. E., & Todd, M. J. (1997) · Mathematics of Operations Research · doi:10.1287/moor.22.1.1 · Cited by 612
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
A Primal-Dual Interior Point Algorithm for Linear Programming
Kojima, M., Mizuno, S., & Yoshise, A. (1989) · Springer eBooks · doi:10.1007/978-1-4613-9617-8_2 · Cited by 517
Interior path following primal-dual algorithms. part I: Linear programming
Monteiro, R. D. C., & Adler, I. (1989) · Mathematical Programming · doi:10.1007/bf01587075 · Cited by 486
Alizadeh, F., Haeberly, J.-P. A., & Overton, M. L. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496304700 · Cited by 480
Self-citationLinear systems in Jordan algebras and primal-dual interior-point algorithms
Faybusovich, L. (1997) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(97)00153-2 · Cited by 212
Euclidean Jordan Algebras and Interior-point Algorithms
Faybusovich, L. (1997) · Positivity · doi:10.1023/a:1009701824047 · Cited by 204
FIR Filter Design via Spectral Factorization and Convex Optimization
Wu, S.-P., Boyd, S., & Vandenberghe, L. (1999) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4612-0571-5_5 · Cited by 155
Second order cone programming relaxation of nonconvex quadratic optimization problems
Kim, S., & Kojima, M. (2001) · Optimization methods & software · doi:10.1080/10556780108805819 · Cited by 123
Factorized variable metric methods for unconstrained optimization
Goldfarb, D. (1976) · Mathematics of Computation · doi:10.1090/s0025-5718-1976-0423804-2 · Cited by 65
Self-citationAndersen, K. D. (1996) · ACM Transactions on Mathematical Software · doi:10.1145/232826.232937 · Cited by 50
Cone-LP's and semidefinite programs: Geometry and a simplex-type method
Pataki, G. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61310-2_13 · Cited by 38
Goldfarb, D., & Scheinberg, K. (2004) · Mathematical Programming · doi:10.1007/s10107-003-0377-7 · Cited by 27
Self-citation
Cited by
Graph 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
Sidky, E. Y., & Pan, X. (2008) · Physics in Medicine and Biology · doi:10.1088/0031-9155/53/17/021 · Cited by 1,995
Distributionally Robust Convex Optimization
Wiesemann, W., Kuhn, D., & Sim, M. (2014) · Operations Research · doi:10.1287/opre.2014.1314 · Cited by 947
On the Total Energy Efficiency of Cell-Free Massive MIMO
Ngo, H. Q., Tran, L.-N., Duong, T. Q., Matthaiou, M., & Larsson, E. G. (2018) · IEEE Transactions on Green Communications and Networking · doi:10.1109/tgcn.2017.2770215 · Cited by 863
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
Metadata
- Authors
- Alizadeh, F., & Goldfarb, D.
- Venue
- Mathematical Programming
- Published
- 2003-01-01
- Volume
- 95
- Issue
- 1
- Pages
- 3-51
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2009923109
- Cited by
- 1,500
- References
- 25
- FWCI
- 28.14
- 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.