First-order methods of smooth convex optimization with inexact oracle O Devolder, F Glineur, Y Nesterov Mathematical Programming 146, 37-75, 2014 | 618 | 2014 |
Linear convergence of first order methods for non-strongly convex optimization I Necoara, Y Nesterov, F Glineur Mathematical Programming 175, 69-107, 2019 | 378 | 2019 |
Accelerated multiplicative updates and hierarchical ALS algorithms for nonnegative matrix factorization N Gillis, F Glineur Neural computation 24 (4), 1085-1105, 2012 | 274 | 2012 |
Smooth strongly convex interpolation and exact worst-case performance of first-order methods AB Taylor, JM Hendrickx, F Glineur Mathematical Programming 161, 307-345, 2017 | 241 | 2017 |
Two algorithms for orthogonal nonnegative matrix factorization with application to clustering F Pompili, N Gillis, PA Absil, F Glineur Neurocomputing 141, 15-25, 2014 | 191 | 2014 |
Low-rank matrix approximation with weights or missing data is NP-hard N Gillis, F Glineur SIAM Journal on Matrix Analysis and Applications 32 (4), 1149-1165, 2011 | 173 | 2011 |
Exact worst-case performance of first-order methods for composite convex optimization AB Taylor, JM Hendrickx, F Glineur SIAM Journal on Optimization 27 (3), 1283-1313, 2017 | 145 | 2017 |
Using underapproximations for sparse nonnegative matrix factorization N Gillis, F Glineur Pattern recognition 43 (4), 1676-1687, 2010 | 145* | 2010 |
Random block coordinate descent methods for linearly constrained optimization over networks I Necoara, Y Nesterov, F Glineur Journal of Optimization Theory and Applications 173, 227-254, 2017 | 116* | 2017 |
ACUTA: A novel method for eliciting additive value functions on the basis of holistic preference statements G Bous, P Fortemps, F Glineur, M Pirlot European Journal of Operational Research 206 (2), 435-444, 2010 | 106 | 2010 |
On the geometric interpretation of the nonnegative rank N Gillis, F Glineur Linear Algebra and its Applications 437 (11), 2685-2712, 2012 | 95 | 2012 |
Double smoothing technique for large-scale linearly constrained convex optimization O Devolder, F Glineur, Y Nesterov SIAM Journal on Optimization 22 (2), 702-727, 2012 | 94* | 2012 |
Exact worst-case convergence rates of the proximal gradient method for composite convex minimization AB Taylor, JM Hendrickx, F Glineur Journal of Optimization Theory and Applications 178, 455-476, 2018 | 93 | 2018 |
On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions E De Klerk, F Glineur, AB Taylor Optimization Letters 11, 1185-1199, 2017 | 91 | 2017 |
First-order methods with inexact oracle: the strongly convex case O Devolder, F Glineur, Y Nesterov CORE Discussion Papers 2013016, 47, 2013 | 88 | 2013 |
Nonnegative factorization and the maximum edge biclique problem N Gillis, F Glineur Arxiv preprint arXiv:0810.4225, 2008 | 78 | 2008 |
Performance estimation toolbox (PESTO): Automated worst-case analysis of first-order optimization methods AB Taylor, JM Hendrickx, F Glineur 2017 IEEE 56th Annual Conference on Decision and Control (CDC), 1278-1283, 2017 | 72 | 2017 |
Computational experiments with a linear approximation of second-order cone optimization F Glineur | 56 | 2000 |
Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming I Necoara, A Patrascu, F Glineur Optimization Methods and Software 34 (2), 305-335, 2019 | 54 | 2019 |
Conic Formulation for l p-Norm Optimization F Glineur, T Terlaky Journal of optimization theory and applications 122 (2), 285-307, 2004 | 51 | 2004 |