An Improved Frank–Wolfe Algorithm to Solve the Tactical Investment Portfolio Optimization Problem
Year: 2025
Type: article
Abstract: Quadratic programming (QP) formulations are widely used in optimal investment portfolio selection, a central problem in financial decision-making. In practice, asset allocation decisions operate at two interconnected levels: the strategic level, which allocates the budget across major asset classes, and the tactical level, which distributes the allocation within each class to individual securities or instruments. This study evaluates the Frank–Wolfe (FW) algorithm as a computationally alternative to a QP formulation implemented in CVXPY and solved using OSQP (CVXPY–OSQP solver) for tactical investment portfolio optimization. By iteratively solving a linear approximation of the convex objective function, FW offers a distinct approach to portfolio construction. A comparative analysis was conducted using a tactical portfolio model with a small number of stock assets, assessing solution similarity, computational running time, and memory usage. The results demonstrate a clear trade-off between the two methods. While FW can produce portfolio weights closely matching those of the CVXPY–OSQP solver at lower and feasible target returns, its solutions differ at higher returns near the limits of the feasible set. However, FW consistently achieved shorter execution times and lower memory consumption. This study quantifies the trade-offs between accuracy and efficiency and identifies opportunities to improve FW’s accuracy through adaptive iteration strategies under more challenging optimization conditions.
Source: Mathematics
DOI: 10.3390/math13183038
Institution: Padjadjaran University
Language: English
Field: Decision Sciences
Domain: Social Sciences
Open Access status: gold
Estimated APC paid: $3,137
Funder: Universitas Padjadjaran
Award: G7937771343
OpenAlex ID: W4414390753