In this paper, a new filled function which has better properties is proposed for identifying a global minimum point for a general class of nonlinear programming problems within a closed bounded domain. An algorithm for unconstrained global optimization is developed from the new filled function. Theo
A new filled function method for an unconstrained nonlinear equation
β Scribed by Chengjun Wang; Ronghua Luo; Kun Wu; Boshun Han
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 248 KB
- Volume
- 235
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
β¦ Synopsis
a b s t r a c t
In this paper, we transform an unconstrained system of nonlinear equations into a special optimization problem. A new filled function is constructed by employing the special properties of the transformed optimization problem. Theoretical and numerical properties of the proposed filled function are investigated and a solution of the algorithm is proposed. Under some conditions, we can find a solution or an approximate solution to the system of nonlinear equations in finite iterations. The implementation of the algorithm on six test problems is reported with satisfactory numerical results.
π SIMILAR VOLUMES
In this paper, a new method for solving nonlinear equations f(x) = 0 is presented. In many literatures the derivatives are used, but the new method does not use the derivatives. Like the method of secant, the first derivative is replaced with a finite difference in this new method. The new method co
A new method for solving nonlinear equations is given. It is obtained by using the first step of the 0-algorithm. The order of the method proposed is always greater than or equal to two. Automatic error estimations for this method and for Steffensen's and Newton's methods are given. Theoretical resu