Optimization of a long-short portfolio under nonconvex transaction cost

Hiroshi Konno, Keisuke Akishino, Rei Yamamoto

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

The purpose of this paper is to propose a practical branch and bound algorithm for solving a class of long-short portfolio optimization problem with concave and d.c. transaction cost and complementarity conditions on the variables. We will show that this algorithm can solve a problem of practical size and that the long-short strategy leads to a portfolio with significantly better risk-return structure compared with standard purchase only portfolio both in terms of ex-ante and ex-post performance.

Original languageEnglish
Pages (from-to)115-132
Number of pages18
JournalComputational Optimization and Applications
Volume32
Issue number1-2
DOIs
Publication statusPublished - 2005 Oct 1
Externally publishedYes

Fingerprint

Portfolio Optimization
Transaction Costs
Complementarity
Branch and Bound Algorithm
Optimization Problem
Optimization
Costs
Class
Strategy
Standards
Optimization problem
Purchase
Transaction costs
Risk-return
Portfolio optimization
Branch and bound algorithm

Keywords

  • Branch and bound algorithm
  • Concave cost
  • d.c. cost
  • Global optimization
  • Long-short portfolio
  • Portfolio theory

ASJC Scopus subject areas

  • Applied Mathematics
  • Control and Optimization
  • Management Science and Operations Research
  • Computational Mathematics

Cite this

Optimization of a long-short portfolio under nonconvex transaction cost. / Konno, Hiroshi; Akishino, Keisuke; Yamamoto, Rei.

In: Computational Optimization and Applications, Vol. 32, No. 1-2, 01.10.2005, p. 115-132.

Research output: Contribution to journalArticle

@article{dad750188ea64959a93e4f746ed1cb40,
title = "Optimization of a long-short portfolio under nonconvex transaction cost",
abstract = "The purpose of this paper is to propose a practical branch and bound algorithm for solving a class of long-short portfolio optimization problem with concave and d.c. transaction cost and complementarity conditions on the variables. We will show that this algorithm can solve a problem of practical size and that the long-short strategy leads to a portfolio with significantly better risk-return structure compared with standard purchase only portfolio both in terms of ex-ante and ex-post performance.",
keywords = "Branch and bound algorithm, Concave cost, d.c. cost, Global optimization, Long-short portfolio, Portfolio theory",
author = "Hiroshi Konno and Keisuke Akishino and Rei Yamamoto",
year = "2005",
month = "10",
day = "1",
doi = "10.1007/s10589-005-2056-5",
language = "English",
volume = "32",
pages = "115--132",
journal = "Computational Optimization and Applications",
issn = "0926-6003",
publisher = "Springer Netherlands",
number = "1-2",

}

TY - JOUR

T1 - Optimization of a long-short portfolio under nonconvex transaction cost

AU - Konno, Hiroshi

AU - Akishino, Keisuke

AU - Yamamoto, Rei

PY - 2005/10/1

Y1 - 2005/10/1

N2 - The purpose of this paper is to propose a practical branch and bound algorithm for solving a class of long-short portfolio optimization problem with concave and d.c. transaction cost and complementarity conditions on the variables. We will show that this algorithm can solve a problem of practical size and that the long-short strategy leads to a portfolio with significantly better risk-return structure compared with standard purchase only portfolio both in terms of ex-ante and ex-post performance.

AB - The purpose of this paper is to propose a practical branch and bound algorithm for solving a class of long-short portfolio optimization problem with concave and d.c. transaction cost and complementarity conditions on the variables. We will show that this algorithm can solve a problem of practical size and that the long-short strategy leads to a portfolio with significantly better risk-return structure compared with standard purchase only portfolio both in terms of ex-ante and ex-post performance.

KW - Branch and bound algorithm

KW - Concave cost

KW - d.c. cost

KW - Global optimization

KW - Long-short portfolio

KW - Portfolio theory

UR - http://www.scopus.com/inward/record.url?scp=23944474153&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=23944474153&partnerID=8YFLogxK

U2 - 10.1007/s10589-005-2056-5

DO - 10.1007/s10589-005-2056-5

M3 - Article

AN - SCOPUS:23944474153

VL - 32

SP - 115

EP - 132

JO - Computational Optimization and Applications

JF - Computational Optimization and Applications

SN - 0926-6003

IS - 1-2

ER -