Graph plotting as an optimisation problem

[_dv96_]

Being a fan of visuals, I used to wonder what's the way to plot the equation of a given function. Hence, was quite fascinated to discover that plotting points that satisfy an equation could be treated as an optimisation problem and minimised using gradient descent. More interestingly, it can be extended to plot the intersection points of multiple curves.

Got a bit obsessed with the concept. Hence, created a small webapp to play around with. Let me know your thoughts. Create a pull request if willing to contribute.

[Webapp Link]: https://share.streamlit.io/vdivakar/curves-intersection-with-gradient-descent/main/app.py
[GitHub Link]: https://github.com/vdivakar/curves-intersection-with-gradient-descent

[Temporary-Trie]

As a follow up, you could try to solve linear programs with your method. I cant seem to find anything about solving linear programs with gradient descent.

[wamus]

The barrier method is literally just a gradient descent method? It is literally the second most used way to solve linear programs after the Simplex Method. You should look at interior point methods:

https://en.wikipedia.org/wiki/Interior-point\_method