image thumbnail

Gradient Descent (Solving Quadratic Equations with Two Variables)

version (1.53 KB) by Soumitra Sitole
The algorithm shows the Steepest Descent Method or Gradient Descent Method


Updated 12 Mar 2017

View License

The code highlights the Gradient Descent method. The algorithm works with any quadratic function (Degree 2) with two variables (X and Y). Refer comments for all the important steps in the code to understand the method. In order to implement the algorithm for higher order polynomial equations (more than degree 2); the optimal step length needs to be calculated using fmincon or fminbnd after every step which involves using function handles making the algorithm complex. However, one can easily assume the step size and arrive at the minimum or optimum answer at the cost of more computations. So, to implement the code for higher order polynomials, instead of computing step length at each iteration, one can assume h (step length) as a constant. Let me know if you are interested in the code for higher order polynomials with 2 variables.
- Thank you

Cite As

Soumitra Sitole (2022). Gradient Descent (Solving Quadratic Equations with Two Variables) (, MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2016b
Compatible with any release
Platform Compatibility
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!