7
H index
4
i10 index
172
Citations
François Glineur : Citation Profile
Université Catholique de Louvain | RESEARCH PRODUCTION: 9 Articles 62 Papers RESEARCH ACTIVITY:
MORE DETAILS IN: ABOUT THIS REPORT:
|
20 years (2001 - 2021). Relations with other researchers
Works with: Authors registered in RePEc who have co-authored more than one work in the last five years with François Glineur. | Is cited by:
| Cites to:
|
Main data
Where François Glineur has published?
| Journals with more than one article published | # docs |
|---|---|
| Journal of Optimization Theory and Applications | 3 |
| European Journal of Operational Research | 2 |
Recent works citing François Glineur (2022 and 2021)
| Year | Title of citing document |
|---|---|
| 2022 | Adjacencies on random ordering polytopes and flow polytopes. (2022). Saito, Kota ; Doignon, Jean-Paul. In: Papers. RePEc:arx:papers:2207.06925. Full description at Econpapers || Download paper |
| 2022 | Coopetition for innovation - the more, the better? An empirical study based on preference disaggregation analysis. (2022). Fernandez, Anne-Sophie ; Ghaderi, Mohammad ; Bagherzadeh, Mehdi. In: European Journal of Operational Research. RePEc:eee:ejores:v:297:y:2022:i:2:p:695-708. Full description at Econpapers || Download paper |
| 2022 | Can holistic declaration of preferences improve a negotiation offer scoring system?. (2022). Roszkowska, Ewa ; Wachowicz, Tomasz. In: European Journal of Operational Research. RePEc:eee:ejores:v:299:y:2022:i:3:p:1018-1032. Full description at Econpapers || Download paper |
| 2022 | Recommending multiple criteria decision analysis methods with a new taxonomy-based decision support system. (2022). Sowiski, Roman ; Gonzalez, Michael ; Miebs, Grzegorz ; Kadziski, Miosz ; Cinelli, Marco. In: European Journal of Operational Research. RePEc:eee:ejores:v:302:y:2022:i:2:p:633-651. Full description at Econpapers || Download paper |
| 2022 | Review and experimental comparison of ranking and choice procedures for constructing a univocal recommendation in a preference disaggregation setting. (2022). Ciomek, Krzysztof ; Wojcik, Micha ; Kadziski, Miosz. In: Omega. RePEc:eee:jomega:v:113:y:2022:i:c:s0305048322001220. Full description at Econpapers || Download paper |
| 2022 | . Full description at Econpapers || Download paper |
| 2021 | Proximal-Like Incremental Aggregated Gradient Method with Linear Convergence Under Bregman Distance Growth Conditions. (2021). Dai, Yu-Hong ; Zhang, Hui ; Peng, Wei ; Guo, Lei. In: Mathematics of Operations Research. RePEc:inm:ormoor:v:46:y:2021:i:1:p:61-81. Full description at Econpapers || Download paper |
| 2021 | Frank–Wolfe and friends: a journey into projection-free first-order optimization methods. (2021). Zeffiro, Damiano ; Rinaldi, Francesco ; Bomze, Immanuel M. In: 4OR. RePEc:spr:aqjoor:v:19:y:2021:i:3:d:10.1007_s10288-021-00493-y. Full description at Econpapers || Download paper |
| 2021 | A competitive optimization approach for data clustering and orthogonal non-negative matrix factorization. (2021). Mahdavi-Amiri, Nezam ; Dehghanpour-Sahron, Jafar. In: 4OR. RePEc:spr:aqjoor:v:19:y:2021:i:4:d:10.1007_s10288-020-00445-y. Full description at Econpapers || Download paper |
| 2021 | Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization. (2021). Patrinos, Panagiotis ; Gillis, Nicolas ; Khanh, Le Thi ; Ahookhosh, Masoud. In: Computational Optimization and Applications. RePEc:spr:coopap:v:79:y:2021:i:3:d:10.1007_s10589-021-00286-3. Full description at Econpapers || Download paper |
| 2022 | Generalized Nesterov’s accelerated proximal gradient algorithms with convergence rate of order o(1/k2). (2022). Son, Ta Anh ; Ngai, Huynh. In: Computational Optimization and Applications. RePEc:spr:coopap:v:83:y:2022:i:2:d:10.1007_s10589-022-00401-y. Full description at Econpapers || Download paper |
| 2023 | A global exact penalty for rank-constrained optimization problem and applications. (2023). Han, LE ; Yang, Zhikai. In: Computational Optimization and Applications. RePEc:spr:coopap:v:84:y:2023:i:2:d:10.1007_s10589-022-00427-2. Full description at Econpapers || Download paper |
| 2022 | Convergence rates for the heavy-ball continuous dynamics for non-convex optimization, under Polyak–?ojasiewicz condition. (2022). Villa, Silvia ; Ginatta, Nicolo ; Apidopoulos, Vassilis. In: Journal of Global Optimization. RePEc:spr:jglopt:v:84:y:2022:i:3:d:10.1007_s10898-022-01164-w. Full description at Econpapers || Download paper |
| 2022 | A novel update rule of HALS algorithm for nonnegative matrix factorization and Zangwill’s global convergence. (2022). Takahashi, Norikazu ; Migita, Tsuyoshi ; Sano, Takehiro. In: Journal of Global Optimization. RePEc:spr:jglopt:v:84:y:2022:i:3:d:10.1007_s10898-022-01167-7. Full description at Econpapers || Download paper |
| 2021 | Optimizing the Efficiency of First-Order Methods for Decreasing the Gradient of Smooth Convex Functions. (2021). Fessler, Jeffrey A ; Kim, Donghwan. In: Journal of Optimization Theory and Applications. RePEc:spr:joptap:v:188:y:2021:i:1:d:10.1007_s10957-020-01770-2. Full description at Econpapers || Download paper |
| 2021 | On the Linear Convergence of Forward–Backward Splitting Method: Part I—Convergence Analysis. (2021). , Tran ; Li, Guoyin ; Bello-Cruz, Yunier. In: Journal of Optimization Theory and Applications. RePEc:spr:joptap:v:188:y:2021:i:2:d:10.1007_s10957-020-01787-7. Full description at Econpapers || Download paper |
| 2021 | General Convergence Analysis of Stochastic First-Order Methods for Composite Optimization. (2021). Necoara, Ion. In: Journal of Optimization Theory and Applications. RePEc:spr:joptap:v:189:y:2021:i:1:d:10.1007_s10957-021-01821-2. Full description at Econpapers || Download paper |
| 2021 | Bounds for the Tracking Error of First-Order Online Optimization Methods. (2021). Dallanese, Emiliano ; Becker, Stephen ; Madden, Liam. In: Journal of Optimization Theory and Applications. RePEc:spr:joptap:v:189:y:2021:i:2:d:10.1007_s10957-021-01836-9. Full description at Econpapers || Download paper |
| 2021 | Analysis of Optimization Algorithms via Sum-of-Squares. (2021). , Vincent ; Vincent, ; Varvitsiotis, Antonios. In: Journal of Optimization Theory and Applications. RePEc:spr:joptap:v:190:y:2021:i:1:d:10.1007_s10957-021-01869-0. Full description at Econpapers || Download paper |
| 2022 | Linear Convergence of Prox-SVRG Method for Separable Non-smooth Convex Optimization Problems under Bounded Metric Subregularity. (2022). Zhu, Xide ; Zhang, Jin. In: Journal of Optimization Theory and Applications. RePEc:spr:joptap:v:192:y:2022:i:2:d:10.1007_s10957-021-01978-w. Full description at Econpapers || Download paper |
| 2022 | Quadratic Growth Conditions and Uniqueness of Optimal Solution to Lasso. (2022). An, Tran Thai ; Li, Guoyin ; Bello-Cruz, Yunier. In: Journal of Optimization Theory and Applications. RePEc:spr:joptap:v:194:y:2022:i:1:d:10.1007_s10957-022-02013-2. Full description at Econpapers || Download paper |
| 2022 | A Note on the Optimal Convergence Rate of Descent Methods with Fixed Step Sizes for Smooth Strongly Convex Functions. (2022). Vandereycken, Bart ; Uschmajew, Andre. In: Journal of Optimization Theory and Applications. RePEc:spr:joptap:v:194:y:2022:i:1:d:10.1007_s10957-022-02032-z. Full description at Econpapers || Download paper |
| 2022 | Generalized Mirror Prox Algorithm for Monotone Variational Inequalities: Universality and Inexact Oracle. (2022). Alkousa, Mohammad ; Titov, Alexander ; Dvurechensky, Pavel ; Gasnikov, Alexander ; Stonyakin, Fedor. In: Journal of Optimization Theory and Applications. RePEc:spr:joptap:v:194:y:2022:i:3:d:10.1007_s10957-022-02062-7. Full description at Econpapers || Download paper |
| 2022 | Convergence Results of a Nested Decentralized Gradient Method for Non-strongly Convex Problems. (2022). Choi, Woocheol ; Yun, Seok-Bae ; Kim, Doheon. In: Journal of Optimization Theory and Applications. RePEc:spr:joptap:v:195:y:2022:i:1:d:10.1007_s10957-022-02069-0. Full description at Econpapers || Download paper |
| 2021 | Optimal step length for the Newton method: case of self-concordant functions. (2021). Hildebrand, Roland. In: Mathematical Methods of Operations Research. RePEc:spr:mathme:v:94:y:2021:i:2:d:10.1007_s00186-021-00755-9. Full description at Econpapers || Download paper |
| 2022 | Inertial proximal incremental aggregated gradient method with linear convergence guarantees. (2022). Zhang, Xiaoya ; Peng, Wei. In: Mathematical Methods of Operations Research. RePEc:spr:mathme:v:96:y:2022:i:2:d:10.1007_s00186-022-00790-0. Full description at Econpapers || Download paper |
| 2022 | The exact worst-case convergence rate of the gradient method with fixed step lengths for L-smooth functions. (2021). Abbaszadehpeivasti, Hadi ; Zamani, Moslem ; de Klerk, Etienne. In: Other publications TiSEM. RePEc:tiu:tiutis:061688c6-f97c-4024-bb5b-1c81a859694d. Full description at Econpapers || Download paper |
| 2023 | Convergence rate analysis of randomized and cyclic coordinate descent for convex optimization through semidefinite programming. (2023). Zamani, Moslem ; de Klerk, Etienne ; Abbaszadehpeivasti, Hadi. In: Other publications TiSEM. RePEc:tiu:tiutis:88512ac0-c26a-4a99-b840-3171c0eef17b. Full description at Econpapers || Download paper |
Works by François Glineur:
| Year | Title | Type | Cited |
|---|---|---|---|
| 2007 | An interior-point method for the single-facility location problem with mixed norms using a conic formulation In: LIDAM Discussion Papers CORE. [Full Text][Citation analysis] | paper | 1 |
| 2009 | An interior-point method for the single-facility location problem with mixed norms using a conic formulation.(2009) In: LIDAM Reprints CORE. [Full Text][Citation analysis] This paper has another version. Agregated cites: 1 | paper | |
| 2008 | An interior-point method for the single-facility location problem with mixed norms using a conic formulation.(2008) In: Mathematical Methods of Operations Research. [Full Text][Citation analysis] This paper has another version. Agregated cites: 1 | article | |
| 2008 | Nonnegative factorization and the maximum edge biclique problem In: LIDAM Discussion Papers CORE. [Full Text][Citation analysis] | paper | 4 |
| 2010 | Nonnegative factorization and the maximum edge biclique problem.(2010) In: LIDAM Discussion Papers CORE. [Full Text][Citation analysis] This paper has another version. Agregated cites: 4 | paper | |
| 2009 | Using underapproximations for sparse nonnegative matrix factorization In: LIDAM Discussion Papers CORE. [Full Text][Citation analysis] | paper | 2 |
| 2010 | Using underapproximations for sparse nonnegative matrix factorization.(2010) In: LIDAM Reprints CORE. [Full Text][Citation analysis] This paper has another version. Agregated cites: 2 | paper | |
| 2010 | Solving infinite-dimensional optimization problems by polynomial approximation In: LIDAM Discussion Papers CORE. [Full Text][Citation analysis] | paper | 3 |
| 2010 | Solving infinite-dimensional optimizaiton problems by polynomial approximation.(2010) In: LIDAM Reprints CORE. [Citation analysis] This paper has another version. Agregated cites: 3 | paper | |
| 2010 | Double smoothing technique for infinite-dimensional optimization problems with applications to optimal control In: LIDAM Discussion Papers CORE. [Full Text][Citation analysis] | paper | 0 |
| 2010 | A multilevel approach for nonnegative matrix factorization In: LIDAM Discussion Papers CORE. [Full Text][Citation analysis] | paper | 3 |
| 2011 | A multilevel approach for nonnegative matrix factorization.(2011) In: LIDAM Reprints CORE. [Full Text][Citation analysis] This paper has another version. Agregated cites: 3 | paper | |
| 2010 | On the geometric interpretation of the nonnegative rank In: LIDAM Discussion Papers CORE. [Full Text][Citation analysis] | paper | 7 |
| 2012 | On the geometric interpretation of the nonnegative rank.(2012) In: LIDAM Reprints CORE. [Full Text][Citation analysis] This paper has another version. Agregated cites: 7 | paper | |
| 2010 | Low-rank matrix approximation with weights or missing data is NP-hard In: LIDAM Discussion Papers CORE. [Full Text][Citation analysis] | paper | 6 |
| 2011 | Low-rank matrix approximation with weights or missing data is NP-hard.(2011) In: LIDAM Reprints CORE. [Full Text][Citation analysis] This paper has another version. Agregated cites: 6 | paper | |
| 2011 | First-order methods of smooth convex optimization with inexact oracle In: LIDAM Discussion Papers CORE. [Full Text][Citation analysis] | paper | 22 |
| 2014 | First-order methods of smooth convex optimization with inexact oracle.(2014) In: LIDAM Reprints CORE. [Citation analysis] This paper has another version. Agregated cites: 22 | paper | |
| 2011 | Accelerated multiplicative updates and hierarchical als algorithms for nonnegative matrix factorization In: LIDAM Discussion Papers CORE. [Full Text][Citation analysis] | paper | 10 |
| 2012 | Accelerated multiplicative updates and hierarchical ALS algorithms for nonnegative matrix factorization.(2012) In: LIDAM Reprints CORE. [Full Text][Citation analysis] This paper has another version. Agregated cites: 10 | paper | |
| 2013 | First-order methods with inexact oracle: the strongly convex case In: LIDAM Discussion Papers CORE. [Full Text][Citation analysis] | paper | 3 |
| 2013 | Intermediate gradient methods for smooth convex problems with inexact oracle In: LIDAM Discussion Papers CORE. [Full Text][Citation analysis] | paper | 5 |
| 2015 | Heuristics for exact nonnegative matrix factorization In: LIDAM Discussion Papers CORE. [Full Text][Citation analysis] | paper | 3 |
| 2016 | Heuristics for Exact Nonnegative Matrix Factorization.(2016) In: LIDAM Reprints CORE. [Citation analysis] This paper has another version. Agregated cites: 3 | paper | |
| 2015 | Smooth Strongly Convex Interpolation and Exact Worst-case Performance of First-order Methods In: LIDAM Discussion Papers CORE. [Full Text][Citation analysis] | paper | 7 |
| 2017 | Smooth strongly convex interpolation and exact worst-case performance of first-order methods.(2017) In: LIDAM Reprints CORE. [Citation analysis] This paper has another version. Agregated cites: 7 | paper | |
| 2016 | On the Worst-case Complexity of the Gradient Method with Exact Line Search for Smooth Strongly Convex Functions In: LIDAM Discussion Papers CORE. [Full Text][Citation analysis] | paper | 4 |
| 2017 | On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions.(2017) In: LIDAM Reprints CORE. [Citation analysis] This paper has another version. Agregated cites: 4 | paper | |
| 2016 | Exact worst-case performance of first-order methods for composite convex optimization In: LIDAM Discussion Papers CORE. [Full Text][Citation analysis] | paper | 4 |
| 2017 | Exact worst-case performance of first-order methods for composite convex optimization.(2017) In: LIDAM Reprints CORE. [Citation analysis] This paper has another version. Agregated cites: 4 | paper | |
| 2002 | Improving complexity of structured convex optimization problems usiion ng self-concordant barriers In: LIDAM Reprints CORE. [Citation analysis] | paper | 0 |
| 2003 | Les méthodes de point intérieur In: LIDAM Reprints CORE. [Citation analysis] | paper | 0 |
| 2004 | Conic formulation for lp-norm optimization In: LIDAM Reprints CORE. [Full Text][Citation analysis] | paper | 6 |
| 2004 | Conic Formulation for l p -Norm Optimization.(2004) In: Journal of Optimization Theory and Applications. [Full Text][Citation analysis] This paper has another version. Agregated cites: 6 | article | |
| 2010 | Impact of the material distribution formalism on the efficiency of evolutionary methods for topology optimization In: LIDAM Reprints CORE. [Citation analysis] | paper | 1 |
| 2010 | ACUTA: a novel method for eliciting additive value functions on the basis of holistic preference statements In: LIDAM Reprints CORE. [Full Text][Citation analysis] | paper | 28 |
| 2010 | ACUTA: A novel method for eliciting additive value functions on the basis of holistic preference statements.(2010) In: European Journal of Operational Research. [Full Text][Citation analysis] This paper has another version. Agregated cites: 28 | article | |
| 2012 | Double smoothing technique for large-scale linearly constrained convex optimization In: LIDAM Reprints CORE. [Full Text][Citation analysis] | paper | 7 |
| 2013 | An efficient sampling method for regression-based polynomial chaos expansion In: LIDAM Reprints CORE. [Full Text][Citation analysis] | paper | 0 |
| 2013 | Weighted sum rate maximization for downlink OFDMA with subcarrier-pair basded opportunistic DF relaying In: LIDAM Reprints CORE. [Citation analysis] | paper | 1 |
| 2014 | A continuous characterization of the maximum-edge biclique problem In: LIDAM Reprints CORE. [Citation analysis] | paper | 1 |
| 2014 | A continuous characterization of the maximum-edge biclique problem.(2014) In: Journal of Global Optimization. [Full Text][Citation analysis] This paper has another version. Agregated cites: 1 | article | |
| 2014 | A global-local synthesis approach for large non-regular arrays In: LIDAM Reprints CORE. [Citation analysis] | paper | 0 |
| 2014 | Real-time dynamic spectrum management for multi-user multi-carrier communication systems In: LIDAM Reprints CORE. [Citation analysis] | paper | 0 |
| 2014 | Iterative convex approximation bases real-time dynamic spectrum management in multi-user multi-carrier communication systems In: LIDAM Reprints CORE. [Citation analysis] | paper | 0 |
| 2014 | Two algorithms for orthogonal nonnegative matrix factorization with application to clusterin In: LIDAM Reprints CORE. [Citation analysis] | paper | 3 |
| 2014 | A convex formulation for informed source separation in the signle channel setting In: LIDAM Reprints CORE. [Citation analysis] | paper | 0 |
| 2014 | Energy limits in primary frequency control with short-term frequency-band allocation In: LIDAM Reprints CORE. [Citation analysis] | paper | 0 |
| 2016 | Extended Lanczos Bidiagonalization Algorithm for Low Rank Approximation and Its Applications In: LIDAM Reprints CORE. [Citation analysis] | paper | 0 |
| 2017 | On the linear extension complexity of regular n-gons In: LIDAM Reprints CORE. [Citation analysis] | paper | 0 |
| 2017 | Random block coordinate descent methods for linearly constrained optimization over networks In: LIDAM Reprints CORE. [Citation analysis] | paper | 5 |
| 2017 | Random Block Coordinate Descent Methods for Linearly Constrained Optimization over Networks.(2017) In: Journal of Optimization Theory and Applications. [Full Text][Citation analysis] This paper has another version. Agregated cites: 5 | article | |
| 2018 | Algorithms for possible semidefinite factorization In: LIDAM Reprints CORE. [Citation analysis] | paper | 0 |
| 2018 | Exact worst-case convergence rates of the proximal gradient method for composite convex minimization In: LIDAM Reprints CORE. [Citation analysis] | paper | 5 |
| 2018 | Exact Worst-Case Convergence Rates of the Proximal Gradient Method for Composite Convex Minimization.(2018) In: Journal of Optimization Theory and Applications. [Full Text][Citation analysis] This paper has another version. Agregated cites: 5 | article | |
| 2018 | Extended formulations for order polytopes through network flows In: LIDAM Reprints CORE. [Citation analysis] | paper | 1 |
| 2019 | Linear convergence of first order methods for non-strongly convex optimization In: LIDAM Reprints CORE. [Citation analysis] | paper | 12 |
| 2018 | Direct deterministic nulling techniques for large random arrays including mutual coupling In: LIDAM Reprints CORE. [Citation analysis] | paper | 0 |
| 2019 | Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming In: LIDAM Reprints CORE. [Citation analysis] | paper | 3 |
| 2020 | Peak shaving: a planning alternative to reduce investment costs in distribution systems? In: LIDAM Reprints CORE. [Citation analysis] | paper | 0 |
| 2020 | Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation In: LIDAM Reprints CORE. [Citation analysis] | paper | 4 |
| 2020 | Nonnegative Matrix Factorization over Continuous Signals using Parametrizable Functions In: LIDAM Reprints CORE. [Citation analysis] | paper | 0 |
| 2021 | Image completion via nonnegative matrix factorization using HALS and B-splines In: LIDAM Reprints CORE. [Citation analysis] | paper | 0 |
| 2021 | Lower bounds on the nonnegative rank using a nested polytopes formulation In: LIDAM Reprints CORE. [Citation analysis] | paper | 0 |
| 2021 | Unsupervised Minimum Redundancy Maximum Relevance Feature Selection for Predictive Maintenance : Application to a Rotating Machine In: LIDAM Reprints CORE. [Citation analysis] | paper | 0 |
| 2021 | A geometric lower bound on the extension complexity of polytopes based on the f-vector In: LIDAM Reprints CORE. [Citation analysis] | paper | 0 |
| 2002 | Improving complexity of structured convex optimization problems using self-concordant barriers In: European Journal of Operational Research. [Full Text][Citation analysis] | article | 0 |
| 2001 | Proving Strong Duality for Geometric Optimization Using a Conic Formulation In: Annals of Operations Research. [Full Text][Citation analysis] | article | 2 |
| 2018 | Algorithms for positive semidefinite factorization In: Computational Optimization and Applications. [Full Text][Citation analysis] | article | 1 |
| 2020 | Worst-case convergence analysis of inexact gradient and Newton methods through semidefinite programming performance estimation In: Other publications TiSEM. [Full Text][Citation analysis] | paper | 4 |
| 2017 | On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions In: Other publications TiSEM. [Full Text][Citation analysis] | paper | 4 |
CitEc is a RePEc service, providing citation data for Economics since 2001. Sponsored by INOMICS. Last updated April, 29 2023. Contact: CitEc Team