François Glineur : Citation Profile


Are you François Glineur?

Université Catholique de Louvain

4

H index

2

i10 index

70

Citations

RESEARCH PRODUCTION:

8

Articles

34

Papers

RESEARCH ACTIVITY:

   16 years (2001 - 2017). See details.
   Cites by year: 4
   Journals where François Glineur has often published
   Relations with other researchers
   Recent citing documents: 20.    Total self citations: 14 (16.67 %)

MORE DETAILS IN:
ABOUT THIS REPORT:

   Permalink: http://citec.repec.org/pgl27
   Updated: 2018-12-15    RAS profile: 2018-06-20    
   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:

Greco, Salvatore (2)

Dias, Luis (1)

Cites to:

Pohlmeier, Winfried (4)

Veredas, David (4)

Bauwens, Luc (4)

AMIR, Rabah (3)

Main data


Where François Glineur has published?


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

Recent works citing François Glineur (2018 and 2017)


YearTitle of citing document
2017Deriving rankings from incomplete preference information: A comparison of different approaches. (2017). Vetschera, Rudolf. In: European Journal of Operational Research. RePEc:eee:ejores:v:258:y:2017:i:1:p:244-253.

Full description at Econpapers || Download paper

2017How well does the OWA operator represent real preferences?. (2017). Reimann, Olivier ; Vetschera, Rudolf ; Schumacher, Christian. In: European Journal of Operational Research. RePEc:eee:ejores:v:258:y:2017:i:3:p:993-1003.

Full description at Econpapers || Download paper

2017A linear programming approach for learning non-monotonic additive value functions in multiple criteria decision aiding. (2017). Ghaderi, Mohammad ; Agell, Nuria ; Ruiz, Francisco. In: European Journal of Operational Research. RePEc:eee:ejores:v:259:y:2017:i:3:p:1073-1084.

Full description at Econpapers || Download paper

2017Markov Chain methods for the Bipartite Boolean Quadratic Programming Problem. (2017). Karapetyan, Daniel ; Parkes, Andrew J ; Punnen, Abraham P. In: European Journal of Operational Research. RePEc:eee:ejores:v:260:y:2017:i:2:p:494-506.

Full description at Econpapers || Download paper

2018UTA-poly and UTA-splines: Additive value functions with polynomial marginals. (2018). Gillis, Nicolas ; Pirlot, Marc ; Sobrie, Olivier ; Mousseau, Vincent. In: European Journal of Operational Research. RePEc:eee:ejores:v:264:y:2018:i:2:p:405-418.

Full description at Econpapers || Download paper

2018Stakeholder interviews with two MAVT preference elicitation philosophies in a Swiss water infrastructure decision: Aggregation using SWING-weighting and disaggregation using UTAGMS. (2018). Zheng, Jun ; Lienert, Judit. In: European Journal of Operational Research. RePEc:eee:ejores:v:267:y:2018:i:1:p:273-287.

Full description at Econpapers || Download paper

2018Structured low-rank matrix completion for forecasting in time series analysis. (2018). Gillard, Jonathan ; Usevich, Konstantin. In: International Journal of Forecasting. RePEc:eee:intfor:v:34:y:2018:i:4:p:582-597.

Full description at Econpapers || Download paper

2018A multi-criteria repair/recovery framework for the tail assignment problem in airlines. (2018). Khaled, Oumaima ; Ceugniet, Xavier ; Michel, Stphane ; Mousseau, Vincent ; Minoux, Michel. In: Journal of Air Transport Management. RePEc:eee:jaitra:v:68:y:2018:i:c:p:137-151.

Full description at Econpapers || Download paper

2017Adaptive smoothing algorithms for nonsmooth composite convex minimization. (2017). Tran-Dinh, Quoc . In: Computational Optimization and Applications. RePEc:spr:coopap:v:66:y:2017:i:3:d:10.1007_s10589-016-9873-6.

Full description at Econpapers || Download paper

2017A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming. (2017). Wang, Chengjing ; Tang, Peipei. In: Computational Optimization and Applications. RePEc:spr:coopap:v:68:y:2017:i:3:d:10.1007_s10589-017-9930-9.

Full description at Econpapers || Download paper

2018A flexible coordinate descent method. (2018). Fountoulakis, Kimon ; Tappenden, Rachael. In: Computational Optimization and Applications. RePEc:spr:coopap:v:70:y:2018:i:2:d:10.1007_s10589-018-9984-3.

Full description at Econpapers || Download paper

