Skip to main content
. 2021 Jun 21;15:699820. doi: 10.3389/fnbot.2021.699820

Table 1.

Algorithm for solving problem P.

Algorithm 1: Solve problem P
Initial: ϵ=10-2,ι=ϵ/8,ϵmin=10-4,u=u0 and E = E0
Input:u0, E0 and np
Output: uϵ,ι*,Eϵ,ι*
(1): Solve problem P with u, E as initial point and outputuϵ, ιandEϵ, ι
(2): IF gj(t) − ι ≥ 0, ∀t = [0, T], j = 1, 2, …, nc THEN goto (6)
(3): ElSE goto (5)
(4): SET ϵ = ϵ/10, ι = ι/10, u = uϵ, ι, E = Eϵ, ι and goto (1)
(5): SET ι = ι/2 and goto (1)
(6): IF ι ≥ ιmin,THEN goto (1).
(7): ELSE stop and output uϵ,ι*,Eϵ,ι*.