Next Article in Journal
The Power of Human–Algorithm Collaboration in Solving Combinatorial Optimization Problems
Previous Article in Journal
Comparative Analysis of Recurrent Neural Networks in Stock Price Prediction for Different Frequency Domains
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Constrained Dynamic Mean-Variance Portfolio Selection in Continuous-Time

1
School of Economics and Management, Fuzhou University, Fuzhou 350108, China
2
Department of Automation, Shanghai Jiao Tong University, Shanghai 200240, China
3
Department of Forensic Science, Fujian Police College, Fuzhou 350007, China
*
Author to whom correspondence should be addressed.
Algorithms 2021, 14(8), 252; https://doi.org/10.3390/a14080252
Submission received: 21 July 2021 / Revised: 15 August 2021 / Accepted: 15 August 2021 / Published: 23 August 2021

Abstract

:
This paper revisits the dynamic MV portfolio selection problem with cone constraints in continuous-time. We first reformulate our constrained MV portfolio selection model into a special constrained LQ optimal control model and develop the optimal portfolio policy of our model. In addition, we provide an alternative method to resolve this dynamic MV portfolio selection problem with cone constraints. More specifically, instead of solving the correspondent HJB equation directly, we develop the optimal solution for this problem by using the special properties of value function induced from its model structure, such as the monotonicity and convexity of value function. Finally, we provide an example to illustrate how to use our solution in real application. The illustrative example demonstrates that our dynamic MV portfolio policy dominates the static MV portfolio policy.

1. Introduction

The classical static mean-variance (MV) model was pioneered by Markowitz [1] more than sixty years ago, which laid the foundation of modern financial theory. However, such a static policy is not a good choice since the investor usually needs to adjust his/her portfolio policy to achieve better performance according to updated information. Due to the non-separability of the variance term in the language of dynamic programming, this problem is not trivial analytically. In 2000, the static MV model was extended to the multi-period setting by Li and Ng [2] and to the continuous-time setting by Zhou and Li [3] by using the proposed embedding method. From then on, the past decades have witnessed significant progress on the dynamic MV portfolio selection analysis by leaps and bounds; see, for example, Zhu et al. [4], Bielecki et al. [5], He et al. [6], Gao et al. [7], Gao et al. [8], Zhou et al. [9], Cui et al. [10] and Strub et al. [11].
One prominent attraction of the dynamic MV portfolio selection models is their explicit portfolio policy, which can be derived by using the embedding method and dynamic programming approach. However, in real portfolio management, some constraints on portfolio strategy are inevitable; e.g., the investor is usually subject to some limits of consideration of the risk or economic regulations. Generally speaking, when we consider the strategy constraints, they usually destroy the advantages of the MV model. That is to say, under such cases, it is hard to obtain the closed form of a portfolio policy except in a few special cases. To address this issue, Li et al. [12] adopted the viscosity solution of the partial differential equation and successfully characterized the analytical solution of the continuous-time MV portfolio selection problem with no-shorting constraints. Cui et al. [13] considered the discrete-time version of this type of problem with no-shorting constraints and solved it by using dynamic programming. Gao et al. [14] developed the optimal portfolio policy for the dynamic MV portfolio selection model with a cardinality constraint with respect to the active periods of time. Wu et al. [15] investigated the stochastic linear-quadratic (LQ) optimal control problem with the linear control constraints, which can be regarded as a generalization of dynamic MV portfolio selection with no-shorting constraints. In addition, some promising results have emerged recently for dynamic MV portfolio selection with some other constraints, such as no bankruptcy constraints (see, e.g., Zhu et al. [4] and Bielecki et al. [5]).
This paper studies the dynamic MV portfolio selection problem with cone constraints in continuous-time. As for the discrete-time versions of problems of this type with cone constraints, Cui et al. [16] investigated them in detail and solved them by using dynamic programming. The revealed optimal portfolio policy is a piece-wise affine function of current wealth level and can be computed efficiently by solving two important equations offline. Wu et al. [15] further verified this significant result by utilizing the state separation property induced from its structure. As for the continuous-time versions of problems of this type, Hu and Zhou [17] solved them by using the backward stochastic differential equation approach. More specifically, they introduced two extended stochastic Riccati equations (ESREs) and characterized the optimal portfolio policy by using the solutions of these two ESREs. However, their work did not demonstrate how to construct these two ESREs by using the special structure of a model rather than by suspecting them. Generally speaking, this task has not been accomplished. Recently, Wu et al. [18] proposed an important state separation theorem and answered this question under the framework of the stochastic LQ control problem with linear control constraints.
This paper revisits the dynamic MV portfolio selection problem with cone constraints in continuous-time. The contributions of our work are several. Firstly, we reformulated our dynamic MV portfolio selection model into a special stochastic LQ optimal control model and used the results derived in [18] to develop the optimal portfolio policy of our model. Secondly, we created an alternative method to resolve this dynamic MV portfolio selection problem with cone constraints. More specifically, instead of solving the correspondent HJB equation directly, we developed the optimal solution for this problem by using the special properties of value function induced from its model structure, such as the monotonicity and convexity of value function. This alternative method offers a new way of thinking under the constrained mean-risk framework and can be extended to solve another portfolio selection models with cone constraints. Finally, we have provided an example to illustrate how to use our solution in real applications according to real market data. The illustrative example demonstrates that our dynamic MV portfolio policy dominates the static MV portfolio policy.
The remainder of this paper is organized as follows. Section 2 provides the basic formulation of the continuous-time MV portfolio selection model with cone constraints. Section 3 presents the analytical solution of our model. Section 4 offers an alternative approach to solving this problem. Section 5 provides some examples to show that how to use our solution scheme in real applications. Finally, Section 6 concludes the whole paper and provides some further extensions. The symbol 1 denotes the indicator function and the symbol I denotes the identity matrix. All lemmas and theorems have been proofed in the Appendix A.

