AN OPTIMAL CONTROL PROBLEM WITH TERMINAL STOCHASTIC LINEAR COMPLEMENTARITY CONSTRAINTS
被引:0
|
作者:
Luo, Jianfeng
论文数: 0|引用数: 0|
h-index: 0|
机构:
Hong Kong Polytech Univ, Shenzhen Res Inst, CAS AMSS PolyU Joint Lab Appl Math Shenzhen, Shenzhen, Peoples R ChinaHong Kong Polytech Univ, Shenzhen Res Inst, CAS AMSS PolyU Joint Lab Appl Math Shenzhen, Shenzhen, Peoples R China
Luo, Jianfeng
[1
]
Chen, Xiaojun
论文数: 0|引用数: 0|
h-index: 0|
机构:
Hong Kong Polytech Univ, Dept Appl Math, Kowloon, Hong Kong, Peoples R ChinaHong Kong Polytech Univ, Shenzhen Res Inst, CAS AMSS PolyU Joint Lab Appl Math Shenzhen, Shenzhen, Peoples R China
Chen, Xiaojun
[2
]
机构:
[1] Hong Kong Polytech Univ, Shenzhen Res Inst, CAS AMSS PolyU Joint Lab Appl Math Shenzhen, Shenzhen, Peoples R China
[2] Hong Kong Polytech Univ, Dept Appl Math, Kowloon, Hong Kong, Peoples R China
ODE constrained optimal control problem;
stochastic linear complementarity problem;
sample average approximation;
implicit Euler time-stepping;
convergence analysis;
CONTROLLABILITY;
APPROXIMATION;
D O I:
10.1137/22M151594X
中图分类号:
TP [自动化技术、计算机技术];
学科分类号:
0812 ;
摘要:
In this paper, we investigate an optimal control problem with a crucial ODE constraint involving a terminal stochastic LCP and its discrete approximation using the relaxation, the sample average approximation (SAA), and the implicit Euler time-stepping scheme. We show the existence of feasible solutions and optimal solutions to the optimal control problem and its discrete approximation under the condition that the expectation of the stochastic matrix in the stochastic LCP is a Z-matrix or an adequate matrix. Moreover, we prove that the solution sequence generated by the discrete approximation converges to a solution of the original optimal control problem with probability 1 by the repeated limits in the order of epsilon down arrow 0, nu -> infinity, and h down arrow 0, where epsilon is the relaxation parameter, nu is the sample size, and h is the mesh size. We also provide asymptotics of the SAA optimal value and error bounds of the time-stepping method. A numerical example is used to illustrate the existence of optimal solutions, the discretization scheme, and error estimation.
机构:
Lomonosov Moscow State University, Faculty of Computation Mathematics and Cybernetics, MoscowLomonosov Moscow State University, Faculty of Computation Mathematics and Cybernetics, Moscow