English

Comparison of Minimization Methods for Rosenbrock Functions

Optimization and Control 2021-04-26 v3 Systems and Control Systems and Control

Abstract

This paper gives an in-depth review of the most common iterative methods for unconstrained optimization using two functions that belong to a class of Rosenbrock functions as a performance test. This study covers the Steepest Gradient Descent Method, the Newton-Raphson Method, and the Fletcher-Reeves Conjugate Gradient method. In addition, four different step-size selecting methods including fixed-step-size, variable step-size, quadratic-fit, and golden section method were considered. Due to the computational nature of solving minimization problems, testing the algorithms is an essential part of this paper. Therefore, an extensive set of numerical test results is also provided to present an insightful and a comprehensive comparison of the reviewed algorithms. This study highlights the differences and the trade-offs involved in comparing these algorithms.

Keywords

Cite

@article{arxiv.2101.10546,
  title  = {Comparison of Minimization Methods for Rosenbrock Functions},
  author = {Iyanuoluwa Emiola and Robson Adem},
  journal= {arXiv preprint arXiv:2101.10546},
  year   = {2021}
}

Comments

Title of the paper was changed and simulations were presented in a clear manner

R2 v1 2026-06-23T22:31:45.939Z