<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Manuel V. C. Vieira</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The Accuracy of Interior-Point Methods Based on Kernel Functions</style></title><secondary-title><style face="normal" font="default" size="100%">J. Optimization Theory and Applications</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">155</style></volume><pages><style face="normal" font="default" size="100%">637-649</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;For the last decade, interior-point methods that use barrier functions induced by some real univariate kernel functions have been studied. In these interior-point methods, the algorithm stops when a solution is found such that it is close (in the barrier function sense) to a point in the central path with the desired accuracy. However, this does not directly imply that the algorithm generates a solution with prescribed accuracy. Until now, this had not been appropriately addressed. In this paper, we analyze the accuracy of the solution produced by the aforementioned algorithm.&lt;/p&gt;
</style></abstract><issue><style face="normal" font="default" size="100%">2</style></issue><notes><style face="normal" font="default" size="100%">&lt;p&gt;n/a&lt;/p&gt;
</style></notes></record></records></xml>