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

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 4 29
ACUTA: A novel method for eliciting additive value functions on the basis of holistic preference statements 0 1 3 28 1 2 9 143
Algorithms for positive semidefinite factorization 0 0 0 1 0 0 3 15
An interior-point method for the single-facility location problem with mixed norms using a conic formulation 0 0 0 0 0 0 8 20
Conic Formulation for l p -Norm Optimization 0 0 0 3 0 1 9 26
Exact Worst-Case Convergence Rates of the Proximal Gradient Method for Composite Convex Minimization 0 0 1 5 1 5 18 52
Improving complexity of structured convex optimization problems using self-concordant barriers 0 0 0 4 0 1 11 41
Proving Strong Duality for Geometric Optimization Using a Conic Formulation 0 0 0 0 0 1 12 15
Random Block Coordinate Descent Methods for Linearly Constrained Optimization over Networks 0 0 2 5 0 0 8 29
Total Journal Articles 0 1 6 50 2 10 82 370

logo

LogEc Home

Top Working Papers
Top Journal Articles
Top Books
Top Chapters
Top Software Items

Top Authors

Top Working Paper series and Journals

About LogEc

Authors with papers registered in the RePEc Author Service.

Register yourself as an author or register more papers in the RePEc Author Service.

Authors with no registered papers

RePEc
LogEc provides access and usage statistics for services based on the RePEc data set.

Örebro UniversityLogEc is hosted by the Örebro University School of Business.

Questions or comments? Please see our explanation of how the statistics are collected or e-mail

Since October 2025, abstract view statistics are potentially heavily influenced by traffic from AI bots and tools that we could not eliminate despite our best efforts.

Statistics updated 2026-10-11