Details about François Glineur

Access statistics for papers by François Glineur.

Last updated 2024-02-07. Update your information in the RePEc Author Service.

Short-id: pgl27

Working Papers

2023

1. Conic optimization-based algorithms for nonnegative matrix factorization
   LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)

2021

2. A geometric lower bound on the extension complexity of polytopes based on the f-vector
   LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)
3. Image completion via nonnegative matrix factorization using HALS and B-splines
   LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)
4. Lower bounds on the nonnegative rank using a nested polytopes formulation
   LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)
5. Unsupervised Minimum Redundancy Maximum Relevance Feature Selection for Predictive Maintenance: Application to a Rotating Machine
   LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)

2020

6. Nonnegative Matrix Factorization over Continuous Signals using Parametrizable Functions
   LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)
7. Peak shaving: a planning alternative to reduce investment costs in distribution systems?
   LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)
8. Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation
   LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (6)

2019

9. Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming
   LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (3)
10. Linear convergence of first order methods for non-strongly convex optimization
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (15)

2018

11. Algorithms for possible semidefinite factorization
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)
12. Direct deterministic nulling techniques for large random arrays including mutual coupling
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)
13. Exact worst-case convergence rates of the proximal gradient method for composite convex minimization
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (6)
    See also Journal Article Exact Worst-Case Convergence Rates of the Proximal Gradient Method for Composite Convex Minimization, Journal of Optimization Theory and Applications, Springer (2018) View citations (6) (2018)
14. Extended formulations for order polytopes through network flows
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (1)

2017

15. Exact worst-case performance of first-order methods for composite convex optimization
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (8)
    Also in LIDAM Discussion Papers CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) (2016) View citations (2)
16. On the linear extension complexity of regular n-gons
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (1)
17. On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (7)
    Also in LIDAM Discussion Papers CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) (2016) View citations (1)
18. Random block coordinate descent methods for linearly constrained optimization over networks
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (6)
    See also Journal Article Random Block Coordinate Descent Methods for Linearly Constrained Optimization over Networks, Journal of Optimization Theory and Applications, Springer (2017) View citations (6) (2017)
19. Smooth strongly convex interpolation and exact worst-case performance of first-order methods
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (8)
    Also in LIDAM Discussion Papers CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) (2015) View citations (3)

2016

20. Extended Lanczos Bidiagonalization Algorithm for Low Rank Approximation and Its Applications
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)
21. Heuristics for Exact Nonnegative Matrix Factorization
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (3)
    Also in LIDAM Discussion Papers CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) (2015) View citations (1)

2014

22. A continuous characterization of the maximum-edge biclique problem
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (1)
    See also Journal Article A continuous characterization of the maximum-edge biclique problem, Journal of Global Optimization, Springer (2014) View citations (1) (2014)
23. A convex formulation for informed source separation in the signle channel setting
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)
24. A global-local synthesis approach for large non-regular arrays
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)
25. Energy limits in primary frequency control with short-term frequency-band allocation
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)
26. First-order methods of smooth convex optimization with inexact oracle
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (23)
    Also in LIDAM Discussion Papers CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) (2011) View citations (19)
27. Iterative convex approximation bases real-time dynamic spectrum management in multi-user multi-carrier communication systems
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)
28. Real-time dynamic spectrum management for multi-user multi-carrier communication systems
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)
29. Two algorithms for orthogonal nonnegative matrix factorization with application to clusterin
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (3)

2013

30. An efficient sampling method for regression-based polynomial chaos expansion
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)
31. First-order methods with inexact oracle: the strongly convex case
    LIDAM Discussion Papers CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (4)
32. Intermediate gradient methods for smooth convex problems with inexact oracle
    LIDAM Discussion Papers CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (5)
33. Weighted sum rate maximization for downlink OFDMA with subcarrier-pair basded opportunistic DF relaying
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (1)

2012

34. Accelerated multiplicative updates and hierarchical ALS algorithms for nonnegative matrix factorization
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (9)
    Also in LIDAM Discussion Papers CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) (2011) View citations (7)
35. Double smoothing technique for large-scale linearly constrained convex optimization
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (12)
36. On the geometric interpretation of the nonnegative rank
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (5)
    Also in LIDAM Discussion Papers CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) (2010) View citations (6)

2011

37. A multilevel approach for nonnegative matrix factorization
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (1)
    Also in LIDAM Discussion Papers CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) (2010) View citations (2)
