Effective algorithms for optimal portfolio deleveraging problem with cross impact
From MaRDI portal
Publication:6178391
DOI10.1111/MAFI.12383zbMATH Open1530.91531arXiv2012.07368OpenAlexW3169262658MaRDI QIDQ6178391FDOQ6178391
Author name not available (Why is that?)
Publication date: 18 January 2024
Published in: Mathematical Finance (Search for Journal in Brave)
Abstract: We investigate the optimal portfolio deleveraging (OPD) problem with permanent and temporary price impacts, where the objective is to maximize equity while meeting a prescribed debt/equity requirement. We take the real situation with cross impact among different assets into consideration. The resulting problem is, however, a non-convex quadratic program with a quadratic constraint and a box constraint, which is known to be NP-hard. In this paper, we first develop a successive convex optimization (SCO) approach for solving the OPD problem and show that the SCO algorithm converges to a KKT point of its transformed problem. Second, we propose an effective global algorithm for the OPD problem, which integrates the SCO method, simple convex relaxation and a branch-and-bound framework, to identify a global optimal solution to the OPD problem within a pre-specified -tolerance. We establish the global convergence of our algorithm and estimate its complexity. We also conduct numerical experiments to demonstrate the effectiveness of our proposed algorithms with both the real data and the randomly generated medium- and large-scale OPD problem instances.
Full work available at URL: https://arxiv.org/abs/2012.07368
convex relaxationbranch-and-boundnonconvex quadratic programsuccessive convex optimizationoptimal portfolio deleveragingcross-asset price impact
Cites Work
- BARON: A general purpose global optimization software package
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
- Variations and extension of the convex-concave procedure
- A Survey of the S-Lemma
- On the simultaneous diagonalization of two semi-definite matrices
- Optimal Portfolio Liquidation with Distress Risk
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems
- Semidefinite relaxation and nonconvex quadratic optimization
- Title not available (Why is that?)
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A local search method for optimization problem with d.c. inequality constraints
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Sequential Convex Approximations to Joint Chance Constrained Programs: A Monte Carlo Approach
- DC Programming and DCA for General DC Programs
- Optimal deleveraging with nonlinear temporary price impact
- Analytical Results and Efficient Algorithm for Optimal Portfolio Deleveraging with Market Impact
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Necessary conditions for ε-optimality
- Approximating quadratic programming with bound and quadratic constraints
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Nonlinear Optimization by Successive Linear Programming
- On the complexity of approximating a KKT point of quadratic programming
- Fire sales forensics: measuring endogenous risk
- SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices
- Strategic Cross-Trading in the U.S. Stock Market*
- An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties
- Trading co‐integrated assets with price impact
Cited In (2)
This page was built for publication: Effective algorithms for optimal portfolio deleveraging problem with cross impact
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6178391)
