Abstract
In this paper, we deal with a new searching method algorithm. Previously we suggested new searching method SCAM (Sequence Coordinate Additive Method), and this algorithm is giving good results. But in this method a time-consuming linear searching is necessary. Here, we propose the Preliminary Searching SCAM.
This method has the following properties. (1) Linear searching isn't necessary. (2) This method has second order convergence. (3) If the object function is of a quadratic form, by only the same number of trials as the number of coordinates, we can arrive at the optimal point.
In this paper, we describe this new algorithm and the comparison of the calculating time and the convergence.
