François Glineur : Citation Profile


Are you François Glineur?

Université Catholique de Louvain

7

H index

4

i10 index

173

Citations

RESEARCH PRODUCTION:

9

Articles

62

Papers

RESEARCH ACTIVITY:

   20 years (2001 - 2021). See details.
   Cites by year: 8
   Journals where François Glineur has often published
   Relations with other researchers
   Recent citing documents: 9.    Total self citations: 15 (7.98 %)

MORE DETAILS IN:
ABOUT THIS REPORT:

   Permalink: http://citec.repec.org/pgl27
   Updated: 2024-01-16    RAS profile: 2022-10-31    
   Missing citations? Add them    Incorrect content? Let us know

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:

Wang, Cindy Shin-huei (2)

pan, zheyao (2)

Dias, Luis (2)

Agrell, Per (2)

Greco, Salvatore (2)

Pestieau, Pierre (1)

ROSZKOWSKA, EWA (1)

Tulkens, Henry (1)

Korobilis, Dimitris (1)

Gabszewicz, Jean (1)

Bauwens, Luc (1)

Cites to:

THISSE, JACQUES (49)

mayer, thierry (48)

Combes, Pierre-Philippe (42)

Bauwens, Luc (8)

Pohlmeier, Winfried (8)

Mayneris, Florian (6)

Duranton, Gilles (6)

Veredas, David (4)

Van Bellegem, Sebastien (3)

Main data


Where François Glineur has published?


Journals with more than one article published# docs
Journal of Optimization Theory and Applications3
European Journal of Operational Research2

Recent works citing François Glineur (2024 and 2023)


YearTitle of citing document
2023.

Full description at Econpapers || Download paper

2023Multiple 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

2023A 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

2023Complexity 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

2023General 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

2023A 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

2023Stopping 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

2023Convergence 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

2023The 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:


