7
H index
4
i10 index
189
Citations
François Glineur : Citation Profile
Université Catholique de Louvain | RESEARCH PRODUCTION: 9 Articles 63 Papers RESEARCH ACTIVITY:
MORE DETAILS IN: ABOUT THIS REPORT:
|
22 years (2001 - 2023). 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 (2024 and 2023)
| Year | Title of citing document |
|---|---|
| 2023 | . Full description at Econpapers || Download paper |
| 2023 | Multiple criteria sorting models and methods—Part I: survey of the literature. (2023). Sobrie, Olivier ; Pirlot, Marc ; Ouerdane, Wassila ; Mousseau, Vincent ; Belahcene, Khaled. In: 4OR. RePEc:spr:aqjoor:v:21:y:2023:i:1:d:10.1007_s10288-022-00530-4. 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 |
| 2023 | Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems. (2023). Okuno, Takayuki ; Arahata, Shun ; Takeda, Akiko. In: Computational Optimization and Applications. RePEc:spr:coopap:v:86:y:2023:i:2:d:10.1007_s10589-023-00501-3. Full description at Econpapers || Download paper |
| 2023 | General Hölder Smooth Convergence Rates Follow from Specialized Rates Assuming Growth Bounds. (2023). Grimmer, Benjamin. In: Journal of Optimization Theory and Applications. RePEc:spr:joptap:v:197:y:2023:i:1:d:10.1007_s10957-023-02178-4. Full description at Econpapers || Download paper |
| 2023 | A Nonlinear Conjugate Gradient Method Using Inexact First-Order Information. (2023). Yang, Wei Hong ; Zhao, Tiantian. In: Journal of Optimization Theory and Applications. RePEc:spr:joptap:v:198:y:2023:i:2:d:10.1007_s10957-023-02243-y. Full description at Econpapers || Download paper |
| 2023 | Stopping Rules for Gradient Methods for Non-convex Problems with Additive Noise in Gradient. (2023). Polyak, Boris ; Kuruzov, Ilya ; Stonyakin, Fedor. In: Journal of Optimization Theory and Applications. RePEc:spr:joptap:v:198:y:2023:i:2:d:10.1007_s10957-023-02245-w. 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 |
| 2024 | The exact worst-case convergence rate of the alternating direction method of multipliers. (2023). Abbaszadehpeivasti, Hadi ; Zamani, Moslem ; de Klerk, Etienne. In: Other publications TiSEM. RePEc:tiu:tiutis:f30ae9e6-ed19-423f-bd1e-0f4d15facfae. 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. [Citation analysis] This paper has nother 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 nother 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 nother 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. [Citation analysis] This paper has nother 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 nother 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. [Citation analysis] This paper has nother 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. [Citation analysis] This paper has nother 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. [Citation analysis] This paper has nother 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 | 26 |
| 2014 | First-order methods of smooth convex optimization with inexact oracle.(2014) In: LIDAM Reprints CORE. [Citation analysis] This paper has nother version. Agregated cites: 26 | paper | |
| 2011 | Accelerated multiplicative updates and hierarchical als algorithms for nonnegative matrix factorization In: LIDAM Discussion Papers CORE. [Full Text][Citation analysis] | paper | 11 |
| 2012 | Accelerated multiplicative updates and hierarchical ALS algorithms for nonnegative matrix factorization.(2012) In: LIDAM Reprints CORE. [Citation analysis] This paper has nother version. Agregated cites: 11 | 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 nother 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 | 9 |
| 2017 | Smooth strongly convex interpolation and exact worst-case performance of first-order methods.(2017) In: LIDAM Reprints CORE. [Citation analysis] This paper has nother version. Agregated cites: 9 | 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 | 6 |
| 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 nother version. Agregated cites: 6 | paper | |
| 2017 | On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions.(2017) In: Other publications TiSEM. [Full Text][Citation analysis] This paper has nother version. Agregated cites: 6 | paper | |
| 2016 | Exact worst-case performance of first-order methods for composite convex optimization In: LIDAM Discussion Papers CORE. [Full Text][Citation analysis] | paper | 7 |
| 2017 | Exact worst-case performance of first-order methods for composite convex optimization.(2017) In: LIDAM Reprints CORE. [Citation analysis] This paper has nother version. Agregated cites: 7 | 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. [Citation analysis] | paper | 7 |
| 2004 | Conic Formulation for l p -Norm Optimization.(2004) In: Journal of Optimization Theory and Applications. [Full Text][Citation analysis] This paper has nother version. Agregated cites: 7 | 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. [Citation analysis] | paper | 29 |
| 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 nother version. Agregated cites: 29 | article | |
| 2012 | Double smoothing technique for large-scale linearly constrained convex optimization In: LIDAM Reprints CORE. [Citation analysis] | paper | 8 |
| 2013 | An efficient sampling method for regression-based polynomial chaos expansion In: LIDAM Reprints CORE. [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 nother 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 | 6 |
| 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 nother version. Agregated cites: 6 | 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 | 7 |
| 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 nother version. Agregated cites: 7 | 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 | 15 |
| 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 | 4 |
| 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 | 6 |
| 2020 | Worst-case convergence analysis of inexact gradient and Newton methods through semidefinite programming performance estimation.(2020) In: Other publications TiSEM. [Full Text][Citation analysis] This paper has nother version. Agregated cites: 6 | paper | |
| 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 |
| 2023 | Conic optimization-based algorithms for nonnegative matrix factorization 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 | 2 |
CitEc is a RePEc service, providing citation data for Economics since 2001. Last updated November, 3 2024. Contact: CitEc Team