Algorithm 1 Gradient Ascent Algorithm

${\alpha }_n\leftarrow {\alpha }_0$ while$g_n\le ϵ$and$iter<N$do     Evaluate cost function $x_n\leftarrow f\left(x_n\right)$     Calculate gradient $g_n\leftarrow \nabla f\left(x_n\right)=x_n-x_{n-1}$     if $x_n\ne 0$ then                                                                                                                ▹Solution Feasible         $x_{n-1}\leftarrow x_n$     else                                                                                                                           ▹Solution Unfeasible         ${\alpha }_n\leftarrow {\displaystyle \frac{{\alpha }_n}{K}}$         $x_n\leftarrow x_{n-1}$     end if     Update $x_n\leftarrow x_n+{\alpha }_n{g}_n$ end while