<?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%">Nicolas Gillis</style></author><author><style face="normal" font="default" size="100%">Stephen A. Vavasis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">On the Complexity of Robust PCA and l1-Norm Low-Rank Matrix Approximation</style></title><secondary-title><style face="normal" font="default" size="100%">Mathematics of Operations Research</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><volume><style face="normal" font="default" size="100%">43</style></volume><pages><style face="normal" font="default" size="100%">1072-1084</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">Arxiv link: &lt;a href=&quot;https://arxiv.org/abs/1509.09236&quot;&gt;https://arxiv.org/abs/1509.09236&lt;/a&gt;</style></notes></record></records></xml>