SOLVE ONE-DIMENSIONAL OPTIMIZATION PROBLEMS USING NEWTON-RAPHSON METHOD

CHUANPIT  MUNGKALA; PHEERACHETE  BUNPATCHARACHAROEN; JIRAPORN JANWISED

SOLVE ONE-DIMENSIONAL OPTIMIZATION PROBLEMS USING NEWTON-RAPHSON METHOD

Authors

CHUANPIT MUNGKALA Department of Mathematics, Faculty of Science and Technology, Rambhai Barni Rajabhat University, Chanthaburi 22000, Thailand
PHEERACHETE BUNPATCHARACHAROEN Department of Mathematics, Faculty of Science and Technology, Rambhai Barni Rajabhat University, Chanthaburi 22000, Thailand
JIRAPORN JANWISED Department of Mathematics, Faculty of Science and Technology, Rambhai Barni Rajabhat University, Chanthaburi 22000, Thailand

Keywords:

Optimization, Newton – Raphson method, Random Search Method

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.