default search action
François Glineur
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j35]Moslem Zamani
, François Glineur
On the Set of Possible Minimizers of a Sum of Convex Functions. IEEE Control. Syst. Lett. 8: 1871-1876 (2024) - [j34]Baptiste Goujaud, Céline Moucer, François Glineur, Julien M. Hendrickx, Adrien B. Taylor, Aymeric Dieuleveut:
PEPit: computer-assisted worst-case analyses of first-order optimization methods in Python. Math. Program. Comput. 16(3): 337-367 (2024) - [j33]Nizar Bousselmi, Julien M. Hendrickx, François Glineur
Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems. SIAM J. Optim. 34(3): 3033-3063 (2024) - [c17]Nizar Bousselmi, Nelly Pustelnik, Julien M. Hendrickx, François Glineur:
Comparison of Proximal First-Order Primal and Primal-Dual Algorithms via Performance Estimation. EUSIPCO 2024: 2647-2651 - [i18]Philémon Beghin, Anne-Emmanuelle Ceulemans, François Glineur:
A discussion about violin reduction: geometric analysis of contour lines and channel of minima. CoRR abs/2404.01995 (2024) - 2023
- [j32]Valentin Leplat
Conic optimization-based algorithms for nonnegative matrix factorization. Optim. Methods Softw. 38(4): 837-859 (2023) - [j31]Cécile Hautecoeur
Least-Squares Methods for Nonnegative Matrix Factorization Over Rational Functions. IEEE Trans. Signal Process. 71: 1712-1724 (2023) - [c16]Flávia Chorobura, François Glineur, Ion Necoara:
Can random proximal coordinate descent be accelerated on nonseparable convex composite minimization problems? ECC 2023: 1-6 - [c15]Yassine Kamri, Julien M. Hendrickx, François Glineur:
On the Worst-Case Analysis of Cyclic Coordinate-Wise Algorithms on Smooth Convex Functions. ECC 2023: 1-8 - [c14]Sofiane Tanji, Andrea Della Vecchia, François Glineur, Silvia Villa
Snacks: a fast large-scale kernel SVM solver. ECC 2023: 1-6 - [i17]Sofiane Tanji, Andrea Della Vecchia, François Glineur, Silvia Villa
Snacks: a fast large-scale kernel SVM solver. CoRR abs/2304.07983 (2023) - 2022
- [j30]Shuyu Dong
New Riemannian Preconditioned Algorithms for Tensor Completion via Polyadic Decomposition. SIAM J. Matrix Anal. Appl. 43(2): 840-866 (2022) - [i16]Baptiste Goujaud, Céline Moucer, François Glineur, Julien M. Hendrickx, Adrien B. Taylor, Aymeric Dieuleveut:
PEPit: computer-assisted worst-case analyses of first-order optimization methods in Python. CoRR abs/2201.04040 (2022) - [i15]Valentin Hamaide, Denis Joassin, Lauriane Castin, François Glineur:
A two-level machine learning framework for predictive maintenance: comparison of learning formulations. CoRR abs/2204.10083 (2022) - [i14]Philémon Beghin, Anne-Emmanuelle Ceulemans, Paul Fisette, François Glineur:
Validation of a photogrammetric approach for the study of ancient bowed instruments. CoRR abs/2205.08745 (2022) - [i13]Cécile Hautecoeur, Lieven De Lathauwer, Nicolas Gillis, François Glineur:
Least-squares methods for nonnegative matrix factorization over rational functions. CoRR abs/2209.12579 (2022) - 2021
- [j29]Julien Dewez, Nicolas Gillis, François Glineur:
A geometric lower bound on the extension complexity of polytopes based on the f-vector. Discret. Appl. Math. 303: 22-38 (2021) - [c13]Valentin Hamaide, François Glineur:
Transfer learning in Bayesian optimization for the calibration of a beam line in proton therapy. ESANN 2021 - [c12]Cécile Hautecoeur, François Glineur, Lieven De Lathauwer:
Hierarchical alternating nonlinear least squares for nonnegative matrix factorization using rational functions. EUSIPCO 2021: 1045-1049 - [i12]Shuyu Dong, Bin Gao, Yu Guan, François Glineur:
New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition. CoRR abs/2101.11108 (2021) - 2020
- [j28]Cécile Hautecoeur, François Glineur:
Nonnegative Matrix Factorization over Continuous Signals using Parametrizable Functions. Neurocomputing 416: 256-265 (2020) - [j27]Etienne de Klerk
Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation. SIAM J. Optim. 30(3): 2053-2082 (2020) - [c11]Cécile Hautecoeur, François Glineur:
Image completion via nonnegative matrix factorization using B-splines. ESANN 2020: 73-78 - [c10]Julien Dewez, François Glineur:
Lower bounds on the nonnegative rank using a nested polytopes formulation. ESANN 2020: 91-96 - [i11]Yu Guan, Shuyu Dong, Pierre-Antoine Absil, François Glineur:
Alternating minimization algorithms for graph regularized tensor completion. CoRR abs/2008.12876 (2020)
2010 – 2019
- 2019
- [j26]Ion Necoara
Linear convergence of first order methods for non-strongly convex optimization. Math. Program. 175(1-2): 69-107 (2019) - [j25]Ion Necoara, Andrei Patrascu
Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming. Optim. Methods Softw. 34(2): 305-335 (2019) - [c9]Valentin Hamaide, François Glineur:
Predictive Maintenance of a Rotating Condenser Inside a Synchrocyclotron. BNAIC/BENELEARN 2019 - [c8]Cécile Hautecoeur, François Glineur:
Nonnegative matrix factorization with polynomial signals via hierarchical alternating least squares. ESANN 2019 - [c7]Cécile Hautecoeur, François Glineur:
Accelerating Nonnegative Matrix Factorization Over Polynomial Signals With Faster Projections. MLSP 2019: 1-6 - 2018
- [j24]Arnaud Vandaele
Algorithms for positive semidefinite factorization. Comput. Optim. Appl. 71(1): 193-219 (2018) - [j23]Adrien B. Taylor
Exact Worst-Case Convergence Rates of the Proximal Gradient Method for Composite Convex Minimization. J. Optim. Theory Appl. 178(2): 455-476 (2018) - 2017
- [j22]Ion Necoara
Random Block Coordinate Descent Methods for Linearly Constrained Optimization over Networks. J. Optim. Theory Appl. 173(1): 227-254 (2017) - [j21]Adrien B. Taylor
Smooth strongly convex interpolation and exact worst-case performance of first-order methods. Math. Program. 161(1-2): 307-345 (2017) - [j20]Etienne de Klerk
On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions. Optim. Lett. 11(7): 1185-1199 (2017) - [j19]Adrien B. Taylor
Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization. SIAM J. Optim. 27(3): 1283-1313 (2017) - [c6]Adrien B. Taylor, Julien M. Hendrickx, François Glineur:
Performance estimation toolbox (PESTO): Automated worst-case analysis of first-order optimization methods. CDC 2017: 1278-1283 - [i10]Arnaud Vandaele, François Glineur, Nicolas Gillis:
Algorithms for Positive Semidefinite Factorization. CoRR abs/1707.07953 (2017) - 2016
- [j18]Xuansheng Wang, François Glineur
Extended Lanczos bidiagonalization algorithm for low rank approximation and its applications. J. Comput. Appl. Math. 301: 213-229 (2016) - [j17]Arnaud Vandaele
Heuristics for exact nonnegative matrix factorization. J. Glob. Optim. 65(2): 369-400 (2016) - [c5]Arnaud Latiers, François Glineur, Emmanuel De Jaeger, Benoit Martin:
On decentralized control of small loads and energy rebound within primary frequency control. PSCC 2016: 1-7 - 2015
- [i9]Arnaud Vandaele, Nicolas Gillis, François Glineur:
On the Linear Extension Complexity of Regular n-gons. CoRR abs/1505.08031 (2015) - 2014
- [j16]Filippo Pompili, Nicolas Gillis
Two algorithms for orthogonal nonnegative matrix factorization with application to clustering. Neurocomputing 141: 15-25 (2014) - [j15]Augustin Lefèvre, François Glineur, Pierre-Antoine Absil:
A convex formulation for informed source separation in the single channel setting. Neurocomputing 141: 26-36 (2014) - [j14]Nicolas Gillis
A continuous characterization of the maximum-edge biclique problem. J. Glob. Optim. 58(3): 439-464 (2014) - [j13]Olivier Devolder, François Glineur
First-order methods of smooth convex optimization with inexact oracle. Math. Program. 146(1-2): 37-75 (2014) - [j12]Paschalis Tsiaflakis, François Glineur, Marc Moonen:
Iterative Convex Approximation Based Real-Time Dynamic Spectrum Management in Multi-User Multi-Carrier Communication Systems. IEEE Signal Process. Lett. 21(5): 535-539 (2014) - [j11]Paschalis Tsiaflakis, François Glineur
Real-Time Dynamic Spectrum Management for Multi-User Multi-Carrier Communication Systems. IEEE Trans. Commun. 62(3): 1124-1137 (2014) - [i8]Arnaud Vandaele, Nicolas Gillis, François Glineur, Daniel Tuyttens:
Heuristics for Exact Nonnegative Matrix Factorization. CoRR abs/1411.7245 (2014) - 2013
- [j10]Tao Wang, François Glineur
Weighted Sum Rate Maximization for Downlink OFDMA With Subcarrier-Pair Based Opportunistic DF Relaying. IEEE Trans. Signal Process. 61(10): 2512-2524 (2013) - [c4]Augustin Lefèvre, François Glineur, Pierre-Antoine Absil:
A nuclear-norm based convex formulation for informed source separation. ESANN 2013 - [c3]Filippo Pompili, Nicolas Gillis, François Glineur, Pierre-Antoine Absil:
ONP-MF: An Orthogonal Nonnegative Matrix Factorization Algorithm with Application to Clustering. ESANN 2013 - [i7]Tao Wang, François Glineur, Jérôme Louveaux, Luc Vandendorpe:
Weighted Sum Rate Maximization for Downlink OFDMA with Subcarrier-pair based Opportunistic DF Relaying. CoRR abs/1301.6600 (2013) - [i6]Paschalis Tsiaflakis, François Glineur, Marc Moonen:
Real-time dynamic spectrum management for multi-user multi-carrier communication systems. CoRR abs/1308.5786 (2013) - [i5]Paschalis Tsiaflakis, François Glineur:
Spectrum optimization in multi-user multi-carrier systems with iterative convex and nonconvex approximation methods. CoRR abs/1308.5809 (2013) - 2012
- [j9]Nicolas Gillis
A multilevel approach for nonnegative matrix factorization. J. Comput. Appl. Math. 236(7): 1708-1723 (2012) - [j8]Nicolas Gillis
Accelerated Multiplicative Updates and Hierarchical ALS Algorithms for Nonnegative Matrix Factorization. Neural Comput. 24(4): 1085-1105 (2012) - [j7]Olivier Devolder, François Glineur
Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization. SIAM J. Optim. 22(2): 702-727 (2012) - [c2]Paschalis Tsiaflakis, François Glineur
A novel class of iterative approximation methods for DSL spectrum optimization. ICC 2012: 3154-3159 - [i4]Filippo Pompili, Nicolas Gillis, Pierre-Antoine Absil, François Glineur:
Two Algorithms for Orthogonal Nonnegative Matrix Factorization with Application to Clustering. CoRR abs/1201.0901 (2012) - [i3]Augustin Lefèvre, François Glineur, Pierre-Antoine Absil:
A nuclear-norm based convex formulation for informed source separation. CoRR abs/1212.3119 (2012) - 2011
- [j6]Nicolas Gillis
Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard. SIAM J. Matrix Anal. Appl. 32(4): 1149-1165 (2011) - [i2]Nicolas Gillis, François Glineur:
Accelerated Multiplicative Updates and Hierarchical ALS Algorithms for Nonnegative Matrix Factorization. CoRR abs/1107.5194 (2011) - 2010
- [j5]Géraldine Bous, Philippe Fortemps
ACUTA: A novel method for eliciting additive value functions on the basis of holistic preference statements. Eur. J. Oper. Res. 206(2): 435-444 (2010) - [j4]Nicolas Gillis
Using underapproximations for sparse nonnegative matrix factorization. Pattern Recognit. 43(4): 1676-1687 (2010) - [i1]Nicolas Gillis, François Glineur:
A Multilevel Approach For Nonnegative Matrix Factorization. CoRR abs/1009.0881 (2010)
2000 – 2009
- 2009
- [c1]Michael W. Berry
Document Classification using Nonnegative Matrix Factorization and Underapproximation. ISCAS 2009: 2782-2785 - 2008
- [j3]Robert Chares, François Glineur
An interior-point method for the single-facility location problem with mixed norms using a conic formulation. Math. Methods Oper. Res. 68(3): 383-405 (2008) - 2002
- [j2]François Glineur
Improving complexity of structured convex optimization problems using self-concordant barriers. Eur. J. Oper. Res. 143(2): 291-310 (2002) - 2001
- [j1]François Glineur
Proving Strong Duality for Geometric Optimization Using a Conic Formulation. Ann. Oper. Res. 105(1-4): 155-184 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: