Solve one-dimensional optimization problems using Newton-Raphson Method

Authors

  • C. Mungkala Department of Mathematics, Faculty of Science and Technology, Rambhai Barni Rajabhat University, Chanthaburi 22000, Thailand
  • P. Bunpatcharacharoen Department of Mathematics, Faculty of Science and Technology, Rambhai Barni Rajabhat University, Chanthaburi 22000, Thailand
  • J. Janwised Department of Mathematics, Faculty of Science and Technology, Rambhai Barni Rajabhat University, Chanthaburi 22000, Thailand

Abstract

This research studied solve one-dimensional optimization problems using Newton -- Raphson Method. This method uses first derivatives to solve solutions. It was tested with 12 function tests and tested the efficiency of the solution convergence rate Newton -- Raphson method and the random search method. It was found that the Newton-Raphson method was more effective in converging rate to better answers than random search methods. The error value and the iteration are indicative.

Downloads

Published

2017-12-31

How to Cite

Mungkala, C., Bunpatcharacharoen, P., & Janwised, J. (2017). Solve one-dimensional optimization problems using Newton-Raphson Method. Journal of Nonlinear Analysis and Optimization: Theory & Applications, 8(2), 109-120. Retrieved from http://www.math.sci.nu.ac.th/ojs302/index.php/jnao/article/view/558

Issue

Section

Research Article