2018A unified global convergence analysis of multiplicative update rules for nonnegative matrix factorization. (2018). Takahashi, Norikazu ; Takeuchi, Junichi ; Seki, Masato ; Katayama, Jiro. In: Computational Optimization and Applications. RePEc:spr:coopap:v:71:y:2018:i:1:d:10.1007_s10589-018-9997-y.

Full description at Econpapers || Download paper

2018Algorithms for positive semidefinite factorization. (2018). Vandaele, Arnaud ; Gillis, Nicolas ; Glineur, Franois. In: Computational Optimization and Applications. RePEc:spr:coopap:v:71:y:2018:i:1:d:10.1007_s10589-018-9998-x.

Full description at Econpapers || Download paper

2017Matrix product constraints by projection methods. (2017). Elser, Veit . In: Journal of Global Optimization. RePEc:spr:jglopt:v:68:y:2017:i:2:d:10.1007_s10898-016-0466-9.

Full description at Econpapers || Download paper

2017Accelerated parallel and distributed algorithm using limited internal memory for nonnegative matrix factorization. (2017). Nguyen, Duy Khuong ; Bao, TU. In: Journal of Global Optimization. RePEc:spr:jglopt:v:68:y:2017:i:2:d:10.1007_s10898-016-0471-z.

Full description at Econpapers || Download paper

2017DC-NMF: nonnegative matrix factorization based on divide-and-conquer for fast clustering and topic modeling. (2017). Du, Rundong ; Park, Haesun ; Drake, Barry ; Kuang, Da. In: Journal of Global Optimization. RePEc:spr:jglopt:v:68:y:2017:i:4:d:10.1007_s10898-017-0515-z.

Full description at Econpapers || Download paper

2017On the Convergence Analysis of the Optimized Gradient Method. (2017). Kim, Dong Hwan ; Fessler, Jeffrey A. In: Journal of Optimization Theory and Applications. RePEc:spr:joptap:v:172:y:2017:i:1:d:10.1007_s10957-016-1018-7.

Full description at Econpapers || Download paper

2017Solving the Maximum Clique Problem with Symmetric Rank-One Non-negative Matrix Approximation. (2017). Belachew, Melisew Tefera ; Gillis, Nicolas. In: Journal of Optimization Theory and Applications. RePEc:spr:joptap:v:173:y:2017:i:1:d:10.1007_s10957-016-1043-6.

Full description at Econpapers || Download paper

2018Exact Worst-Case Convergence Rates of the Proximal Gradient Method for Composite Convex Minimization. (2018). Taylor, Adrien B ; Glineur, Franois ; Hendrickx, Julien M. In: Journal of Optimization Theory and Applications. RePEc:spr:joptap:v:178:y:2018:i:2:d:10.1007_s10957-018-1298-1.

Full description at Econpapers || Download paper