2. Problem Formulation

In this work, we consider a financial market consisting of one risk-free asset and n risky assets, which can be traded continuously within time horizon [ 0 , T ] . We assume that all randomness is modeled by a complete filtrated probability space ( Ω , F , { F t } t 0 , P ) , on which F t -adapted n-dimensional Brownian motion W ( t ) : = ( W 1 ( t ) , , W n ( t ) ) is defined. Denote F t as the augmented σ -algebra generated by W ( t ) , which implies the information set available at time t, t [ 0 , T ] . L F 2 ( 0 , T ; R ) is the set of R -valued, F t -adapted and square integrable stochastic processes.
The price of the risk-free asset is S 0 ( t ) , which is governed by the following equation:
d S 0 ( t ) = r ( t ) S 0 ( t ) d t , t [ 0 , T ] , S 0 ( 0 ) = s 0 > 0 ,
where r ( t ) > 0 is the risk-free return rate. The price of n risky assets satisfy the SDE:
d S i ( t ) = S i ( t ) { μ i ( t ) d t + j = 1 n σ i j ( t ) d W j ( t ) } , S i ( 0 ) = s i > 0
where μ i ( t ) > 0 and σ i j ( t ) are the appreciation rate and volatility coefficient, respectively. Let μ ( t ) : = μ 1 ( t ) , , μ n ( t ) and
σ ( t ) : = σ 11 ( t ) σ 1 n ( t ) σ n 1 ( t ) σ n n ( t ) ,
for all t [ 0 , T ] . We assume that r ( t ) , μ ( t ) and σ ( t ) are the deterministic functions of time and they are bounded for t [ 0 , T ] . We also assume the following nondegeneracy condition holds for some constant δ > 0 ,
σ ( t ) σ ( t ) δ I , t [ 0 , T ] .
An investor enters the market with initial wealth x 0 and allocates this wealth continuously during the invest horizon [ 0 , T ] . The total wealth at time t is denoted as x ( t ) and the portfolio decision vector is denoted as u ( t ) : = u 1 ( t ) , , u n ( t ) , which represents the allocations of the wealth in n risky assets. The wealth level x ( t ) evolves according to the following SDE (e.g., see Zhou et al. [3]):
d x ( t ) = r ( t ) x ( t ) + b ( t ) u ( t ) d t + u ( t ) σ ( t ) d W ( t ) , t [ 0 , T ] , x ( 0 ) = x 0 > 0 ,
where b ( t ) : = b 1 ( t ) , , b n ( t ) = μ 1 ( t ) r ( t ) , , μ n ( t ) r ( t ) is the excess return rate vector. We also assume the following condition holds.
Assumption 1.
There exists some i * { 1 , , n } such that b i * ( t ) > 0 .
Assumption 1 says that the return rates of some risky assets should be greater than the return rate of the risk-free asset, which is reasonable in real markets.
Motivated by the restrictions on real investments, we consider the following constraint for the portfolio decision vector:
H ( t ) u ( t ) 0 , t [ 0 , T ] ,
where H ( t ) R k × n is the deterministic matrix for t [ 0 , T ] . The above constraint is known as the convex cone constraint, which includes various portfolio constraints as its special cases, e.g., the no-shorting constraint ( [12]). In the following, we use Var [ x ] : = E [ ( x E [ x ] ) 2 ] to denote the variance of some random variable x. The investor adopts the following dynamic MV portfolio decision model to guide his investment:
( P MV ) : min { u ( t ) } | t = 0 T Var [ x ( T ) ] + 0 T E [ u ( t ) R ( t ) u ( t ) ] d t ( s . t . ) E [ x ( T ) ] = d , { x ( t ) , u ( t ) } satisfies   ( 3 )   and   ( 4 ) .
where d is expected terminal wealth level. Usually, we set d > x 0 e 0 T r ( s ) d s ; i.e., the target expected terminal wealth should be greater than that obtained by investing all into the risk-free account. In model ( P MV ), the penalty term u ( t ) R ( t ) u ( t ) is used to control the risk exposure in the risky assets (The penalty term u ( t ) R ( t ) u ( t ) can be used to adjust the amount invested in risky assets. Hence, it can help control the risky exposure in the risky assets). It is worthwhile to mention that our model is more general than the one studied in the current literature; e.g., the work [12] only involved the no-shorting constraint (In [12], some additional assumptions were needed; e.g., they assumed μ i ( t ) > r ( t ) for all i = 1 , , n . This assumption is crucial to obtain their results. However, in our model, we can relax said assumption to Assumption 1) and [17] did not consider the penalty term u ( t ) R ( t ) u ( t ) in their model.