38. Low-rank matrix approximation with weights or missing data is NP-hard
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (6)
    Also in LIDAM Discussion Papers CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) (2010)

2010

39. ACUTA: a novel method for eliciting additive value functions on the basis of holistic preference statements
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (28)
    See also Journal Article ACUTA: A novel method for eliciting additive value functions on the basis of holistic preference statements, European Journal of Operational Research, Elsevier (2010) View citations (30) (2010)
40. Double smoothing technique for infinite-dimensional optimization problems with applications to optimal control
    LIDAM Discussion Papers CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (1)
41. Impact of the material distribution formalism on the efficiency of evolutionary methods for topology optimization
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (1)
42. Nonnegative factorization and the maximum edge biclique problem
    LIDAM Discussion Papers CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)
    Also in LIDAM Discussion Papers CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) (2008) View citations (8)
43. Solving infinite-dimensional optimizaiton problems by polynomial approximation
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)
    Also in LIDAM Discussion Papers CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) (2010) View citations (3)
44. Using underapproximations for sparse nonnegative matrix factorization
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (4)
    Also in LIDAM Discussion Papers CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) (2009) View citations (1)

2009

45. An interior-point method for the single-facility location problem with mixed norms using a conic formulation
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)
    Also in LIDAM Discussion Papers CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) (2007) View citations (1)
    See also Journal Article An interior-point method for the single-facility location problem with mixed norms using a conic formulation, Mathematical Methods of Operations Research, Springer (2008) View citations (1) (2008)

2004

46. Conic formulation for lp-norm optimization
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (7)
    See also Journal Article Conic Formulation for l p -Norm Optimization, Journal of Optimization Theory and Applications, Springer (2004) View citations (2) (2004)

2003

47. Les méthodes de point intérieur
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)

2002

48. Improving complexity of structured convex optimization problems usiion ng self-concordant barriers
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)

Journal Articles

2018

1. Algorithms for positive semidefinite factorization
   Computational Optimization and Applications, 2018, 71, (1), 193-219 View citations (2)
2. Exact Worst-Case Convergence Rates of the Proximal Gradient Method for Composite Convex Minimization
   Journal of Optimization Theory and Applications, 2018, 178, (2), 455-476 View citations (6)
   See also Working Paper Exact worst-case convergence rates of the proximal gradient method for composite convex minimization, LIDAM Reprints CORE (2018) View citations (6) (2018)

2017

3. Random Block Coordinate Descent Methods for Linearly Constrained Optimization over Networks
   Journal of Optimization Theory and Applications, 2017, 173, (1), 227-254 View citations (6)
   See also Working Paper Random block coordinate descent methods for linearly constrained optimization over networks, LIDAM Reprints CORE (2017) View citations (6) (2017)

2014

4. A continuous characterization of the maximum-edge biclique problem
   Journal of Global Optimization, 2014, 58, (3), 439-464 View citations (1)
   See also Working Paper A continuous characterization of the maximum-edge biclique problem, LIDAM Reprints CORE (2014) View citations (1) (2014)

2010

5. ACUTA: A novel method for eliciting additive value functions on the basis of holistic preference statements
   European Journal of Operational Research, 2010, 206, (2), 435-444 View citations (30)
   See also Working Paper ACUTA: a novel method for eliciting additive value functions on the basis of holistic preference statements, LIDAM Reprints CORE (2010) View citations (28) (2010)

2008

6. An interior-point method for the single-facility location problem with mixed norms using a conic formulation
   Mathematical Methods of Operations Research, 2008, 68, (3), 383-405 View citations (1)
   See also Working Paper An interior-point method for the single-facility location problem with mixed norms using a conic formulation, LIDAM Reprints CORE (2009) (2009)

2004

7. Conic Formulation for l p -Norm Optimization
   Journal of Optimization Theory and Applications, 2004, 122, (2), 285-307 View citations (2)
   See also Working Paper Conic formulation for lp-norm optimization, LIDAM Reprints CORE (2004) View citations (7) (2004)

2002

8. Improving complexity of structured convex optimization problems using self-concordant barriers
   European Journal of Operational Research, 2002, 143, (2), 291-310

2001

9. Proving Strong Duality for Geometric Optimization Using a Conic Formulation
   Annals of Operations Research, 2001, 105, (1), 155-184 View citations (4)