2018Solving structured nonsmooth convex optimization with complexity $$\mathcal {O}(\varepsilon ^{-1/2})$$ O ( ε - 1 / 2 ). (2018). Ahookhosh, Masoud ; Neumaier, Arnold. In: TOP: An Official Journal of the Spanish Society of Statistics and Operations Research. RePEc:spr:topjnl:v:26:y:2018:i:1:d:10.1007_s11750-017-0462-3.

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: CORE Discussion Papers.
[Full Text][Citation analysis]
paper1
2009An interior-point method for the single-facility location problem with mixed norms using a conic formulation.(2009) In: CORE Discussion Papers RP.
[Full Text][Citation analysis]
This paper has another 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 another version. Agregated cites: 1
article
2008Nonnegative factorization and the maximum edge biclique problem In: CORE Discussion Papers.
[Full Text][Citation analysis]
paper3
2010Nonnegative factorization and the maximum edge biclique problem.(2010) In: CORE Discussion Papers.
[Full Text][Citation analysis]
This paper has another version. Agregated cites: 3
paper
2009Using underapproximations for sparse nonnegative matrix factorization In: CORE Discussion Papers.
[Full Text][Citation analysis]
paper1
2010Using underapproximations for sparse nonnegative matrix factorization.(2010) In: CORE Discussion Papers RP.
[Full Text][Citation analysis]
This paper has another version. Agregated cites: 1
paper
2010Solving infinite-dimensional optimization problems by polynomial approximation In: CORE Discussion Papers.
[Full Text][Citation analysis]
paper1
2010Solving infinite-dimensional optimizaiton problems by polynomial approximation.(2010) In: CORE Discussion Papers RP.
[Citation analysis]
This paper has another version. Agregated cites: 1
paper
2010Double smoothing technique for infinite-dimensional optimization problems with applications to optimal control In: CORE Discussion Papers.
[Full Text][Citation analysis]
paper0
2010A multilevel approach for nonnegative matrix factorization In: CORE Discussion Papers.
[Full Text][Citation analysis]
paper2
2011A multilevel approach for nonnegative matrix factorization.(2011) In: CORE Discussion Papers RP.
[Full Text][Citation analysis]
This paper has another version. Agregated cites: 2
paper
2010On the geometric interpretation of the nonnegative rank In: CORE Discussion Papers.
[Full Text][Citation analysis]
paper2
2012On the geometric interpretation of the nonnegative rank.(2012) In: CORE Discussion Papers RP.
[Full Text][Citation analysis]
This paper has another version. Agregated cites: 2
paper
2010Low-rank matrix approximation with weights or missing data is NP-hard In: CORE Discussion Papers.
[Full Text][Citation analysis]
paper3
2011Low-rank matrix approximation with weights or missing data is NP-hard.(2011) In: CORE Discussion Papers RP.
[Full Text][Citation analysis]
This paper has another version. Agregated cites: 3
paper
2011First-order methods of smooth convex optimization with inexact oracle In: CORE Discussion Papers.
[Full Text][Citation analysis]
paper13
2011Accelerated multiplicative updates and hierarchical als algorithms for nonnegative matrix factorization In: CORE Discussion Papers.
[Full Text][Citation analysis]
paper5
2012Accelerated multiplicative updates and hierarchical ALS algorithms for nonnegative matrix factorization.(2012) In: CORE Discussion Papers RP.
[Full Text][Citation analysis]
This paper has another version. Agregated cites: 5
paper
2013First-order methods with inexact oracle: the strongly convex case In: CORE Discussion Papers.
[Full Text][Citation analysis]
paper1
2013Intermediate gradient methods for smooth convex problems with inexact oracle In: CORE Discussion Papers.
[Full Text][Citation analysis]
paper3
2015Heuristics for exact nonnegative matrix factorization In: CORE Discussion Papers.
[Full Text][Citation analysis]
paper3
2016Heuristics for Exact Nonnegative Matrix Factorization.(2016) In: CORE Discussion Papers RP.
[Citation analysis]
This paper has another version. Agregated cites: 3
paper
2016Heuristics for exact nonnegative matrix factorization.(2016) In: Journal of Global Optimization.
[Full Text][Citation analysis]
This paper has another version. Agregated cites: 3
article
2015Smooth Strongly Convex Interpolation and Exact Worst-case Performance of First-order Methods In: CORE Discussion Papers.
[Full Text][Citation analysis]
paper1
2016On the Worst-case Complexity of the Gradient Method with Exact Line Search for Smooth Strongly Convex Functions In: CORE Discussion Papers.
[Full Text][Citation analysis]
paper1
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 another version. Agregated cites: 1
paper
2016Exact worst-case performance of first-order methods for composite convex optimization In: CORE Discussion Papers.
[Full Text][Citation analysis]
paper1
2002Improving complexity of structured convex optimization problems usiion ng self-concordant barriers In: CORE Discussion Papers RP.
[Citation analysis]
paper0
2003Les méthodes de point intérieur In: CORE Discussion Papers RP.
[Citation analysis]
paper0
2004Conic formulation for lp-norm optimization In: CORE Discussion Papers RP.
[Full Text][Citation analysis]
paper3
2004Conic 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: 3
article
2010Impact of the material distribution formalism on the efficiency of evolutionary methods for topology optimization In: CORE Discussion Papers RP.
[Citation analysis]
paper1
2010ACUTA: a novel method for eliciting additive value functions on the basis of holistic preference statements In: CORE Discussion Papers RP.
[Full Text][Citation analysis]
paper17
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 another version. Agregated cites: 17
article
2012Double smoothing technique for large-scale linearly constrained convex optimization In: CORE Discussion Papers RP.
[Full Text][Citation analysis]
paper7
2013An efficient sampling method for regression-based polynomial chaos expansion In: CORE Discussion Papers RP.
[Full Text][Citation analysis]
paper0
2014Energy limits in primary frequency control with short-term frequency-band allocation In: CORE Discussion Papers RP.
[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]
article0
2014A continuous characterization of the maximum-edge biclique problem In: Journal of Global Optimization.
[Full Text][Citation analysis]
article1
2017Random Block Coordinate Descent Methods for Linearly Constrained Optimization over Networks In: Journal of Optimization Theory and Applications.
[Full Text][Citation analysis]
article0

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