An Algorithm for Portfolio Optimization with Transaction Costs

Published Online:https://doi.org/10.1287/mnsc.1050.0418

References

  • Best M. J., Hlouskova J. Portfolio selection and transaction costs. Comput. Optim. Appl. (2003) 24(1):95–116CrossrefGoogle Scholar
  • Best M. J., Kale J. K., Keyes J. Quadratic programming for large-scale portfolio optimization. Financial Services Information Systems (2000) (CRC Press, Boca Raton) 513–529CrossrefGoogle Scholar
  • Best M. J., Ritter K. A class of accelerated conjugate direction methods for linearly constrained minimization problems. Math. Comput. (1976) 30(135):478–504CrossrefGoogle Scholar
  • Bodie Z., Kane A., Marcus A. J.Investments (1999) 4th ed.(Irwin McGraw-Hill, Boston, MA) Google Scholar
  • Dantzig G. B.Linear Programming and Extensions (1963) (Princeton University Press, Princeton, NJ) CrossrefGoogle Scholar
  • Goldfarb D., Liu S. An O(n3L) primal interior point algorithm for convex quadratic programming. Math. Programming (1991) 49:325–340CrossrefGoogle Scholar
  • Grauer R. R., Hakansson N. H. On the use of mean-variance and quadratic approximations in implementing dynamic investment strategies: A comparison of returns and investment policies. Management Sci. (1993) 39:856–871LinkGoogle Scholar
  • Luenberger D. G.Investment Science (1998) (Oxford University Press, New York) Google Scholar
  • Mangasarian O. L.Nonlinear Programming (1969) (McGraw–Hill, New York) Google Scholar
  • Markowitz H. M.Portfolio Selection: Efficient Diversification of Investment (1959) (John Wiley, New York) Google Scholar
  • Monteiro R. D. C., Adler I. Interior path following primal-dual algorithms. Part II: Convex quadratic programming. Math. Programming (1989) 44:43–66CrossrefGoogle Scholar
  • Monteiro R. D. C., Adler I., Resende M. G. C. A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension. Math. Oper. Res. (1990) 15(2):191–214LinkGoogle Scholar
  • Murty K. G.Operations Research: Deterministic Optimization Models (1995) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
  • van de Panne C., Whinston A. The symmetric formulation of the simplex method for quadratic programming. Econometrica (1969) 37:507–527CrossrefGoogle Scholar
  • Schattman J. B. Portfolio selection under non-convex transaction costs and capital gains taxes. (2000) . Unpublished doctoral dissertationm, Rutgers Center for Operations Research, Rutgers University, Piscataway, NJGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.