메뉴 건너뛰기




Volumn 135, Issue 3, 2007, Pages 531-547

An algorithm for portfolio optimization with variable transaction costs, part 2: Computational analysis

Author keywords

Convex programming; Portfolio optimization; Variable transaction costs

Indexed keywords

COST BENEFIT ANALYSIS; FINANCIAL DATA PROCESSING; PROBLEM SOLVING;

EID: 36148981858     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/s10957-007-9249-2     Document Type: Article
Times cited : (8)

References (10)
  • 1
    • 27744523602 scopus 로고    scopus 로고
    • An algorithm for portfolio optimization with transaction costs
    • Best, M.J., Hlouskova, J.: An algorithm for portfolio optimization with transaction costs. Manag. Sci. 51, 1676-1688 (2005)
    • (2005) Manag. Sci. , vol.51 , pp. 1676-1688
    • Best, M.J.1    Hlouskova, J.2
  • 2
    • 73849145502 scopus 로고    scopus 로고
    • Quadratic programming for large-scale portfolio optimization
    • CRC Press Boca Raton
    • Best, M.J., Kale, J.K.: Quadratic programming for large-scale portfolio optimization. In: Keyes, J. (ed.) Financial Services Information Systems, pp. 513-529. CRC Press, Boca Raton (2000)
    • (2000) Financial Services Information Systems , pp. 513-529
    • Best, M.J.1    Kale, J.K.2    Keyes, J.3
  • 3
    • 85139378984 scopus 로고    scopus 로고
    • An algorithm for portfolio optimization with variable transaction costs, Part 1: Theory
    • in press
    • Best, M.J., Hlouskova, J.: An algorithm for portfolio optimization with variable transaction costs, Part 1: theory. J. Optim. Theory Appl. (in press)
    • J. Optim. Theory Appl.
    • Best, M.J.1    Hlouskova, J.2
  • 5
    • 0041114635 scopus 로고
    • Capital asset pricing compatible with observed market value weights
    • Best, M.J., Grauer, R.R.: Capital asset pricing compatible with observed market value weights. J. Finance 40, 85-103 (1985)
    • (1985) J. Finance , vol.40 , pp. 85-103
    • Best, M.J.1    Grauer, R.R.2
  • 6
    • 27744592185 scopus 로고
    • The symmetric formulation of the simplex method for quadratic programming
    • Van De Panne, C., Whinston, A.: The symmetric formulation of the simplex method for quadratic programming. Econometrica 37, 507-527 (1969)
    • (1969) Econometrica , vol.37 , pp. 507-527
    • Van De Panne, C.1    Whinston, A.2
  • 8
    • 0025791858 scopus 로고
    • 3 L) primal interior point algorithm for convex quadratic programming
    • 3 L) primal interior point algorithm for convex quadratic programming. Math. Program. 49, 325-340 (1991)
    • (1991) Math. Program. , vol.49 , pp. 325-340
    • Goldfarb, D.1    Liu, S.2
  • 9
    • 0024665753 scopus 로고
    • Interior path following primal-dual algorithms, Part 2: Convex quadratic programming
    • Monteiro, R.D.C., Adler, I.: Interior path following primal-dual algorithms, Part 2: Convex quadratic programming. Math. Program. 44, 43-66 (1989)
    • (1989) Math. Program. , vol.44 , pp. 43-66
    • Monteiro, R.D.C.1    Adler, I.2
  • 10
    • 0000783956 scopus 로고
    • A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension
    • 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. 15, 191-214 (1990)
    • (1990) Math. Oper. Res. , vol.15 , pp. 191-214
    • Monteiro, R.D.C.1    Adler, I.2    Resende, M.G.C.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.