<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">T. BOUALI</style></author><author><style face="normal" font="default" size="100%">M. BELLOUFI</style></author><author><style face="normal" font="default" size="100%">R. GUEFAIFIA</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">GLOBAL CONVERGENCE OF THE TMR METHOD FOR UNCONSTRAINED OPTIMIZATION PROBLEMS</style></title><secondary-title><style face="normal" font="default" size="100%">Communications in Applied Analysis</style></secondary-title><alt-title><style face="normal" font="default" size="100%">CAA</style></alt-title><short-title><style face="normal" font="default" size="100%">TMR Method for Optimization Problems  </style></short-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">65H10</style></keyword><keyword><style  face="normal" font="default" size="100%">90C26</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2017</style></year><pub-dates><date><style  face="normal" font="default" size="100%">01/2017</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.acadsol.eu/en/articles/21/1/2.pdf</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">21</style></volume><pages><style face="normal" font="default" size="100%">15</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p class=&quot;rtejustify&quot;&gt;Conjugate gradient methods are probably the most famous&amp;nbsp;iterative methods for solving large scale optimization problems in scientific&amp;nbsp;and engineering computation, characterized by the simplicity of their iteration&lt;br /&gt;
and their low memory requirements. It is well known that the search direction&amp;nbsp;plays a main role in the line search method. In this paper, we propose a new&amp;nbsp;search direction with the Wolfe line search technique for solving unconstrained&amp;nbsp;optimization problems. Under the above line searches and some assumptions,&amp;nbsp;the global convergence properties of the given methods are discussed. Numerical result shows that the proposed formula is superior and more efficient when&amp;nbsp;compared to other CG coefficients.&lt;br /&gt;
&amp;nbsp;&lt;/p&gt;
</style></abstract><issue><style face="normal" font="default" size="100%">1</style></issue><work-type><style face="normal" font="default" size="100%">scientific: mathematics</style></work-type><section><style face="normal" font="default" size="100%">15</style></section></record></records></xml>