Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding
Open accessThe DOI matches its Crossref record; 108 of the 109 references it cites were found in a registry or an index.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“This is achieved by automatically transforming the original problem instances into standard conic programming forms, followed by calling the advanced off-theshelf conic solvers, e.g., MOSEK [296] and SCS [113].”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [113]
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 · cited 1×
“This problem, known as the lasso [98], is widely studied in high-dimensional statistics, machine learning, and compressed sensing.”
BackgroundGolub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
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-citationIterative Methods for Sparse Linear Systems
Saad, Y. (2003) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718003 · Cited by 13,790 · cited 1×
“This system is then solved with the conjugate gradient method (CG) [72, 75, 76].”
Method(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-citationRockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
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 · cited 1×
“jl [89], and YALMIP [90].”
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
Research works printed but not linked: 5
- O’Donoghue, B.: Suboptimal control policies via convex optimization. Ph.D. thesis, Stanford University (2012)
- Monteiro, R., Ortiz, C., Svaiter, B.: An inexact block-decomposition method for extra large-scale conic semidefinite programming. Optimization-online preprint 4158, 1–21 (2013)
- Franklin, G., Powell, J., Emami-Naeini, A.: Feedback Control of Dynamic Systems, vol. 3. Addison-Wesley, Reading, MA (1994)
- OpenMP Architecture Review Board: OpenMP application program interface version 3.0. http://www.openmp.org/mp-documents/spec30.pdf (2008)
- Markowitz, H.: Portfolio selection. J. Finance 7(1), 77–91 (1952)
Cited by
CVXPY: A Python-Embedded Modeling Language for Convex Optimization.
Diamond, S., & Boyd, S. (2016) · PubMed · Cited by 1,648
Self-citationCVXPY: A Python-Embedded Modeling Language for Convex Optimization
Diamond, S., & Boyd, S. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.00943 · Cited by 462
“CVXPY interfaces with the open-source cone solvers CVX-OPT (Andersen et al., 2015), ECOS (Domahidi et al., 2013), and SCS (O’Donoghue et al., 2016), which are implemented in combinations of Python and C.”
MethodSelf-citationOSQP: 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-citationLattimore, T., & Szepesvári, C. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108571401 · Cited by 976
Edge artificial intelligence for 6g: vision, enabling technologies, and applications
Letaief, K. B., Shi, Y., Lu, J., & Lu, J. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3126076 · Cited by 829
“This is achieved by automatically transforming the original problem instances into standard conic programming forms, followed by calling the advanced off-the-shelf conic solvers, e.g., MOSEK [296] and SCS [113].”
Method
Metadata
- Authors
- O’Donoghue, B., Chu, E., Parikh, N., & Boyd, S.
- Affiliations
- Stanford University (US)
- Corresponding author
- O’Donoghue, Brendan
- Venue
- Journal of Optimization Theory and Applications
- Published
- 2016-02-22
- Volume
- 169
- Issue
- 3
- Pages
- 1042-1068
- ISSN
- 0022-3239 (ISSN-L)
- 1573-2878
- OpenAlex
- W2288174618
- Cited by
- 664
- References
- 109
- Citations by year
- 2026: 50 · 2025: 68 · 2024: 65 · 2023: 58 · 2022: 66 · 2021: 65 · 2020: 122 · 2019: 60 · 2018: 41 · 2017: 35 · 2016: 28
- FWCI
- 59.04
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- www.springer.com/tdm (vor)
- Locations
- Journal of Optimization Theory and Applications (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- arXiv (Cornell University)
- Funders
- Defense Advanced Research Projects Agency (FA8750-12-2-0306)
- National Science Foundation (DGE-0645962)
- Topics
- Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
- Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
- Keywords
- conic optimization, operator splitting, alternating direction method of multipliers, first-order methods, feasibility problem, subspace projection, parameter-free method, second-order cone, large-scale 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding. https://app.cochat.ai/papers/10.1007/s10957-016-0892-3
- The paper
- O’Donoghue, B., Chu, E., Parikh, N., & Boyd, S. (2016). Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding. Journal of Optimization Theory and Applications. https://doi.org/10.1007/s10957-016-0892-3
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.