On Gradient Descent and Co-ordinate Descent methods and its variants.

Authors

  • Sajjadul Bari American International University - Bangladesh
  • Md. Rajib Arefin University of Dhaka, Bangladesh
  • Sohana Jahan University of Dhaka, Bangladesh

DOI:

https://doi.org/10.53799/ajse.v19i3.103

Abstract

This research is focused on Unconstrained Optimization problems. Among a number of methods that can be used to solve Unconstrained Optimization problems we have worked on Gradient and Coordinate Descent methods. Step size plays an important role for optimization. Here we have performed numerical experiment with Gradient and Coordinate Descent method for several step size choices. Comparison between different variants of Gradient and Coordinate Descent methods and their efficiency are demonstrated by implementing in loss functions minimization problem.

Downloads

Published

12/31/2020

Issue

Vol. 19 No. 3 (2020): AJSE Volume:19 Issue:3 (2020)

Section

Articles

License

AJSE contents are under the terms of the Creative Commons Attribution License. This permits anyone to copy, distribute, transmit and adapt the work non-commercially provided the original work and source is appropriately cited.

How to Cite

[1]
“On Gradient Descent and Co-ordinate Descent methods and its variants”., AJSE, vol. 19, no. 3, pp. 107–115, Dec. 2020, doi: 10.53799/ajse.v19i3.103.