A filled function method for finding a global minimizer of a function of several variables
Mathematical Programming: Series A and B
Inexact Newton methods for solving nonsmooth equations
Proceedings of the international meeting on Linear/nonlinear iterative methods and verification of solution
Global Optimization Techniques for Mixed Complementarity Problems
Journal of Global Optimization
NCP Functions Applied to Lagrangian Globalization for the Nonlinear Complementarity Problem
Journal of Global Optimization
A New Filled Function Method for Global Optimization
Journal of Global Optimization
The Lagrangian Globalization Method for Nonsmooth Constrained Equations
Computational Optimization and Applications
A new filled function method for unconstrained global optimization
Journal of Computational and Applied Mathematics
Imperialist competitive algorithm for solving systems of nonlinear equations
Computers & Mathematics with Applications
Hi-index | 7.29 |
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.