Modified Admm Algorithm For Solving Proximal Bound Formulation of Multi-Delay Optimal Control Problem With Bounded Control

This study presents an algorithm for solving optimal control problems with the objective function of the lagrange-type and multiple delays on both the state and control variables of the constraints, with bounds on the control variable. the full discretization of the objective functional and the multiple delay constraints is carried out by using the simpson numerical scheme. the discrete recurrence relations generated from the discretization of both the objective functional and constraints are used to develop the matrix operators, which satisfy the basic spectral properties. the primal-dual residuals of the algorithm are derived in order to ascertain the rate of convergence of the algorithm, which performs faster when relaxed with an accelerator variant in the sense of nesterov. the direct numerical approach for handling the multi-delay control problem is observed to obtain an accurate result at a faster rate of convergence when over-relaxed with an accelerator variant. this research problem is limited to linear constraints and objective functional of the lagrange-type and can address real-life models with multiple delays as applicable to quadratic optimization of intensity modulated radiation theory planning. the novelty of this research paper lies in the method of discretization and its adaptation to handle linearly and proximal bound-constrained program formulated from the multiple delay optimal control problems.