C/o Dr Arif Nadeem 94 North city, Near Air Force Gate Pilibhit Bareilly UP India

 "Many algorithms have been proposed for nonlinear multidimensional combinatorial optimization models. Here in this paper we concentrate our attention to the unconstrained minimization of nonsmooth composite functions based on trust region approach. From the current iteration point, the iteration step is defined by minimizing a model function in a certain range around the iteration point, called a trust region. The proposed algorithm uses a smoothing function which is related to Fletcher's exact differential penalty function. Reduction of the amount of information to be stored during the computation is proposed"