Jianjun Gao

Prof. Dr. Jianjun Gao

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 April 2018 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
WWWeiping Wu
Weiping Wu
JGJianjun Gao
Jianjun Gao
DLDuan Li
Duan Li
YSYun Shi
Yun Shi
We study in this paper a class of constrained linear-quadratic (LQ) optimal control problem formulations for the scalar-state stochastic system with multiplicative noise, which has various applications, especially in the financial risk management. The linear constraint on both the control and state variables considered in our model destroys the elegant structure of the conventional LQ formulation and has blocked the derivation of an explicit control policy so far in the literature. We successfully derive in this paper the analytical control policy for such a class of problems by utilizing the state separation property induced from its structure. We reveal that the optimal control policy is a piece-wise affine function of the state and can be computed off-line efficiently by solving two coupled Riccati equations. Under some mild conditions, we also obtain the stationary control policy for infinite time horizon. We demonstrate the implementation of our method via some illustrative examples and show how to calibrate our model to solve dynamic constrained portfolio optimization problems.

5 April 2022 in Journal of the Operations Research Society of China
Verified
Journal Article
Closed access
PDF file
XCXiang-Yu Cui
Xiang-Yu Cui
JGJianjun Gao
Jianjun Gao
XLXun Li
Xun Li
YSYun Shi
Yun Shi

10 April 2017 in Quantitative Finance
Verified
Journal Article
Closed access
KZKe Zhou
Ke Zhou
JGJianjun Gao
Jianjun Gao
DLDuan Li
Duan Li
XCXiangyu Cui
Xiangyu Cui
The value-at-risk (VaR) is one of the most well-known downside risk measures due to its intuitive meaning and wide spectra of applications in practice. In this paper, we investigate the dynamic mean–VaR portfolio selection formulation in continuous time, while the majority of the current literature on mean–VaR portfolio selection mainly focuses on its static versions. Our contributions are twofold, in both building up a tractable formulation and deriving the corresponding optimal portfolio policy. By imposing a limit funding level on the terminal wealth, we conquer the ill-posedness exhibited in the original dynamic mean–VaR portfolio formulation. To overcome the difficulties arising from the VaR constraint and no bankruptcy constraint, we have combined the martingale approach with the quantile optimization technique in our solution framework to derive the optimal portfolio policy. In particular, we have characterized the condition for the existence of the Lagrange multiplier. When the opportunity set of the market setting is deterministic, the portfolio policy becomes analytical. Furthermore, the limit funding level not only enables us to solve the dynamic mean–VaR portfolio selection problem, but also offers a flexibility to tame the aggressiveness of the portfolio policy.

19 June 2024 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
RWRui Wang
Rui Wang
CZChuwen Zhang
Chuwen Zhang
SPShanwen Pu
Shanwen Pu
JGJianjun Gao
Jianjun Gao
ZWZaiwen Wen
Zaiwen Wen
Integer programming with block structures has received considerable attention recently and is widely used in many practical applications such as train timetabling and vehicle routing problems. It is known to be NP-hard due to the presence of integer variables. We define a novel augmented Lagrangian function by directly penalizing the inequality constraints and establish the strong duality between the primal problem and the augmented Lagrangian dual problem. Then, a customized augmented Lagrangian method is proposed to address the block-structures. In particular, the minimization of the augmented Lagrangian function is decomposed into multiple subproblems by decoupling the linking constraints and these subproblems can be efficiently solved using the block coordinate descent method. We also establish the convergence property of the proposed method. To make the algorithm more practical, we further introduce several refinement techniques to identify high-quality feasible solutions. Numerical experiments on a few interesting scenarios show that our proposed algorithm often achieves a satisfactory solution and is quite effective.

8 May 2024 in Omega
Verified
Journal Article
Closed access
JGJianjun Gao
Jianjun Gao
YLYaoming Li
Yaoming Li
YSYun Shi
Yun Shi
JXJinyan Xie
Jinyan Xie

11 July 2024 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
XCXiangyu Cui
Xiangyu Cui
JGJianjun Gao
Jianjun Gao
LKLingjie Kong
Lingjie Kong
YSYun Shi
Yun Shi
This study addresses limited attention allocation in a stochastic linear quadratic system with multiplicative noise. Our approach enables strategic resource allocation to enhance noise estimation and improve control decisions. We provide an analytical optimal control and propose a numerical method for optimal attention allocation.