Optimal portfolio deleveraging under market impact and margin restrictions

Abstract We consider the problem of optimally deleveraging a high net-worth long-short portfolio in a short time period to position the fund favorably with respect to leverage and margin risks, in the face of an adverse outlook on future uncertainty. We develop a generalized mean-variance deleveraging optimization model that accounts for market impact costs in portfolio trading under market illiquidity. Due to asset price impact stemming from both volume and intensity of trading, the model has significant non-convexities. For portfolios with a large number of assets, the model is not solvable using standard software, and thus, we employ an efficient solution scheme based on dual optimization, along with a sequence of progressively-improving feasible portfolios computed under convex approximation. Our computational analysis using real data on ETF assets provides new insights on performance sensitivity. In particular, ignoring market impact severely downgrades portfolio performance depending on leverage and margin policies, as well as market liquidity conditions. Such insights can guide portfolio managers in setting deleveraging policy parameters ex-ante when faced with potential market turbulence. We also test the solution algorithm using random problem instances under thousands of assets to demonstrate the scalability and solvability of the deleveraging model.

[1]  Chanaka Edirisinghe,et al.  Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time , 2017, Math. Program..

[2]  Chanaka Edirisinghe,et al.  Indefinite multi-constrained separable quadratic optimization: Large-scale efficient solution , 2019, Eur. J. Oper. Res..

[3]  M. Pourahmadi,et al.  Distribution of random correlation matrices: Hyperspherical parameterization of the Cholesky factor , 2015 .

[4]  Andrea Lodi,et al.  QPLIB: a library of quadratic programming instances , 2018, Mathematical Programming Computation.

[5]  K. Schmedders,et al.  Collateral Requirements and Asset Prices , 2013, SSRN Electronic Journal.

[6]  Cheng Lu,et al.  A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming , 2018, Journal of Global Optimization.

[7]  Shouyang Wang,et al.  Preface — Special issue to celebrate the 30th anniversary of Journal of Systems Science and Complexity , 2017, Journal of Systems Science and Complexity.

[8]  Christoph Buchheim,et al.  Semidefinite relaxations for non-convex quadratic mixed-integer programming , 2012, Mathematical Programming.

[9]  Andrew Ang,et al.  Hedge Fund Leverage , 2010 .

[10]  Samuel Burer,et al.  Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound , 2009, Comput. Optim. Appl..

[11]  Alan L. Yuille,et al.  The Concave-Convex Procedure , 2003, Neural Computation.

[12]  Robert Almgren,et al.  Optimal execution with nonlinear impact functions and trading-enhanced risk , 2003 .

[13]  Panos M. Pardalos,et al.  Quadratic Programming with Box Constraints , 1997 .

[14]  Philippe Jorion,et al.  Risk Management Lessons from Long-Term Capital Management , 1999 .

[15]  David B. Brown,et al.  Optimal Portfolio Liquidation with Distress Risk , 2010, Manag. Sci..

[16]  Jim Gatheral,et al.  Optimal Trade Execution under Geometric Brownian Motion in the Almgren and Chriss Framework , 2011 .

[17]  Robert Almgren,et al.  Optimal execution of portfolio trans-actions , 2000 .

[18]  Min Sun,et al.  An adaptive Lagrangian algorithm for optimal portfolio deleveraging with cross-impact , 2017, J. Syst. Sci. Complex..

[19]  Jiming Peng,et al.  Optimal deleveraging with nonlinear temporary price impact , 2015, Eur. J. Oper. Res..

[20]  Stephen P. Boyd,et al.  Variations and extension of the convex–concave procedure , 2016 .

[21]  Gert R. G. Lanckriet,et al.  A Proof of Convergence of the Concave-Convex Procedure Using Zangwill's Theory , 2012, Neural Computation.

[22]  Duane J. Seppi,et al.  Episodic Liquidity Crises: Cooperative and Predatory Trading , 2007 .

[23]  Kenneth N. Levy,et al.  Leverage Aversion, Efficient Frontiers, and the Efficient Region , 2013 .

[24]  RICCARDO CAMBINI,et al.  Decomposition Methods for Solving Nonconvex Quadratic Programs via Branch and Bound* , 2005, J. Glob. Optim..

[25]  Alexander Schied,et al.  Optimal Basket Liquidation for CARA Investors is Deterministic , 2010 .

[26]  Jiming Peng,et al.  Analytical Results and Efficient Algorithm for Optimal Portfolio Deleveraging with Market Impact , 2013, Oper. Res..

[27]  Samuel Burer,et al.  A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations , 2008, Math. Program..

[28]  Andrea Frazzini,et al.  Leverage Aversion and Risk Parity , 2012 .

[29]  Le Thi Hoai An,et al.  A Branch and Bound Method via d.c. Optimization Algorithms and Ellipsoidal Technique for Box Constrained Nonconvex Quadratic Problems , 1998, J. Glob. Optim..

[30]  Nikolaos V. Sahinidis,et al.  Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons , 2011, Math. Program..

[31]  Kenneth N. Levy,et al.  Leverage Aversion and Portfolio Optimality , 2011 .

[32]  Jeff T. Linderoth A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs , 2005, Math. Program..