3. Solution Scheme for Problem ( P MV )

To solve problem ( P MV ), we first reformulate it as a special case of the LQ control problem ( P LQ T ) investigated in [18] and use the solution provided in Section 3 of [18] to solve a constrained dynamic MV portfolio selection problem ( P MV ). We utilize the embedding technique introduced by Li et al. [2] to overcome the difficulties of the inseparability of variance term in the sense of dynamic programming. We consider the following auxiliary problem ( P ^ MV ( λ ) ) by introducing the Lagrange multiplier λ R for constraint E [ x ( T ) ] = d :
( P ^ MV ( λ ) ) : min { u ( t ) } | t = 0 T E [ ( x ( T ) λ ) 2 ] + 0 T E [ u ( t ) R ( t ) u ( t ) ] d t ( λ d ) 2 ( s . t . ) { x ( t ) , u ( t ) } satisfies   ( 3 )   and   ( 4 ) .
We define the discount factor as
ρ ( t ) : = e t T r ( s ) d s ,
for t [ 0 , T ] and construct a new state variable z ( t ) as z ( t ) : = x ( t ) λ ρ ( t ) . Replacing the state variable in ( P ^ MV ( λ ) ) yields the following problem:
( P ¯ MV ( λ ) ) : min { u ( t ) } | t = 0 T E [ z ( T ) 2 ] + 0 T E [ u ( t ) R ( t ) u ( t ) ] d t ( s . t . ) d z ( t ) = r ( t ) z ( t ) + b ( t ) u ( t ) d t + u ( t ) σ ( t ) d W ( t ) .
Obviously, this problem is a special case of problem ( P LQ T ) by setting A ( t ) = r ( t ) , B ( t ) = b ( t ) , C ( t ) = 0 n × 1 , D ( t ) = σ ( t ) , q ( t ) = 0 , S ( t ) = 0 n × 1 , for t [ 0 , T ) and q ( T ) = 1 . Thus, similarly to equations (6) and (7) in [18], we introduce the following two ODEs for the two unknown functions G ^ m v ( · ) : R R and G ¯ m v ( · ) : R R :
G ^ ˙ m v ( t ) = 2 G ^ m v ( t ) r ( t ) min K : H ( t ) K 0 f ^ m v ( t , K , G ^ m v ( t ) ) , G ¯ ˙ m v ( t ) = 2 G ¯ m v ( t ) r ( t ) min K : H ( t ) K 0 f ¯ m v ( t , K , G ¯ m v ( t ) ) ,
where G ^ m v ( T ) = G ¯ m v ( T ) = 1 , and
f ^ m v ( t , K , G ) = 2 G b ( t ) K + K G σ ( t ) σ ( t ) + R ( t ) K ,
f ¯ m v ( t , K , G ) = 2 G b ( t ) K + K G σ ( t ) σ ( t ) + R ( t ) K .
Furthermore, the functions G ^ m v ( · ) and G ¯ m v ( · ) have the following properties.
Lemma 1.
For any t [ 0 , T ] , the following inequalities hold true:
G ^ m v ( t ) ρ ( t ) 2 1 ,
G ¯ m v ( t ) ρ ( t ) 2 < 1 .
Note that, in Lemma 1, the strict inequality only holds for (8). Such a result plays an important role in the following.
The following result characterizes the solution of problem ( P MV ).
Theorem 1.
The associated optimal portfolio policy of problem ( P MV ) is given by
u * ( t ) = K ^ m v ( t ) ( x ( t ) λ * ρ ( t ) ) i f x ( t ) λ * ρ ( t ) 0 , K ¯ m v ( t ) ( x ( t ) λ * ρ ( t ) ) i f x ( t ) λ * ρ ( t ) < 0 ,
where
K ^ m v ( t ) = arg min K : H ( t ) K 0 f ^ m v ( t , K , G ^ m v ( t ) ) ,
K ¯ m v ( t ) = arg min K : H ( t ) K 0 f ¯ m v ( t , K , G ¯ m v ( t ) ) .
Moreover, the optimal Lagrange multiplier λ * is
λ * = d x 0 G ¯ m v ( 0 ) ρ ( 0 ) 1 G ¯ m v ( 0 ) ρ ( 0 ) 2 .
Usually, the investor is interested in the MV efficient frontier, i.e., the Parato optimal set of expected terminal wealth d and the associated minimum variance Var [ x ( T ) ] . Substituting λ * back into v ( P ^ MV ( λ ) ) yields the semi-analytical expression of the MV efficient frontier as follows:
Var [ x * ( T ) ] = v ( P ^ MV ( λ * ) 0 T E [ ( u * ( t ) ) R ( t ) u * ( t ) ] d t = G ¯ 0 m v ρ ( 0 ) 2 1 G ¯ 0 m v ρ ( 0 ) 2 E [ x * ( T ) ] x 0 ρ ( 0 ) 2 0 T E [ ( u * ( t ) ) R ( t ) u * ( t ) ] d t ,
with E [ x * ( T ) ] x 0 ρ ( 0 ) 1 . Note that the second term can be evaluated by the Monte Carlo simulation method after computing all K ¯ m v ( t ) and K ^ m v ( t ) .

4. An Alternative Method for Problem ( P MV ) without the Penalty Term

In this section, we provide an alternative method to resolve this dynamic MV portfolio selection problem with cone constraints. Consider the following portfolio selection problem ( A MV ) without the penalty term u ( t ) R ( t ) u ( t ) ; i.e.,
( A MV ) : min { u ( t ) } | t = 0 T Var [ x ( T ) ] ( s . t . ) E [ x ( T ) ] = d , { x ( t ) , u ( t ) } satisfies   ( 3 )   and   ( 4 ) .
Clearly, this problem was investigated in detail in [17]. Instead of using the complicated backward stochastic differential equation method (BSDE), we solve this problem by using some properties induced from the special structure of model. Firstly, we consider the following auxiliary problem ( A ^ MV ( λ ) ) by introducing the Lagrange multiplier λ R for constraint E [ x ( T ) ] = d :
( A ^ MV ( λ ) ) : min { u ( t ) } | t = 0 T E [ ( x ( T ) λ ) 2 ] ( s . t . ) { x ( t ) , u ( t ) } satisfies   ( 3 )   and   ( 4 ) .
Define the value function of problem ( A ^ MV ( λ ) ) at any time t [ 0 , T ] as follows:
V ( t , x ) : = min { H ( s ) u ( s ) 0 } | s = t T E t [ ( x ( T ) λ ) 2 ] ( s . t . ) d x ( s ) = r ( s ) x ( s ) + b ( s ) u ( s ) d t + u ( s ) σ ( s ) d W ( s ) , s [ t , T ] .
From the classical optimal control theory (see, e.g., [19,20]), the value function V ( t , x ) satisfies the following Hamilton–Jacobi–Bellman (HJB) equation:
V t ( t , x ) + inf u ( t ) : H ( t ) u ( t ) 0 { 1 2 V x x ( t , x ) u ( t ) σ ( t ) σ ( t ) u ( t ) + V x ( t , x ) [ r ( t ) x + b ( t ) u ( t ) ] } = 0 ,
with the boundary condition V ( T , x ) = ( x λ ) 2 . By Theorem 1 in [18], we have the following important result.
Theorem 2.
While V x x ( t , x ) 0 , the infimum in the HJB Equation (14) can be obtained as follows:
u * ( t ) = V x ( t , x ) V x x ( t , x ) K ^ ( t ) 1 V x ( t , x ) V x x ( t , x ) 0 + | V x ( t , x ) V x x ( t , x ) | K ¯ ( t ) 1 V x ( t , x ) V x x ( t , x ) < 0 ,
where the K ^ ( t ) and K ¯ ( t ) are optimal solutions of the following problems:
min K ( t ) : H ( t ) K ( t ) 0 1 2 K ( t ) σ ( t ) σ ( t ) K ( t ) + b ( t ) K ( t ) and min K ( t ) : H ( t ) K ( t ) 0 1 2 K ( t ) σ ( t ) σ ( t ) K ( t ) b ( t ) K ( t ) ,
respectively.
Proof. 
As for getting the result using Theorem 1 in [18], we leave the proof for the interested readers. □
Before we go further, we need the following result.
Lemma 2.
The value function V ( t , · ) is convex on R , strictly decreasing on ( , λ ρ ( t ) ] and strictly increasing on ( λ ρ ( t ) , + ) , for each fixed t [ 0 , T ] .
From Theorem 2 and Lemma 2, we can obtain the optimal portfolio policy of problem ( A MV ). Before we go further, we must introduce the following two ODEs for the two unknown functions F ^ ( · ) : R R and F ¯ ( · ) : R R :
F ^ ˙ ( t ) = 2 F ^ ( t ) r ( t ) min L : H ( t ) L 0 f ^ ( t , L , F ^ ( t ) ) , F ¯ ˙ ( t ) = 2 F ¯ ( t ) r ( t ) min L : H ( t ) L 0 f ¯ ( t , L , F ¯ ( t ) ) ,
with the boundary condition F ^ ( T ) = F ¯ ( T ) = 1 and
f ^ ( t , L , F ) = 2 F b ( t ) L + L F σ ( t ) σ ( t ) L , f ¯ ( t , L , F ) = 2 F b ( t ) L + L F σ ( t ) σ ( t ) L .
Theorem 3.
The optimal portfolio policy of problem ( A MV ) is characterized by
u * ( t ) = L ^ ( t ) ( x ( t ) λ * ρ ( t ) ) i f x ( t ) λ * ρ ( t ) 0 , L ¯ ( t ) ( x ( t ) λ * ρ ( t ) ) i f x ( t ) λ * ρ ( t ) < 0 ,
where the parameters L ^ ( t ) and L ¯ ( t ) are
L ^ ( t ) = arg min L : H ( t ) L 0 f ^ ( t , L , F ^ ( t ) ) , L ¯ ( t ) = arg min L : H ( t ) L 0 f ¯ ( t , L , F ¯ ( t ) ) .
Moreover, the optimal Lagrange multiplier λ * is,
λ * = d x 0 F ¯ ( 0 ) ρ ( 0 ) 1 F ¯ ( 0 ) ρ ( 0 ) 2 .

5. An Illustrative Example

Here we consider an example of the MV portfolio selection model. We used the financial indices of six industrial sectors in U.S stock market as the risky assets, namely, the sectors of toys and recreation, communication, ship building, coal, gold, and industrial mining. The detailed instructions of these industrial indices and historical data can be found in http://mba.tuck.dartmouth.edu/pages/faculty/ken.french/Data_Library/det_48_ind_port.html (accessed on 18 August 2021). Based on the historical data of monthly return from January 2008 to December 2013, we could estimate the parameters of average return rate and volatility; e.g., we set μ ( t ) = μ ¯ and σ ( t ) = σ ¯ for all t [ 0 , T ] with
μ ¯ = 0.0321 0.0123 0.0217 0.0217 0.0282 0.0146 and σ ¯ = 0.0845 0.0062 0.0166 0.0069 0.0087 0.0068 0.0062 0.0327 0.0148 0.0124 0.0067 0.0054 0.0166 0.0148 0.0589 0.0271 0.0204 0.0088 0.0069 0.0124 0.0271 0.1015 0.0215 0.0501 0.0087 0.0067 0.0204 0.0215 0.0609 0.0120 0.0068 0.0054 0.0088 0.0501 0.0120 0.1313 .
Differently from the MV portfolio model studied in [12], in which the no-shorting constraints were imposed in all risky assets, our model allows the no-shorting constraints to only be imposed on some of the assets; i.e., we set no-short constraints u 2 ( t ) 0 , u 3 ( t ) 0 , u 4 ( t ) 0 and u 6 ( t ) 0 for t [ 0 , T ] . The remaining assets had no constraints; i.e., u 1 ( t ) and u 5 ( t ) were free of constraints. These constraints can be easily represented in matrix formulation H ( t ) u ( t ) 0 , i.e., by setting the diagonal elements of H ( t ) to be 1 except the first and fifth elements, and setting all the other elements to be 0. We also assumed that there is a risk-free asset with the monthly return rate being 0.25 % . The investor entered market with initial wealth x 0 = 100 and hoped for the (expected) terminal wealth level d = 130, with the investment horizon being T = 12 months. We also included a penalty matrix for the portfolio: R ( t ) = 10 2 I for all t [ 0 , T ] .
Based on Theorem 1, we can compute the optimal Lagrangian multiplier as λ * = 189.78 , and the optimal portfolio policy is
u * ( t ) = K ^ m v ( t ) x ( t ) 189.78 × e 0.0025 ( t T ) if x ( t ) 189.78 × e 0.0025 ( t T ) 0 , K ¯ m v ( t ) x ( t ) 189.78 × e 0.0025 ( t T ) if x ( t ) 189.78 × e 0.0025 ( t T ) < 0 .
where K ^ m v ( t ) and K ¯ m v ( t ) are plotted in Figure 1 for t [ 0 , T ] .
We used the buy-and-hold portfolio policy as a benchmark; i.e., we treated the total T = 12 month as the one-period static MV portfolio selection model. All the constraints and parameters were set to be same as our dynamic MV portfolio selection model ( P MV ) . Solving the problem provided us the buy-and-hold portfolio policy. Figure 2 plots the realizations of the wealth processes generated by our model ( P MV ) and the static benchmark for the identical sample path of the price process. Figure 2 shows that our model performed better than the static benchmark model. To compare the performances of these two models, we plotted the mean-variance efficient frontier of the terminal wealth x ( T ) for two models in Figure 3. The efficient frontier describes the Parato optimal set of the mean and standard deviation of the wealth. In this example, the efficient frontier was plotted in the following way. We varied the expected terminal wealth level d and computed the correspondent optimal portfolio. Once we had the portfolio, we could compute the standard deviation of the terminal wealth. More specifically, we first simulated 100,000 sample paths for each return of risky assets, respectively. Then, we could compute the corresponding realized portfolio policy and realized terminal wealth. According to the realized terminal wealth, we could compute the expected value and standard deviation of terminal wealth. Figure 3 shows that our dynamic MV portfolio policy achieved a lower level of risk than the static MV portfolio policy for the same level of expected terminal wealth.

6. Conclusions

This paper revisited the dynamic MV portfolio selection problem with cone constraints in continuous-time. By reformulating our dynamic MV portfolio selection model into a special stochastic LQ optimal control model, we successfully developed the optimal portfolio policy for our model. Moreover, we provided an alternative method to resolve this dynamic MV portfolio selection problem with cone constraints. More specifically, instead of solving the correspondent HJB equation directly, we developed the optimal solution for this problem by using the special properties of value function induced from its model structure, such as the monotonicity and convexity of value function. This alternative method offers a new way of thinking under the constrained mean-risk framework and can be extended to solve another portfolio selection models with cone constraints. Finally, our illustrative example demonstrated that our dynamic MV portfolio policy dominates the static MV portfolio policy. For example, our dynamic MV portfolio policy achieved a lower level of risk than the static MV portfolio policy for the same level of expected terminal wealth. Moreover, our model performed better than the static benchmark model in terms of the realized wealth processes.
One possible future study will be to extend our results to the stochastic control problem with partial moments as the objective function, which has various applications in portfolio management, such as the mean-downside-risk portfolio optimization model. Moreover, it would also be significant to extend our results to the dynamic portfolio problem with no bankruptcy constraint and other trading constraints, such that our model becomes easier to be applied to real portfolio management.

Author Contributions

Data curation, L.W.; methodology, S.P.; writing—original draft preparation, W.W.; writing—review and editing, R.X. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the National Natural Science Foundation of China under grant 61573244, “Stochastic control optimization of uncertain systems based on offset with multiplicative noises and its applications in the financial optimization”.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

Appendix A.1. The Proof of Lemma 1

Proof. 
We first consider G ^ m v ( t ) . Since K ( t ) = 0 is a feasible solution of f ^ m v ( t , K ( t ) , G ^ m v ( t ) ) , we obtain
min K ( t ) : H ( t ) K ( t ) 0 f ^ m v ( t , K ( t ) , G ^ m v ( t ) ) f ^ m v ( t , 0 , G ^ m v ( t ) ) = 0 .
Thus, it has G ^ ˙ m v ( t ) 2 G ^ m v ( t ) r ( t ) which leads to the following inequality:
t T 1 G ^ m v ( t ) d G ^ m v ( t ) t T 2 r ( s ) d s 1 G ^ m v ( t ) e 2 t T r ( s ) d s 0 ,
Similarly, we can prove that 1 G ¯ m v ( t ) ρ ( t ) 2 0 . Now, we show that
1 G ¯ m v ( t ) ρ ( t ) 2 0 .
If 1 G ¯ m v ( t ) ρ ( t ) 2 =0, it has
min H ( t ) K ( t ) 0 f ¯ m v ( t , K ( t ) , G ¯ m v ( t ) ) = 0 ,
which is contradict to the fact
min H ( t ) K ( t ) 0 f ¯ m v ( t , K ( t ) , G ¯ m v ( t ) ) < 0
according to expression (6) and under the Assumption 1. □

Appendix A.2. The Proof of Theorem 1

Proof. 
By applying Theorem 2 in [18], we obtain the optimal policy of problem ( P ¯ MV ( λ ) ) for any fixed λ :
u * ( t ) = K ^ m v ( t ) z ( t ) if z ( t ) 0 , K ¯ m v ( t ) z ( t ) if z ( t ) < 0 .
The remaining task is to identify the optimal Lagrangian multiplier λ * . From Theorem 2 in [18], it not hard to derive the optimal value of problem ( P ¯ MV ( λ ) ) for any fixed λ as
v ( P ¯ MV ( λ ) ) = G ^ m v ( 0 ) ( x 0 λ ρ ( 0 ) ) 2 ( λ d ) 2 if x ( 0 ) λ ρ ( 0 ) 0 , G ¯ m v ( 0 ) ( x 0 λ ρ ( 0 ) ) 2 ( λ d ) 2 if x ( 0 ) λ ρ ( 0 ) < 0 ,
Then, the optimal Lagrangian multiplier λ * can be identified by maximizing λ * = max λ R n v ( P ¯ MV ( λ ) ) . According to (7) and (8), we can find that v ( P ¯ MV ( λ ) ) is a piece-wise concave function with respect to λ . Therefore, the optimal Lagrangian multiplier λ * can be derived as (12). The optimal portfolio decision (9) can be achieved by replacing z ( t ) with x ( t ) in (A1). □

Appendix A.3. The Proof of Lemma 2

Proof. 
Firstly, we will prove the convexity of the value function V ( t , x ) . Let ( X 1 ( t ) , u 1 ( t ) ) and ( X 2 ( t ) , u 2 ( t ) ) be any different admissible pairs. We define ( X ˜ ( t ) , u ˜ ( t ) ) = ( a X 1 ( t ) + ( 1 a ) X 2 ( t ) , a u 1 ( t ) + ( 1 a ) u 2 ( t ) ) , for any 0 < a < 1 . It is easily to verify that ( X ˜ ( t ) , u ˜ ( t ) ) satisfies H ( t ) u ˜ ( t ) 0 . That is to say, ( X ˜ ( t ) , u ˜ ( t ) ) is an admissible pair. Therefore,
V ( t , X ˜ ( t ) ) = V ( t , a X 1 ( t ) + ( 1 a ) X 2 ( t ) ) E t [ ( a X 1 ( T ) + ( 1 a ) X 2 ( T ) λ ) 2 ] a E t [ ( X 1 ( T ) λ ) 2 ] + ( 1 a ) E t [ ( X 2 ( T ) λ ) 2 ] ,
where the last inequality holds true due to the convexity of square function. Since ( X 1 ( t ) , u 1 ( t ) ) and ( X 2 ( t ) , u 2 ( t ) ) were chosen arbitrarily, we can find that
V ( t , a X 1 ( t ) + ( 1 a ) X 2 ( t ) ) a V ( t , X 1 ( t ) ) + ( 1 a ) V ( t , X 2 ( t ) ) .
Therefore, the convexity of V ( t , x ) can be established.
Secondly, before we show that V ( t , x ) is strictly decreasing on ( , λ ρ ( t ) ] and is strictly increasing on [ λ ρ ( t ) , + ) , we need show that the value function V ( t , x ) = 0 while x = X ( t ) = λ ρ ( t ) . Indeed, we assume that X ( t ) = λ ρ ( t ) . After that, we could obtain X ( T ) = λ if taking u ( t ) = 0 . Therefore, we have
V ( t , λ ρ ( t ) ) E [ X ( T ) λ ] 2 = 0 .
Based on the non-negative of square function, we could obtain the result that V ( t , λ ρ ( t ) ) = 0 .
Finally, we will focus on proving V ( t , x ) is strictly increasing on [ λ ρ ( t ) , + ) , the other part is similar. For any X b ( t ) > X a ( t ) X 0 ( t ) = λ ρ ( t ) , there exists k such that
X a ( t ) = k X b ( t ) + ( 1 k ) X 0 ( t )
where k [ 0 , 1 ) . Thus, based on the convexity of V ( t , x ) , we have
V ( t , X a ( t ) ) k V ( t , X b ( t ) ) + ( 1 k ) V ( t , X 0 ( t ) ) k V ( t , X b ( t ) ) < V ( t , X b ( t ) ) ,
where the second inequality is from the fact that V ( t , λ ρ ( t ) ) = 0 and the last inequality is according to the assumption that k [ 0 , 1 ) . This result implies that V ( t , x ) is strictly increasing in [ λ ρ ( t ) , + ) , which completes the proof.

Appendix A.4. The Proof of Theorem 3

Proof. 
Combining Theorem 2 and Lemma 2, we could easily obtain the optimal solution for the HJB Equation (14) as follows:
u * ( t ) = V x ( t , x ) V x x ( t , x ) L ^ ( t ) 1 V x ( t , x ) V x x ( t , x ) 0 + | V x ( t , x ) V x x ( t , x ) | L ¯ ( t ) 1 V x ( t , x ) V x x ( t , x ) < 0 = V x ( t , x ) V x x ( t , x ) L ^ ( t ) 1 x ( t ) λ ρ ( t ) 0 + | V x ( t , x ) V x x ( t , x ) | L ¯ ( t ) 1 x ( t ) λ ρ ( t ) < 0 ,
where V x x ( t , x ) 0 . Indeed, if we let V x x ( t , x ) = 0 , it has V x ( t , x ) = c o n s t a n t . However, this result conflicts with Lemma 2, since V ( t , x ) is strictly decreasing on ( , λ ρ ( t ) ] and strictly increasing on ( λ ρ ( t ) , + ) , for each fixed t [ 0 , T ] .
Recall that if there are no strategy constraints, the optimal solution for the HJB Equation (14) is
u * ( t ) = [ σ ( t ) σ ( t ) ] 1 b ( t ) V x ( t , x ) V x x ( t , x ) .
Thus, if we define
B ( t ) = σ ( t ) σ ( t ) L ^ ( t ) 1 V x ( t , x ) V x x ( t , x ) 0 + [ σ ( t ) σ ( t ) L ¯ ( t ) ] 1 V x ( t , x ) V x x ( t , x ) 0 = σ ( t ) σ ( t ) L ^ ( t ) 1 x ( t ) λ ρ ( t ) 0 + [ σ ( t ) σ ( t ) L ¯ ( t ) ] 1 x ( t ) λ ρ ( t ) < 0 ,
it is not hard to see that solving the HJB Equation (14) is equivalent to solve the following auxiliary HJB equation without strategy constraints
V t + inf u ( t ) { 1 2 V x x u ( t ) σ ( t ) σ ( t ) u ( t ) + V x [ r ( t ) x + u ( t ) B ( t ) ] } = 0 V ( T , x ) = ( x λ ) 2
More specifically, the solution of (A3) is equal to the one of (14). In fact, the solution to the HJB Equation (A3) is also the value function associated with the following problem:
( A ¯ m v ( λ ) ) min { u ( t ) } t = 0 T 1 E [ x ( T ) λ ] 2 ( s . t . ) d x ( t ) = ( r ( t ) x ( t ) + B ( t ) π ( t ) ) d t + u ( t ) σ ( t ) d W ( t ) .
This problem has been widely studied in the literature and can be solved by the stochastic optimal control or martingale method (see, [3,5]). The optimal portfolio policy of problem ( A ¯ m v ( λ ) ) is
u B * ( t ) = [ σ ( t ) σ ( t ) ] 1 B ( t ) [ x ( t ) λ ρ ( t ) ] .
Therefore, the optimal control of mean-variance problem with cone constraints is (15). □

References

  1. Markowitz, H.M. Portfolio Selection. J. Financ. 1952, 7, 1063–1070. [Google Scholar]
  2. Li, D.; Ng, W.L. Optimial dynamic portfolio selection: Multiperiod mean-variance formulation. Math. Financ. 2000, 10, 387–406. [Google Scholar] [CrossRef]
  3. Zhou, X.Y.; Li, D. Continuous-Time Mean-Variance Portfolio Selection: A Stochastic LQ Framework. Appl. Math. Optim. 2000, 42, 19–33. [Google Scholar] [CrossRef]
  4. Zhu, S.S.; Li, D.; Wang, S.Y. Risk control over bankruptcy in dynamic portfolio selection: A generalized mean-variance formulation. IEEE Trans. Autom. Control. 2004, 49, 447–457. [Google Scholar] [CrossRef]
  5. Bielecki, T.; Jin, H.Q.; Pliska, S.R.; Zhou, X.Y. Continuous-time mean-variance portolio selection with bankrupcy prohibition. Math. Financ. 2005, 15, 213–244. [Google Scholar] [CrossRef]
  6. He, X.D.; Zhou, X.Y. Dynamic portfolio choice when risk is measured by weighted VaR. Math. Oper. Res. 2015, 40, 773–796. [Google Scholar] [CrossRef] [Green Version]
  7. Gao, J.J.; Xiong, Y.; Li, D. Dynamic mean-risk portfolio selection with multiple risk measures in continuous-Time. Eur. J. Oper. Res. 2016, 249, 647–656. [Google Scholar] [CrossRef]
  8. Gao, J.J.; Zhou, K.; Li, D.; Cao, X.R. Dynamic mean-LPM and mean-CVaR portfolio optimization in continuous-time. SIAM J. Control. Optim. 2017, 55, 1377–1397. [Google Scholar] [CrossRef] [Green Version]
  9. Zhou, K.; Gao, J.J.; Li, D.; Cui, X.Y. Dynamic mean-VaR portfolio selection in continuous time. Quant. Financ. 2017, 17, 1631–1643. [Google Scholar] [CrossRef]
  10. Cui, X.Y.; Li, X.; Li, D. Unified framework of mean-field formulations for optimal multi-period mean-variance portfolio selection. IEEE Trans. Autom. Control. 2014, 59, 1833–1844. [Google Scholar] [CrossRef] [Green Version]
  11. Strub, M.S.; Li, D.; Cui, X.Y.; Gao, J.J. Discrete-time mean-CVaR portfolio selection and time-consistency induced term structure of the CVaR. J. Econ. Dyn. Control. 2019, 108, 103751. [Google Scholar] [CrossRef]
  12. Li, X.; Zhou, X.Y.; Lim, A.E.B. Dynamic mean-variance portfolio selection with no shorting constraints. SIAM J. Control. Optim. 2002, 40, 1540–1555. [Google Scholar] [CrossRef]
  13. Cui, X.Y.; Gao, J.J.; Li, X.; Li, D. Optimal multi-period mean-variance policy under no-shorting constraint. Eur. J. Oper. Res. 2014, 234, 459–468. [Google Scholar] [CrossRef]
  14. Gao, J.; Li, D.; Cui, X.; Wang, S. Time cardinality constrained mean-ariance dynamic portfolio selection and market timing: A stochastic control approach. Automatica 2015, 54, 91–99. [Google Scholar] [CrossRef]
  15. Wu, W.P.; Gao, J.J.; Li, D.; Shi, Y. Explicit Solution for Constrained Scalar-State Stochastic Linear-Quadratic Control with Multiplicative Noise. IEEE Trans. Autom. Control. 2019, 64, 1999–2012. [Google Scholar] [CrossRef]
  16. Cui, X.Y.; Li, D.; Li, X. Mean-variance policy for discrete-time cone constrained markets: The consistency in efficiency and minimum-variance signed supermartingale measure. Math. Financ. 2017, 27, 471–504. [Google Scholar] [CrossRef]
  17. Hu, Y.; Zhou, X.Y. Constrained stochastic LQ control with random coefficients, and application to portfolio selection. SIAM J. Control. Optim. 2005, 44, 444–466. [Google Scholar] [CrossRef]
  18. Wu, W.P.; Gao, J.J.; Lu, J.G.; Li, X. On continuous-time constrained stochastic linear–quadratic control. Automatica 2020, 114, 108809. [Google Scholar] [CrossRef]
  19. Pham, H. Continuous-Time Stochastic Control and Optimization with Financial Applications; Springer: Berlin/Heidelberg, Germany, 2009. [Google Scholar]
  20. Yong, J.M.; Zhou, X.Y. Stochastic Controls: Hamiltonian Systems and HJB Equations; Springer: Berlin/Heidelberg, Germany, 1999. [Google Scholar]
Figure 1. The outputs of K ^ m v ( t ) and K ¯ m v ( t ) .
Figure 1. The outputs of K ^ m v ( t ) and K ¯ m v ( t ) .
Algorithms 14 00252 g001
Figure 2. The realized wealth processes.
Figure 2. The realized wealth processes.
Algorithms 14 00252 g002
Figure 3. The efficient frontiers.
Figure 3. The efficient frontiers.
Algorithms 14 00252 g003
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Wu, W.; Wu, L.; Xue, R.; Pang, S. Constrained Dynamic Mean-Variance Portfolio Selection in Continuous-Time. Algorithms 2021, 14, 252. https://doi.org/10.3390/a14080252

AMA Style

Wu W, Wu L, Xue R, Pang S. Constrained Dynamic Mean-Variance Portfolio Selection in Continuous-Time. Algorithms. 2021; 14(8):252. https://doi.org/10.3390/a14080252

Chicago/Turabian Style

Wu, Weiping, Lifen Wu, Ruobing Xue, and Shan Pang. 2021. "Constrained Dynamic Mean-Variance Portfolio Selection in Continuous-Time" Algorithms 14, no. 8: 252. https://doi.org/10.3390/a14080252

APA Style

Wu, W., Wu, L., Xue, R., & Pang, S. (2021). Constrained Dynamic Mean-Variance Portfolio Selection in Continuous-Time. Algorithms, 14(8), 252. https://doi.org/10.3390/a14080252

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop