Skip to main content
. 2024 Jul 27;24(15):4889. doi: 10.3390/s24154889
Algorithm 1 Gradient Ascent Algorithm

αnα0

whilegnϵanditer<Ndo

    Evaluate cost function xnf(xn)

    Calculate gradient gnf(xn)=xnxn1

    if xn0 then                                                                                                                ▹Solution Feasible

        xn1xn

    else                                                                                                                           ▹Solution Unfeasible

        αnαnK

        xnxn1

    end if

    Update xnxn+αngn

end while