No open-access location is known for this record yet.
No open-access location is known for this record yet.
Real-time online optimisation plays a crucial role in high-frequency trading (HFT) strategies. The Markowitz model, as a Nobel Prize-winning framework, is widely used for portfolio management optimisation by framing the problem as a constrained quadratic programming task. While conventional analytical methods are typically effective for solving quadratic programming problems with linear constraints, the introduction of both linear equality and inequality constraints in the Markowitz model necessitates the use of numerical methods. The complexity of these numerical solutions presents technical challenges for real-time online optimisation, especially in HFT environments where computational speed and efficiency are critical. To address this challenge, we propose a simplified model that decomposes the problem into analytically solvable and unsolvable components, alongside an innovative dynamic neural network designed to quickly solve the unsolvable components. Overall, this method helps reduce computational load and is well-suited for real-time online computations in HFT settings. Furthermore, we conducted a theoretical analysis and proof of the optimality and global convergence of the solutions obtained using this method. Finally, based on a large set of real stock data, we performed three numerical experiments to validate its effectiveness. Notably, in an experiment using Dow Jones Industrial Average (DJIA) stock data, our approach reduced total costs by 5.54% compared to the commonly used MATLAB quadprog() solver, demonstrating the potential of this method as an efficient tool for portfolio management in HFT scenarios.
Loading…
Stored only when both papers are in the corpus — 31 citations exist upstream.
Papers that cite the same references — the relational fallback while embeddings are still backfilling.
Imported from OpenAlex (CC0) — nothing here is generated.