Access Statistics for François Glineur

Author contact details at EconPapers.

Working Paper File Downloads Abstract Views
Last month 3 months 12 months Total Last month 3 months 12 months Total
A continuous characterization of the maximum-edge biclique problem 0 0 0 0 0 0 0 4
A convex formulation for informed source separation in the signle channel setting 0 0 0 0 0 0 0 4
A geometric lower bound on the extension complexity of polytopes based on the f-vector 0 0 0 0 0 2 4 8
A global-local synthesis approach for large non-regular arrays 0 0 0 0 0 0 1 1
A multilevel approach for nonnegative matrix factorization 0 0 0 25 0 0 0 58
A multilevel approach for nonnegative matrix factorization 0 0 0 2 0 0 0 23
ACUTA: a novel method for eliciting additive value functions on the basis of holistic preference statements 0 0 0 5 0 0 1 28
Accelerated multiplicative updates and hierarchical ALS algorithms for nonnegative matrix factorization 0 0 0 4 0 0 0 34
Accelerated multiplicative updates and hierarchical als algorithms for nonnegative matrix factorization 0 0 0 18 0 1 2 103
Algorithms for possible semidefinite factorization 0 0 0 0 0 0 0 11
An efficient sampling method for regression-based polynomial chaos expansion 0 0 0 5 0 0 0 36
An interior-point method for the single-facility location problem with mixed norms using a conic formulation 0 0 0 1 0 0 0 9
An interior-point method for the single-facility location problem with mixed norms using a conic formulation 0 0 0 19 0 0 0 87
Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming 0 0 0 0 0 0 1 8
Conic formulation for lp-norm optimization 0 0 0 1 0 1 1 20
Conic optimization-based algorithms for nonnegative matrix factorization 0 0 0 0 0 0 1 1
Direct deterministic nulling techniques for large random arrays including mutual coupling 0 0 0 0 0 0 1 11
Double smoothing technique for infinite-dimensional optimization problems with applications to optimal control 0 0 0 25 0 1 1 65
Double smoothing technique for large-scale linearly constrained convex optimization 0 0 0 6 0 0 0 31
Energy limits in primary frequency control with short-term frequency-band allocation 0 0 0 0 0 0 0 12
Exact worst-case convergence rates of the proximal gradient method for composite convex minimization 0 0 0 0 0 0 1 22
Exact worst-case performance of first-order methods for composite convex optimization 0 0 1 9 0 0 1 52
Exact worst-case performance of first-order methods for composite convex optimization 0 0 0 0 0 0 1 21
Extended Lanczos Bidiagonalization Algorithm for Low Rank Approximation and Its Applications 0 0 0 0 0 0 0 1
Extended formulations for order polytopes through network flows 0 0 0 0 0 0 0 5
First-order methods of smooth convex optimization with inexact oracle 0 0 0 0 0 0 3 3
First-order methods of smooth convex optimization with inexact oracle 0 0 1 48 1 1 5 217
First-order methods with inexact oracle: the strongly convex case 0 0 3 89 2 5 13 287
Heuristics for Exact Nonnegative Matrix Factorization 0 0 0 0 0 1 1 10
Heuristics for exact nonnegative matrix factorization 0 0 0 18 0 0 0 127
Image completion via nonnegative matrix factorization using HALS and B-splines 0 0 0 0 0 2 7 17
Impact of the material distribution formalism on the efficiency of evolutionary methods for topology optimization 0 0 0 0 0 0 0 10
Improving complexity of structured convex optimization problems usiion ng self-concordant barriers 0 0 0 0 0 0 0 11
Intermediate gradient methods for smooth convex problems with inexact oracle 0 0 1 26 0 0 1 101
Iterative convex approximation bases real-time dynamic spectrum management in multi-user multi-carrier communication systems 0 0 0 0 0 0 0 0
Les méthodes de point intérieur 0 0 0 0 0 0 0 10
Linear convergence of first order methods for non-strongly convex optimization 0 0 0 0 0 0 3 39
Low-rank matrix approximation with weights or missing data is NP-hard 0 0 0 14 0 0 1 104
Low-rank matrix approximation with weights or missing data is NP-hard 0 0 0 2 0 0 0 19
Lower bounds on the nonnegative rank using a nested polytopes formulation 0 0 0 0 0 2 4 10
Nonnegative Matrix Factorization over Continuous Signals using Parametrizable Functions 0 0 0 1 2 2 4 18
Nonnegative factorization and the maximum edge biclique problem 0 0 1 21 0 1 7 149
Nonnegative factorization and the maximum edge biclique problem 0 0 0 17 0 1 1 80
On the Worst-case Complexity of the Gradient Method with Exact Line Search for Smooth Strongly Convex Functions 0 0 0 4 1 1 1 29
On the geometric interpretation of the nonnegative rank 0 0 0 7 0 0 0 54
On the geometric interpretation of the nonnegative rank 0 0 0 0 0 0 0 19
On the linear extension complexity of regular n-gons 0 0 0 0 0 0 0 4
On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions 0 0 0 5 0 0 1 22
On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions 0 0 0 0 0 0 1 18
Peak shaving: a planning alternative to reduce investment costs in distribution systems? 0 0 0 0 0 0 0 15
Random block coordinate descent methods for linearly constrained optimization over networks 0 0 0 0 0 1 1 17
Real-time dynamic spectrum management for multi-user multi-carrier communication systems 0 0 0 0 0 0 0 0
Smooth Strongly Convex Interpolation and Exact Worst-case Performance of First-order Methods 0 0 0 4 0 0 2 37
Smooth strongly convex interpolation and exact worst-case performance of first-order methods 0 0 0 0 0 1 10 41
Solving infinite-dimensional optimizaiton problems by polynomial approximation 0 0 0 0 0 0 0 8
Solving infinite-dimensional optimization problems by polynomial approximation 0 0 0 25 0 0 1 101
Two algorithms for orthogonal nonnegative matrix factorization with application to clusterin 0 0 0 0 0 0 1 4
Unsupervised Minimum Redundancy Maximum Relevance Feature Selection for Predictive Maintenance: Application to a Rotating Machine 0 0 0 0 0 0 2 11
Using underapproximations for sparse nonnegative matrix factorization 0 0 0 1 0 1 1 16
Using underapproximations for sparse nonnegative matrix factorization 0 0 0 27 0 0 1 86
Weighted sum rate maximization for downlink OFDMA with subcarrier-pair basded opportunistic DF relaying 0 0 0 0 1 1 1 1
Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation 0 0 0 0 0 0 0 6
Worst-case convergence analysis of inexact gradient and Newton methods through semidefinite programming performance estimation 0 0 0 2 0 0 0 15
Total Working Papers 0 0 7 431 7 25 89 2,371


Journal Article File Downloads Abstract Views
Last month 3 months 12 months Total Last month 3 months 12 months Total
A continuous characterization of the maximum-edge biclique problem 0 0 0 4 0 0 0 22
ACUTA: A novel method for eliciting additive value functions on the basis of holistic preference statements 0 1 1 25 0 1 1 131
Algorithms for positive semidefinite factorization 0 0 0 1 0 0 0 11
An interior-point method for the single-facility location problem with mixed norms using a conic formulation 0 0 0 0 0 0 0 11
Conic Formulation for l p -Norm Optimization 0 0 0 2 0 0 1 14
Exact Worst-Case Convergence Rates of the Proximal Gradient Method for Composite Convex Minimization 0 0 0 4 1 1 3 24
Improving complexity of structured convex optimization problems using self-concordant barriers 0 0 0 4 0 0 0 30
Proving Strong Duality for Geometric Optimization Using a Conic Formulation 0 0 0 0 0 0 0 3
Random Block Coordinate Descent Methods for Linearly Constrained Optimization over Networks 0 0 0 2 0 1 2 18
Total Journal Articles 0 1 1 42 1 3 7 264


Statistics updated 2024-05-04