Portfolio optimization with linear and fixed transaction costs
The DOI matches its Crossref record; 22 of the 22 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.
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
CAPITAL ASSET PRICES: A THEORY OF MARKET EQUILIBRIUM UNDER CONDITIONS OF RISK*
Sharpe, W. F. (1964) · The Journal of Finance · doi:10.1111/j.1540-6261.1964.tb02865.x · Cited by 19,441
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
Lintner, J. (1965) · The Review of Economics and Statistics · doi:10.2307/1924119 · Cited by 6,877
Lintner, J. (1975) · Stochastic Optimization Models in Finance · doi:10.1016/b978-0-12-780850-5.50018-6 · Cited by 6,743
Theory of Linear and Integer Programming
Letchford, A. N., & Schrijver, A. (2000) · The Journal of the Operational Research Society · doi:10.2307/253980 · Cited by 5,515
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (2001) · SIAM Review · doi:10.1137/s003614450037906x · Cited by 5,085
A new polynomial-time algorithm for linear programming
Karmarkar, N. (1984) · Combinatorica · doi:10.1007/bf02579150 · Cited by 4,794
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
Vandenberghe, L., & Boyd, S. (1996) · SIAM Review · doi:10.1137/1038003 · Cited by 4,105
Self-citationSafety First and the Holding of Assets
Roy, A. D. (1952) · Econometrica · doi:10.2307/1907413 · Cited by 2,525
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-citationPrimal-Dual Interior-Point Methods
Wright, S. J. (1997) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971453 · Cited by 2,391
Nonlinear Programming: Sequential Unconstrained Minimization Techniques
Fiacco, A. V., & McCormick, G. P. (1968) · Defense Technical Information Center (DTIC) · Cited by 2,262
Branch-and-Bound Methods: A Survey
Lawler, E. L., & Wood, D. E. (1966) · Operations Research · doi:10.1287/opre.14.4.699 · Cited by 1,997
IEEE Transactions on Signal Processing
(2023) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.78 · Cited by 1,455
Interior Point Algorithms: Theory and Analysis
Ye, Y. (1997) · Wiley eBooks · doi:10.1002/9781118032701 · Cited by 939
Large-Scale Portfolio Optimization
Perold, A. F. (1984) · Management Science · doi:10.1287/mnsc.30.10.1143 · Cited by 415
Delaney, A. H., & Bresler, Y. (1998) · IEEE Transactions on Image Processing · doi:10.1109/83.660997 · Cited by 304
Selecting Portfolios with Fixed Costs and Minimum Transaction Lots
Kellerer, H., Mansini, R., & Speranza, M. G. (2000) · Annals of Operations Research · doi:10.1023/a:1019279918596 · Cited by 162
Sufficient conditions for the convergence of monotonic mathematicalprogramming algorithms
Meyer, R. R. (1976) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(76)80021-9 · Cited by 113
Cited by
Enhancing Sparsity by Reweighted ℓ 1 Minimization
Candès, E. J., Wakin, M. B., & Boyd, S. P. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9045-x · Cited by 4,863
Self-citationGuaranteed 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
Self-citationSensor Selection via Convex Optimization
Joshi, S., & Boyd, S. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.2007095 · Cited by 1,311
Self-citationKim, S.-J., Koh, K., Boyd, S., & Gorinevsky, D. (2009) · SIAM Review · doi:10.1137/070690274 · Cited by 615
Self-citationDesign of Optimal Sparse Feedback Gains via the Alternating Direction Method of Multipliers
Lin, F., Fardad, M., & Jovanovic, M. R. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2257618 · Cited by 385
Metadata
- Authors
- Lobo, M. S., Fazel, M., & Boyd, S.
- Venue
- Annals of Operations Research
- Published
- 2006-12-02
- Volume
- 152
- Issue
- 1
- Pages
- 341-365
- ISSN
- 0254-5330 (ISSN-L)
- 1572-9338
- OpenAlex
- W2155681181
- Cited by
- 350
- References
- 22
- FWCI
- 15.35
- 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.