YearTitleTypeCited
2007An 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]
paper1
2009An 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 nother version. Agregated cites: 1
paper
2008An 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
2008Nonnegative factorization and the maximum edge biclique problem In: LIDAM Discussion Papers CORE.
[Full Text][Citation analysis]
paper4
2010Nonnegative 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
2009Using underapproximations for sparse nonnegative matrix factorization In: LIDAM Discussion Papers CORE.
[Full Text][Citation analysis]
paper2
2010Using underapproximations for sparse nonnegative matrix factorization.(2010) In: LIDAM Reprints CORE.
[Full Text][Citation analysis]
This paper has nother version. Agregated cites: 2
paper
2010Solving infinite-dimensional optimization problems by polynomial approximation In: LIDAM Discussion Papers CORE.
[Full Text][Citation analysis]
paper3
2010Solving infinite-dimensional optimizaiton problems by polynomial approximation.(2010) In: LIDAM Reprints CORE.
[Citation analysis]
This paper has nother version. Agregated cites: 3
paper
2010Double smoothing technique for infinite-dimensional optimization problems with applications to optimal control In: LIDAM Discussion Papers CORE.
[Full Text][Citation analysis]
paper0
2010A multilevel approach for nonnegative matrix factorization In: LIDAM Discussion Papers CORE.
[Full Text][Citation analysis]
paper3
2011A multilevel approach for nonnegative matrix factorization.(2011) In: LIDAM Reprints CORE.
[Full Text][Citation analysis]
This paper has nother version. Agregated cites: 3
paper
2010On the geometric interpretation of the nonnegative rank In: LIDAM Discussion Papers CORE.
[Full Text][Citation analysis]
paper7
2012On the geometric interpretation of the nonnegative rank.(2012) In: LIDAM Reprints CORE.
[Full Text][Citation analysis]
This paper has nother version. Agregated cites: 7
paper
2010Low-rank matrix approximation with weights or missing data is NP-hard In: LIDAM Discussion Papers CORE.
[Full Text][Citation analysis]
paper6
2011Low-rank matrix approximation with weights or missing data is NP-hard.(2011) In: LIDAM Reprints CORE.
[Full Text][Citation analysis]
This paper has nother version. Agregated cites: 6
paper
2011First-order methods of smooth convex optimization with inexact oracle In: LIDAM Discussion Papers CORE.
[Full Text][Citation analysis]
paper25
2014First-order methods of smooth convex optimization with inexact oracle.(2014) In: LIDAM Reprints CORE.
[Citation analysis]
This paper has nother version. Agregated cites: 25
paper
2011Accelerated multiplicative updates and hierarchical als algorithms for nonnegative matrix factorization In: LIDAM Discussion Papers CORE.
[Full Text][Citation analysis]
paper10
2012Accelerated multiplicative updates and hierarchical ALS algorithms for nonnegative matrix factorization.(2012) In: LIDAM Reprints CORE.
[Full Text][Citation analysis]
This paper has nother version. Agregated cites: 10
paper
2013First-order methods with inexact oracle: the strongly convex case In: LIDAM Discussion Papers CORE.
[Full Text][Citation analysis]
paper3
2013Intermediate gradient methods for smooth convex problems with inexact oracle In: LIDAM Discussion Papers CORE.
[Full Text][Citation analysis]
paper5
2015Heuristics for exact nonnegative matrix factorization In: LIDAM Discussion Papers CORE.
[Full Text][Citation analysis]
paper3
2016Heuristics for Exact Nonnegative Matrix Factorization.(2016) In: LIDAM Reprints CORE.
[Citation analysis]
This paper has nother version. Agregated cites: 3
paper
2015Smooth Strongly Convex Interpolation and Exact Worst-case Performance of First-order Methods In: LIDAM Discussion Papers CORE.
[Full Text][Citation analysis]
paper7
2017Smooth 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: 7
paper
2016On 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]
paper4
2017On 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: 4
paper
2017On 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: 4
paper
2016Exact worst-case performance of first-order methods for composite convex optimization In: LIDAM Discussion Papers CORE.
[Full Text][Citation analysis]
paper4
2017Exact 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: 4
paper
2002Improving complexity of structured convex optimization problems usiion ng self-concordant barriers In: LIDAM Reprints CORE.
[Citation analysis]
paper0
2003Les méthodes de point intérieur In: LIDAM Reprints CORE.
[Citation analysis]
paper0
2004Conic formulation for lp-norm optimization In: LIDAM Reprints CORE.
[Full Text][Citation analysis]
paper7
2004Conic 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
2010Impact of the material distribution formalism on the efficiency of evolutionary methods for topology optimization In: LIDAM Reprints CORE.
[Citation analysis]
paper1
2010ACUTA: a novel method for eliciting additive value functions on the basis of holistic preference statements In: LIDAM Reprints CORE.
[Full Text][Citation analysis]
paper29
2010ACUTA: 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
2012Double smoothing technique for large-scale linearly constrained convex optimization In: LIDAM Reprints CORE.
[Full Text][Citation analysis]
paper7
2013An efficient sampling method for regression-based polynomial chaos expansion In: LIDAM Reprints CORE.
[Full Text][Citation analysis]
paper0
2013Weighted sum rate maximization for downlink OFDMA with subcarrier-pair basded opportunistic DF relaying In: LIDAM Reprints CORE.
[Citation analysis]
paper1
2014A continuous characterization of the maximum-edge biclique problem In: LIDAM Reprints CORE.
[Citation analysis]
paper1
2014A 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
2014A global-local synthesis approach for large non-regular arrays In: LIDAM Reprints CORE.
[Citation analysis]
paper0
2014Real-time dynamic spectrum management for multi-user multi-carrier communication systems In: LIDAM Reprints CORE.
[Citation analysis]
paper0
2014Iterative convex approximation bases real-time dynamic spectrum management in multi-user multi-carrier communication systems In: LIDAM Reprints CORE.
[Citation analysis]
paper0
2014Two algorithms for orthogonal nonnegative matrix factorization with application to clusterin In: LIDAM Reprints CORE.
[Citation analysis]
paper3
2014A convex formulation for informed source separation in the signle channel setting In: LIDAM Reprints CORE.
[Citation analysis]
paper0
2014Energy limits in primary frequency control with short-term frequency-band allocation In: LIDAM Reprints CORE.
[Citation analysis]
paper0
2016Extended Lanczos Bidiagonalization Algorithm for Low Rank Approximation and Its Applications In: LIDAM Reprints CORE.
[Citation analysis]
paper0
2017On the linear extension complexity of regular n-gons In: LIDAM Reprints CORE.
[Citation analysis]
paper0
2017Random block coordinate descent methods for linearly constrained optimization over networks In: LIDAM Reprints CORE.
[Citation analysis]
paper5
2017Random 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: 5
article
2018Algorithms for possible semidefinite factorization In: LIDAM Reprints CORE.
[Citation analysis]
paper0
2018Exact worst-case convergence rates of the proximal gradient method for composite convex minimization In: LIDAM Reprints CORE.
[Citation analysis]
paper5
2018Exact 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: 5
article
2018Extended formulations for order polytopes through network flows In: LIDAM Reprints CORE.
[Citation analysis]
paper1
2019Linear convergence of first order methods for non-strongly convex optimization In: LIDAM Reprints CORE.
[Citation analysis]
paper14
2018Direct deterministic nulling techniques for large random arrays including mutual coupling In: LIDAM Reprints CORE.
[Citation analysis]
paper0
2019Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming In: LIDAM Reprints CORE.
[Citation analysis]
paper4
2020Peak shaving: a planning alternative to reduce investment costs in distribution systems? In: LIDAM Reprints CORE.
[Citation analysis]
paper0
2020Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation In: LIDAM Reprints CORE.
[Citation analysis]
paper4
2020Worst-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: 4
paper
2020Nonnegative Matrix Factorization over Continuous Signals using Parametrizable Functions In: LIDAM Reprints CORE.
[Citation analysis]
paper0
2021Image completion via nonnegative matrix factorization using HALS and B-splines In: LIDAM Reprints CORE.
[Citation analysis]
paper0
2021Lower bounds on the nonnegative rank using a nested polytopes formulation In: LIDAM Reprints CORE.
[Citation analysis]
paper0
2021Unsupervised Minimum Redundancy Maximum Relevance Feature Selection for Predictive Maintenance : Application to a Rotating Machine In: LIDAM Reprints CORE.
[Citation analysis]
paper0
2021A geometric lower bound on the extension complexity of polytopes based on the f-vector In: LIDAM Reprints CORE.
[Citation analysis]
paper0
2002Improving complexity of structured convex optimization problems using self-concordant barriers In: European Journal of Operational Research.
[Full Text][Citation analysis]
article0
2001Proving Strong Duality for Geometric Optimization Using a Conic Formulation In: Annals of Operations Research.
[Full Text][Citation analysis]
article2
2018Algorithms for positive semidefinite factorization In: Computational Optimization and Applications.
[Full Text][Citation analysis]
article2

CitEc is a RePEc service, providing citation data for Economics since 2001. Sponsored by INOMICS. Last updated December, 10 2023. Contact: CitEc Team