{"id":48,"date":"2012-04-16T11:45:03","date_gmt":"2012-04-16T10:45:03","guid":{"rendered":"http:\/\/pageperso.math.univ-toulouse.fr\/reference\/?page_id=48"},"modified":"2021-05-29T17:01:09","modified_gmt":"2021-05-29T16:01:09","slug":"publications","status":"publish","type":"page","link":"https:\/\/perso.math.univ-toulouse.fr\/igavra\/publications\/","title":{"rendered":"Research"},"content":{"rendered":"<p><strong><span style=\"text-decoration: underline\">Articles<br \/>\n<\/span><\/strong><\/p>\n<p>S. Gadat, I. Gavra, L. Risser, \u00a0<em>How to compute the barycenter of a weighted graph. 2017 <\/em><strong>Mathematics of\u00a0 Operations\u00a0<\/strong><strong>Research,\u00a0 <\/strong>Volume 43, Number 4. <a href=\"http:\/\/perso.math.univ-toulouse.fr\/igavra\/files\/2012\/04\/Gadat_Gavra_Risser.pdf\">[Pdf]<\/a><\/p>\n<p>C. Bouttier, I. Gavra,<em>\u00a0Convergence rate of a simulated annealing algorithm with noisy. <\/em><br \/>\n<em> observations.\u00a0<\/em> Journal of Machine Learning Research,\u00a02019, Volume: <a href=\"https:\/\/jmlr.csail.mit.edu\/beta\/papers\/v20\/\">20<\/a>, Issue: 4, Pages: 1\u221245 <a href=\"http:\/\/perso.math.univ-toulouse.fr\/igavra\/files\/2012\/04\/NoisySA.pdf\">[Pdf]<\/a><\/p>\n<p><strong><span style=\"text-decoration: underline\">Preprints<\/span><\/strong><\/p>\n<p>S. Gadat, I Gavra <em>Asymptotic study of stochastic adaptive algorithms in <\/em><em>non-convex landscape. <\/em>2020 (soumis) <a href=\"http:\/\/perso.math.univ-toulouse.fr\/igavra\/files\/2021\/05\/GG_2020_relecture.pdf\">[Pdf]<\/a><em><br \/>\n<\/em><\/p>\n<p>I. Gavra, L. Risser,\u00a0<em>Online Estimation of Barycenters on Large Weighted Graphs.\u00a0 A multiscale strategy.\u00a0<\/em> <a href=\"http:\/\/perso.math.univ-toulouse.fr\/igavra\/files\/2012\/04\/PaperMPC.pdf\">[Pdf]<\/a><\/p>\n<p>&nbsp;<\/p>\n<p><span style=\"text-decoration: underline\"><strong>PhD Thesis<\/strong><\/span><\/p>\n<p><em>Stochastic algorithms for optimization under uncertainty on complex structures. Convergence and applications.<\/em>\u00a0<a href=\"http:\/\/perso.math.univ-toulouse.fr\/igavra\/files\/2012\/04\/PhDThesisGavra.pdf\">[Pdf]<\/a><\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Articles S. Gadat, I. Gavra, L. Risser, \u00a0How to compute the barycenter of a weighted graph. 2017 Mathematics of\u00a0 Operations\u00a0Research,\u00a0 Volume 43, Number 4. [Pdf] C. Bouttier, I. Gavra,\u00a0Convergence rate of a simulated annealing algorithm with noisy. observations.\u00a0 Journal of Machine Learning Research,\u00a02019, Volume: 20, Issue: 4, Pages: 1\u221245 [Pdf] Preprints S. Gadat, I Gavra [&hellip;]<\/p>\n","protected":false},"author":172,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-48","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/perso.math.univ-toulouse.fr\/igavra\/wp-json\/wp\/v2\/pages\/48","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/perso.math.univ-toulouse.fr\/igavra\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/perso.math.univ-toulouse.fr\/igavra\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/perso.math.univ-toulouse.fr\/igavra\/wp-json\/wp\/v2\/users\/172"}],"replies":[{"embeddable":true,"href":"https:\/\/perso.math.univ-toulouse.fr\/igavra\/wp-json\/wp\/v2\/comments?post=48"}],"version-history":[{"count":19,"href":"https:\/\/perso.math.univ-toulouse.fr\/igavra\/wp-json\/wp\/v2\/pages\/48\/revisions"}],"predecessor-version":[{"id":212,"href":"https:\/\/perso.math.univ-toulouse.fr\/igavra\/wp-json\/wp\/v2\/pages\/48\/revisions\/212"}],"wp:attachment":[{"href":"https:\/\/perso.math.univ-toulouse.fr\/igavra\/wp-json\/wp\/v2\/media?parent=48"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}