François Glineur
Orcid: 0000-0002-5890-1093
According to our database1,
François Glineur
authored at least 54 papers
between 2001 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Optim. Methods Softw., July, 2023
IEEE Trans. Signal Process., 2023
Proceedings of the European Control Conference, 2023
On the Worst-Case Analysis of Cyclic Coordinate-Wise Algorithms on Smooth Convex Functions.
Proceedings of the European Control Conference, 2023
Can random proximal coordinate descent be accelerated on nonseparable convex composite minimization problems?
Proceedings of the European Control Conference, 2023
2022
New Riemannian Preconditioned Algorithms for Tensor Completion via Polyadic Decomposition.
SIAM J. Matrix Anal. Appl., 2022
CoRR, 2022
A two-level machine learning framework for predictive maintenance: comparison of learning formulations.
CoRR, 2022
PEPit: computer-assisted worst-case analyses of first-order optimization methods in Python.
CoRR, 2022
2021
A geometric lower bound on the extension complexity of polytopes based on the f-vector.
Discret. Appl. Math., 2021
Hierarchical alternating nonlinear least squares for nonnegative matrix factorization using rational functions.
Proceedings of the 29th European Signal Processing Conference, 2021
Transfer learning in Bayesian optimization for the calibration of a beam line in proton therapy.
Proceedings of the 29th European Symposium on Artificial Neural Networks, 2021
2020
Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation.
SIAM J. Optim., 2020
Nonnegative Matrix Factorization over Continuous Signals using Parametrizable Functions.
Neurocomputing, 2020
CoRR, 2020
Proceedings of the 28th European Symposium on Artificial Neural Networks, 2020
Proceedings of the 28th European Symposium on Artificial Neural Networks, 2020
2019
Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming.
Optim. Methods Softw., 2019
Math. Program., 2019
Accelerating Nonnegative Matrix Factorization Over Polynomial Signals With Faster Projections.
Proceedings of the 29th IEEE International Workshop on Machine Learning for Signal Processing, 2019
Nonnegative matrix factorization with polynomial signals via hierarchical alternating least squares.
Proceedings of the 27th European Symposium on Artificial Neural Networks, 2019
Proceedings of the 31st Benelux Conference on Artificial Intelligence (BNAIC 2019) and the 28th Belgian Dutch Conference on Machine Learning (Benelearn 2019), 2019
2018
Exact Worst-Case Convergence Rates of the Proximal Gradient Method for Composite Convex Minimization.
J. Optim. Theory Appl., 2018
2017
Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization.
SIAM J. Optim., 2017
On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions.
Optim. Lett., 2017
Smooth strongly convex interpolation and exact worst-case performance of first-order methods.
Math. Program., 2017
Random Block Coordinate Descent Methods for Linearly Constrained Optimization over Networks.
J. Optim. Theory Appl., 2017
Performance estimation toolbox (PESTO): Automated worst-case analysis of first-order optimization methods.
Proceedings of the 56th IEEE Annual Conference on Decision and Control, 2017
2016
Extended Lanczos bidiagonalization algorithm for low rank approximation and its applications.
J. Comput. Appl. Math., 2016
On decentralized control of small loads and energy rebound within primary frequency control.
Proceedings of the Power Systems Computation Conference, 2016
2015
2014
Real-Time Dynamic Spectrum Management for Multi-User Multi-Carrier Communication Systems.
IEEE Trans. Commun., 2014
Iterative Convex Approximation Based Real-Time Dynamic Spectrum Management in Multi-User Multi-Carrier Communication Systems.
IEEE Signal Process. Lett., 2014
Math. Program., 2014
J. Glob. Optim., 2014
Two algorithms for orthogonal nonnegative matrix factorization with application to clustering.
Neurocomputing, 2014
Neurocomputing, 2014
2013
Weighted Sum Rate Maximization for Downlink OFDMA With Subcarrier-Pair Based Opportunistic DF Relaying.
IEEE Trans. Signal Process., 2013
Spectrum optimization in multi-user multi-carrier systems with iterative convex and nonconvex approximation methods.
CoRR, 2013
ONP-MF: An Orthogonal Nonnegative Matrix Factorization Algorithm with Application to Clustering.
Proceedings of the 21st European Symposium on Artificial Neural Networks, 2013
Proceedings of the 21st European Symposium on Artificial Neural Networks, 2013
2012
SIAM J. Optim., 2012
Accelerated Multiplicative Updates and Hierarchical ALS Algorithms for Nonnegative Matrix Factorization.
Neural Comput., 2012
J. Comput. Appl. Math., 2012
Proceedings of IEEE International Conference on Communications, 2012
2011
SIAM J. Matrix Anal. Appl., 2011
2010
Pattern Recognit., 2010
ACUTA: A novel method for eliciting additive value functions on the basis of holistic preference statements.
Eur. J. Oper. Res., 2010
2009
Document Classification using Nonnegative Matrix Factorization and Underapproximation.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2009), 2009
2008
An interior-point method for the single-facility location problem with mixed norms using a conic formulation.
Math. Methods Oper. Res., 2008
2002
Improving complexity of structured convex optimization problems using self-concordant barriers.
Eur. J. Oper. Res., 2002
2001
Ann. Oper. Res., 2001