Main Article Content
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.
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
All contents of the AIUB JOURNAL OF SCIENCE AND ENGINEERING Web Site are: Copyright 2019 by AJSE and/or its suppliers. All rights reserved.