Search Results - "Glineur, Francois"

Least-Squares Methods for Nonnegative Matrix Factorization Over Rational Functions by Hautecoeur, Cecile, De Lathauwer, Lieven, Gillis, Nicolas, Glineur, Francois

“…Nonnegative matrix factorization (NMF) models are widely used to analyze linearly mixed nonnegative data. When the data is made of samplings of continuous…”
Get full text

On the Set of Possible Minimizers of a Sum of Convex Functions by Zamani, Moslem, Glineur, Francois, Hendrickx, Julien M.

“…Consider a sum of convex functions, where the only information known about each individual summand is the location of a minimizer. In this letter, we give an…”
Get full text

Weighted Sum Rate Maximization for Downlink OFDMA With Subcarrier-Pair Based Opportunistic DF Relaying by Tao Wang, Glineur, Francois, Louveaux, Jeme, Vandendorpe, Luc

“…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…”
Get full text

Real-Time Dynamic Spectrum Management for Multi-User Multi-Carrier Communication Systems by TSIAFLAKIS, Paschalis, GLINEUR, François, MOONEN, Marc

Get full text

A Global-Local Synthesis Approach for Large Non-Regular Arrays by Clavier, Thibault, Razavi-Ghods, Nima, Glineur, Francois, Gonzalez-Ovejero, David, de Lera Acedo, Eloy, Craeye, Christophe, Alexander, Paul

“…A method is proposed for the synthesis of large planar non-regular arrays assuming constant magnitude for the excitation of the elements. The approach, which…”
Get full text

Accelerated multiplicative updates and hierarchical ALS algorithms for nonnegative matrix factorization by Gillis, Nicolas, Glineur, François

“…Nonnegative matrix factorization (NMF) is a data analysis technique used in a great variety of applications such as text mining, image processing,…”
Get more information

First-order methods of smooth convex optimization with inexact oracle by Devolder, Olivier, Glineur, François, Nesterov, Yurii

“…We introduce the notion of inexact first-order oracle and analyze the behavior of several first-order methods of smooth convex optimization used with such an…”
Get full text

Smooth strongly convex interpolation and exact worst-case performance of first-order methods by Taylor, Adrien B., Hendrickx, Julien M., Glineur, François

“…We show that the exact worst-case performance of fixed-step first-order methods for unconstrained optimization of smooth (possibly strongly) convex functions…”
Get full text

Using underapproximations for sparse nonnegative matrix factorization by Gillis, Nicolas, Glineur, François

“…Nonnegative matrix factorization consists in (approximately) factorizing a nonnegative data matrix by the product of two low-rank nonnegative matrices. It has…”
Get full text

Exact Worst-Case Convergence Rates of the Proximal Gradient Method for Composite Convex Minimization by Taylor, Adrien B., Hendrickx, Julien M., Glineur, François

“…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…”
Get full text

Random Block Coordinate Descent Methods for Linearly Constrained Optimization over Networks by Necoara, Ion, Nesterov, Yurii, Glineur, François

“…In this paper we develop random block coordinate descent methods for minimizing large-scale linearly constrained convex problems over networks. Since coupled…”
Get full text

On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions by de Klerk, Etienne, Glineur, François, Taylor, Adrien B.

“…We consider the gradient (or steepest) descent method with exact line search applied to a strongly convex function with Lipschitz continuous gradient. We…”
Get full text

On the geometric interpretation of the nonnegative rank by Gillis, Nicolas, Glineur, François

“…The nonnegative rank of a nonnegative matrix is the minimum number of nonnegative rank-one factors needed to reconstruct it exactly. The problem of determining…”
Get full text

Optimal inexactness schedules for tunable oracle-based methods by Van Dessel, Guillaume, Glineur, François

“…Several recent works address the impact of inexact oracles in the convergence analysis of modern first-order optimization techniques, e.g. Bregman Proximal…”
Get full text

Nonnegative Matrix Factorization over Continuous Signals using Parametrizable Functions by Hautecoeur, Cécile, Glineur, François

“…Nonnegative matrix factorization is a popular data analysis tool able to extract significant features from nonnegative data. We consider an extension of this…”
Get full text

Conic optimization-based algorithms for nonnegative matrix factorization by Leplat, Valentin, Nesterov, Yurii, Gillis, Nicolas, Glineur, François

“…Nonnegative matrix factorization is the following problem: given a nonnegative input matrix V and a factorization rank K, compute two nonnegative matrices, W…”
Get full text

Proximal gradient methods with inexact oracle of degree q for composite optimization by Nabou, Yassine, Glineur, François, Necoara, Ion

“…Abstract We introduce the concept of inexact first-order oracle of degree q for a possibly nonconvex and nonsmooth function, which naturally appears in the…”
Get full text

Unsupervised Minimum Redundancy Maximum Relevance Feature Selection for Predictive Maintenance: Application to a Rotating Machine by Hamaide, Valentin, Glineur, François

“…Identifying and selecting optimal prognostic health indicators in the context of predictive maintenance is essential to obtain a good model and make accurate…”
Get full text

Real‐time image‐guided treatment of mobile tumors in proton therapy by a library of treatment plans: a simulation study by Hamaide, Valentin, Souris, Kevin, Dasnoy, Damien, Glineur, François, Macq, Benoît

“…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…”
Get full text

A geometric lower bound on the extension complexity of polytopes based on the f-vector by Dewez, Julien, Gillis, Nicolas, Glineur, François

“…A linear extension of a polytope Q is any polytope which can be mapped onto Q via an affine transformation. The extension complexity of a polytope is the…”
Get full text