Njengoba kunikezwe lombhalo ophathelene nokwehla kwe-gradient, kuyini ukwehla kwe-gradient, futhi ubani owasungula?
Context:Kwezemathematics, ukwehla kwe-gradient (okuvame ukubizwa nangokuthi ukwehla okuqine kakhulu) yi-algorithm yokuhlelwa kwe-iterative ye-first-order yokuthola ubuncane bendawo yomsebenzi ohlukanisekayo. Umqondo uwukuthatha izinyathelo eziphindaphindiwe eziphambene nomthambeka (noma umthambeka oseduze) womsebenzi endaweni yamanje, ngoba lokhu kuyisiqondiso sokwehla kakhulu. Ngakolunye uhlangothi, ukuma ngakwesokudla kwe-gradient kuyoholela esiphezulu sendawo salowo msebenzi; inqubo yaziwa ngokuthi i-gradient ascent.  Ngokuvamile ukwehla kwe-gradient kubhekiselwa ku-Augustin-Louis Cauchy, owaqala ukukuphakamisa ngo-1847. UJacques Hadamard ngokuzimela wasikisela indlela efanayo ngo-1907. Izici zayo zokuhlangana ezinkingeni zokwenza kahle ezingezona ezomugqa zaqale zafundwa nguHaskell Curry ngo-1944, futhi le ndlela yafundwa kahle kakhulu futhi yasetshenziswa emashumini eminyaka alandelayo.
Kwezemathematics, ukwehla kwe-gradient (okuvame ukubizwa nangokuthi ukwehla okuqine kakhulu) yi-algorithm yokuhlelwa kwe-iterative ye-first-order yokuthola ubuncane bendawo yomsebenzi ohlukanisekayo. Ngokuvamile ukwehla kwe-gradient kubhekiselwa ku-Augustin-Louis Cauchy, owaqala ukusikisela ngo-1847