216 citations · 1k across the 31 of their papers we have counts for
32 papers
A discussion about violin reduction: geometric analysis of contour lines and channel of minima
Philémon Beghin, Anne-Emmanuelle Ceulemans, François Glineur
Some early violins have been reduced during their history to fit imposed morphological standards, while more recent ones have been built directly to these standards. We can observe…
Optimal inexactness schedules for Tunable Oracle based Methods
Guillaume Van Dessel, François Glineur
Several recent works address the impact of inexact oracles in the convergence analysis of modern first-order optimization techniques, e.g. Bregman Proximal Gradient and Prox-Linear…
Snacks: a fast large-scale kernel SVM solver
Sofiane Tanji, Andrea Della Vecchia, François Glineur +1
Kernel methods provide a powerful framework for non parametric learning. They are based on kernel functions and allow learning in a rich functional space while applying linear stat…
On the Worst-Case Analysis of Cyclic Coordinate-Wise Algorithms on Smooth Convex Functions
Yassine Kamri, Julien M. Hendrickx, François Glineur
We propose a unifying framework for the automated computer-assisted worst-case analysis of cyclic block coordinate algorithms in the unconstrained smooth convex optimization setup.…
Real-time image-guided treatment of mobile tumors in proton therapy by a library of treatment plans: a simulation study
Valentin Hamaide, Kevin Souris, Damien Dasnoy +2
Purpose: To improve target coverage and reduce the dose in the surrounding organs-at-risks (OARs), we developed an image-guided treatment method based on a precomputed library of t…
Least-squares methods for nonnegative matrix factorization over rational functions
Cécile Hautecoeur, Lieven De Lathauwer, Nicolas Gillis +1
Nonnegative Matrix Factorization (NMF) models are widely used to recover linearly mixed nonnegative data. When the data is made of samplings of continuous signals, the factors in N…
Validation of a photogrammetric approach for the objective study of ancient bowed instruments
Philémon Beghin, Anne-Emmanuelle Ceulemans, Paul Fisette +1
Some early violins have been reduced during their history to fit imposed morphological standards, while more recent ones have been built directly to these standards. We propose an…
Conic-Optimization Based Algorithms for Nonnegative Matrix Factorization
Valentin Leplat, Yurii Nesterov, Nicolas Gillis +1
Nonnegative matrix factorization is the following problem: given a nonnegative input matrix and a factorization rank , compute two nonnegative matrices, with columns…
New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition
Shuyu Dong, Bin Gao, Yu Guan +1
We propose new Riemannian preconditioned algorithms for low-rank tensor completion via the polyadic decomposition of a tensor. These algorithms exploit a non-Euclidean metric on th…
Alternating minimization algorithms for graph regularized tensor completion
Yu Guan, Shuyu Dong, Bin Gao +2
We consider a Canonical Polyadic (CP) decomposition approach to low-rank tensor completion (LRTC) by incorporating external pairwise similarity relations through graph Laplacian re…
Extended Formulations for Order Polytopes through Network Flows
Clintin P. Davis-Stober, Jean-Paul Doignon, Samuel Fiorini +2
Mathematical psychology has a long tradition of modeling probabilistic choice via distribution-free random utility models and associated random preference models. For such models,…
Worst-case convergence analysis of inexact gradient and Newton methods through semidefinite programming performance estimation
Etienne de Klerk, Francois Glineur, Adrien Taylor
We provide new tools for worst-case performance analysis of the gradient (or steepest descent) method of Cauchy for smooth strongly convex functions, and Newton's method for self-c…
Algorithms for Positive Semidefinite Factorization
Arnaud Vandaele, François Glineur, Nicolas Gillis
This paper considers the problem of positive semidefinite factorization (PSD factorization), a generalization of exact nonnegative matrix factorization. Given an -by- nonnega…
Exact worst-case convergence rates of the proximal gradient method for composite convex minimization
Adrien B. Taylor, Julien M. Hendrickx, François Glineur
We study the worst-case convergence rates of the proximal gradient method for minimizing the sum of a smooth strongly convex function and a non-smooth convex function whose proxima…
A robust convex optimization framework for autonomous network planning under load uncertainty
Benoît Martin, François Glineur, Emmanuel De Jaeger
Autonomous microgrid planning is a Mixed-Integer Non Convex decision problem that requires to consider investments in both distribution and generation capacity and represents signi…
On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
Etienne de Klerk, François Glineur, Adrien B. Taylor
We consider the gradient (or steepest) descent method with exact line search applied to a strongly convex function with Lipschitz continuous gradient. We establish the exact worst-…
Exact Worst-case Performance of First-order Methods for Composite Convex Optimization
Adrien B. Taylor, Julien M. Hendrickx, François Glineur
We provide a framework for computing the exact worst-case performance of any algorithm belonging to a broad class of oracle-based first-order methods for composite convex optimizat…
Complexity of first order inexact Lagrangian and penalty methods for conic convex programming
Ion Necoara, Andrei Patrascu, Francois Glineur
In this paper we present a complete iteration complexity analysis of inexact first order Lagrangian and penalty methods for solving cone constrained convex problems that have or ma…
On the Linear Extension Complexity of Regular n-gons
Arnaud Vandaele, Nicolas Gillis, François Glineur
In this paper, we propose new lower and upper bounds on the linear extension complexity of regular -gons. Our bounds are based on the equivalence between the computation of (i)…
Smooth Strongly Convex Interpolation and Exact Worst-case Performance of First-order Methods
Adrien B. Taylor, Julien M. Hendrickx, François Glineur
We show that the exact worst-case performance of fixed-step first-order methods for unconstrained optimization of smooth (possibly strongly) convex functions can be obtained by sol…
Heuristics for Exact Nonnegative Matrix Factorization
Arnaud Vandaele, Nicolas Gillis, François Glineur +1
The exact nonnegative matrix factorization (exact NMF) problem is the following: given an -by- nonnegative matrix and a factorization rank , find, if possible, an -…
Spectrum optimization in multi-user multi-carrier systems with iterative convex and nonconvex approximation methods
Paschalis Tsiaflakis, François Glineur
Several practical multi-user multi-carrier communication systems are characterized by a multi-carrier interference channel system model where the interference is treated as noise.…
Real-time dynamic spectrum management for multi-user multi-carrier communication systems
Paschalis Tsiaflakis, François Glineur, Marc Moonen
Dynamic spectrum management is recognized as a key technique to tackle interference in multi-user multi-carrier communication systems and networks. However existing dynamic spectru…
Weighted Sum Rate Maximization for Downlink OFDMA with Subcarrier-pair based Opportunistic DF Relaying
Tao Wang, Francois Glineur, Jerome Louveaux +1
This paper addresses a weighted sum rate (WSR) maximization problem for downlink OFDMA aided by a decode-and-forward (DF) relay under a total power constraint. A novel subcarrier-p…