Method of ``cleft-overstep'' by prependicular direction for solving the unconstrained nonlinear optimization problem (Q2277153)

We shall be concerned with the following unconstrained nonlinear optimization problems: ``minimize J(u), subject to \(u\in E^ n,''\) where J(u) is a nonlinear function and \(E^ n\) is the n-dimensional Euclidean space. The authors [Tap Chi Toan Hoc 15, 1-13 (Vietnamese) (1987)] proposed previously an algorithm of ``cleft-overstep'', also called the algorithm of quasi-bisectors for solving this problem. Based on this method we present here a new method called the algorithm of ``cleft- overstep in perpendicular direction''. Some examples are given.