IDEAS home Printed from https://ideas.repec.org/e/pgl27.html
   My authors  Follow this author

François Glineur

Personal Details

First Name:François
Middle Name:
Last Name:Glineur
Suffix:
RePEc Short-ID:pgl27
[This author has chosen not to make the email address public]

Affiliation

Center for Operations Research and Econometrics (CORE)
École des Sciences Économiques de Louvain
Université Catholique de Louvain

Louvain-la-Neuve, Belgium
http://www.uclouvain.be/en-core.html

: 32(10)474321
32(10)474301
34 VOIE DU ROMAN PAYS, 1348 LOUVAIN-LA-NEUVE
RePEc:edi:coreebe (more details at EDIRC)

Research output

as
Jump to: Working papers Articles

Working papers

  1. TAYLOR, Adrien B. & HENDRICKX, Julien M. & François GLINEUR, 2016. "Exact worst-case performance of first-order methods for composite convex optimization," CORE Discussion Papers 2016052, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  2. DE KLERK, Etienne & GLINEUR, François & TAYLOR, Adrien B., 2016. "On the Worst-case Complexity of the Gradient Method with Exact Line Search for Smooth Strongly Convex Functions," CORE Discussion Papers 2016027, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  3. Taylor, A. & Hendrickx, J. & Glineur, F., 2015. "Smooth Strongly Convex Interpolation and Exact Worst-case Performance of First-order Methods," CORE Discussion Papers 2015013, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  4. Gillis, Nicolas & Glineur, François & Tuyttens, Daniel & Vandaele, Arnaud, 2015. "Heuristics for exact nonnegative matrix factorization," CORE Discussion Papers 2015006, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  5. LATIERS, Arnaud & GLINEUR, François & DE JAEGER, Emmanuel, 2014. "Energy limits in primary frequency control with short-term frequency-band allocation," CORE Discussion Papers RP 2658, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  6. ZEIN, Samih & COLSON, Benoît & GLINEUR, François, 2013. "An efficient sampling method for regression-based polynomial chaos expansion," CORE Discussion Papers RP 2453, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  7. DEVOLDER, Olivier & GLINEUR, François & NESTEROV, Yurii, 2013. "First-order methods with inexact oracle: the strongly convex case," CORE Discussion Papers 2013016, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  8. DEVOLDER, Olivier & GLINEUR, François & NESTEROV, Yurii, 2013. "Intermediate gradient methods for smooth convex problems with inexact oracle," CORE Discussion Papers 2013017, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  9. DEVOLDER, Olivier & GLINEUR, François & NESTEROV, Yurii, 2012. "Double smoothing technique for large-scale linearly constrained convex optimization," CORE Discussion Papers RP 2423, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  10. DEVOLDER, Olivier & GLINEUR, François & NESTEROV, Yurii, 2011. "First-order methods of smooth convex optimization with inexact oracle," CORE Discussion Papers 2011002, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  11. GILLIS, Nicolas & GLINEUR, François, 2011. "Accelerated multiplicative updates and hierarchical als algorithms for nonnegative matrix factorization," CORE Discussion Papers 2011030, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  12. DEVOLDER, Olivier & GLINEUR, François & NESTEROV, Yurii, 2010. "Solving infinite-dimensional optimization problems by polynomial approximation," CORE Discussion Papers 2010029, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  13. DEVOLDER, Olivier & GLINEUR, François & NESTEROV, Yurii, 2010. "Double smoothing technique for infinite-dimensional optimization problems with applications to optimal control," CORE Discussion Papers 2010034, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  14. GILLIS, Nicolas & GLINEUR, François, 2010. "Low-rank matrix approximation with weights or missing data is NP-hard," CORE Discussion Papers 2010075, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  15. BOUS, Géraldine & FORTEMPS, Philippe & GLINEUR, François & PIRLOT, Marc, 2010. "ACUTA: a novel method for eliciting additive value functions on the basis of holistic preference statements," CORE Discussion Papers RP 2243, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  16. GILLIS, Nicolas & GLINEUR, François, 2010. "On the geometric interpretation of the nonnegative rank," CORE Discussion Papers 2010051, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  17. GILLIS, Nicolas & GLINEUR, François, 2010. "A multilevel approach for nonnegative matrix factorization," CORE Discussion Papers 2010047, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  18. DENIES, Jonathan & DEHEZ, Bruno & GLINEUR, François & BEN AHMED, Hamid, 2010. "Impact of the material distribution formalism on the efficiency of evolutionary methods for topology optimization," CORE Discussion Papers RP 2242, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  19. GILLIS, Nicolas & GLINEUR, François, 2009. "Using underapproximations for sparse nonnegative matrix factorization," CORE Discussion Papers 2009006, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  20. GILLIS, Nicolas & GLINEUR, François, 2008. "Nonnegative factorization and the maximum edge biclique problem," CORE Discussion Papers 2008064, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  21. CHARES, Robert & GLINEUR, François, 2007. "An interior-point method for the single-facility location problem with mixed norms using a conic formulation," CORE Discussion Papers 2007071, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  22. GLINEUR, François & TERLAKY, Tamas, 2004. "Conic formulation for lp-norm optimization," CORE Discussion Papers RP 1726, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  23. GLINEUR, François, 2003. "Les méthodes de point intérieur," CORE Discussion Papers RP 1645, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  24. GLINEUR, François, 2002. "Improving complexity of structured convex optimization problems usiion ng self-concordant barriers," CORE Discussion Papers RP 1621, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

Articles

  1. Ion Necoara & Yurii Nesterov & François Glineur, 2017. "Random Block Coordinate Descent Methods for Linearly Constrained Optimization over Networks," Journal of Optimization Theory and Applications, Springer, vol. 173(1), pages 227-254, April.
  2. Arnaud Vandaele & Nicolas Gillis & François Glineur & Daniel Tuyttens, 2016. "Heuristics for exact nonnegative matrix factorization," Journal of Global Optimization, Springer, vol. 65(2), pages 369-400, June.
  3. Nicolas Gillis & François Glineur, 2014. "A continuous characterization of the maximum-edge biclique problem," Journal of Global Optimization, Springer, vol. 58(3), pages 439-464, March.
  4. Bous, Géraldine & Fortemps, Philippe & Glineur, François & Pirlot, Marc, 2010. "ACUTA: A novel method for eliciting additive value functions on the basis of holistic preference statements," European Journal of Operational Research, Elsevier, vol. 206(2), pages 435-444, October.
  5. Robert Chares & François Glineur, 2008. "An interior-point method for the single-facility location problem with mixed norms using a conic formulation," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(3), pages 383-405, December.
  6. F. Glineur & T. Terlaky, 2004. "Conic Formulation for l p -Norm Optimization," Journal of Optimization Theory and Applications, Springer, vol. 122(2), pages 285-307, August.
  7. Glineur, Francois, 2002. "Improving complexity of structured convex optimization problems using self-concordant barriers," European Journal of Operational Research, Elsevier, vol. 143(2), pages 291-310, December.
  8. François Glineur, 2001. "Proving Strong Duality for Geometric Optimization Using a Conic Formulation," Annals of Operations Research, Springer, vol. 105(1), pages 155-184, July.

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Working papers

  1. Taylor, A. & Hendrickx, J. & Glineur, F., 2015. "Smooth Strongly Convex Interpolation and Exact Worst-case Performance of First-order Methods," CORE Discussion Papers 2015013, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. TAYLOR, Adrien B. & HENDRICKX, Julien M. & François GLINEUR, 2016. "Exact worst-case performance of first-order methods for composite convex optimization," CORE Discussion Papers 2016052, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

  2. Gillis, Nicolas & Glineur, François & Tuyttens, Daniel & Vandaele, Arnaud, 2015. "Heuristics for exact nonnegative matrix factorization," CORE Discussion Papers 2015006, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. Veit Elser, 2017. "Matrix product constraints by projection methods," Journal of Global Optimization, Springer, vol. 68(2), pages 329-355, June.
    2. Melisew Tefera Belachew & Nicolas Gillis, 2017. "Solving the Maximum Clique Problem with Symmetric Rank-One Non-negative Matrix Approximation," Journal of Optimization Theory and Applications, Springer, vol. 173(1), pages 279-296, April.

  3. DEVOLDER, Olivier & GLINEUR, François & NESTEROV, Yurii, 2013. "First-order methods with inexact oracle: the strongly convex case," CORE Discussion Papers 2013016, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. Masaru Ito, 2016. "New results on subgradient methods for strongly convex optimization problems with a unified analysis," Computational Optimization and Applications, Springer, vol. 65(1), pages 127-172, September.

  4. DEVOLDER, Olivier & GLINEUR, François & NESTEROV, Yurii, 2013. "Intermediate gradient methods for smooth convex problems with inexact oracle," CORE Discussion Papers 2013017, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. Pavel Dvurechensky & Alexander Gasnikov, 2016. "Stochastic Intermediate Gradient Method for Convex Problems with Stochastic Inexact Oracle," Journal of Optimization Theory and Applications, Springer, vol. 171(1), pages 121-145, October.
    2. Rachael Tappenden & Peter Richtárik & Jacek Gondzio, 2016. "Inexact Coordinate Descent: Complexity and Preconditioning," Journal of Optimization Theory and Applications, Springer, vol. 170(1), pages 144-176, July.
    3. Kimon Fountoulakis & Rachael Tappenden, 2018. "A flexible coordinate descent method," Computational Optimization and Applications, Springer, vol. 70(2), pages 351-394, June.

  5. DEVOLDER, Olivier & GLINEUR, François & NESTEROV, Yurii, 2012. "Double smoothing technique for large-scale linearly constrained convex optimization," CORE Discussion Papers RP 2423, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. Radu Boţ & Christopher Hendrich, 2015. "A variable smoothing algorithm for solving convex optimization problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(1), pages 124-150, April.
    2. Radu Boţ & Christopher Hendrich, 2013. "A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems," Computational Optimization and Applications, Springer, vol. 54(2), pages 239-262, March.
    3. Stefan Richter & Colin Jones & Manfred Morari, 2013. "Certification aspects of the fast gradient method for solving the dual of parametric convex programs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 77(3), pages 305-321, June.
    4. Taylor, A. & Hendrickx, J. & Glineur, F., 2015. "Smooth Strongly Convex Interpolation and Exact Worst-case Performance of First-order Methods," CORE Discussion Papers 2015013, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. Masoud Ahookhosh & Arnold Neumaier, 2018. "Solving structured nonsmooth convex optimization with complexity $$\mathcal {O}(\varepsilon ^{-1/2})$$ O ( ε - 1 / 2 )," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(1), pages 110-145, April.
    6. Jueyou Li & Guo Chen & Zhaoyang Dong & Zhiyou Wu, 2016. "A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints," Computational Optimization and Applications, Springer, vol. 64(3), pages 671-697, July.
    7. TAYLOR, Adrien B. & HENDRICKX, Julien M. & François GLINEUR, 2016. "Exact worst-case performance of first-order methods for composite convex optimization," CORE Discussion Papers 2016052, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    8. Pavel Dvurechensky & Yurii Nesterov & Vladimir Spokoiny, 2015. "Primal-Dual Methods for Solving Infinite-Dimensional Games," Journal of Optimization Theory and Applications, Springer, vol. 166(1), pages 23-51, July.
    9. Quoc Tran-Dinh, 2017. "Adaptive smoothing algorithms for nonsmooth composite convex minimization," Computational Optimization and Applications, Springer, vol. 66(3), pages 425-451, April.

  6. DEVOLDER, Olivier & GLINEUR, François & NESTEROV, Yurii, 2011. "First-order methods of smooth convex optimization with inexact oracle," CORE Discussion Papers 2011002, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. Chengjing Wang & Peipei Tang, 2017. "A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming," Computational Optimization and Applications, Springer, vol. 68(3), pages 503-532, December.
    2. Stefan Richter & Colin Jones & Manfred Morari, 2013. "Certification aspects of the fast gradient method for solving the dual of parametric convex programs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 77(3), pages 305-321, June.
    3. NESTEROV, Yurii, 2013. "Universal gradient methods for convex optimization problems," CORE Discussion Papers 2013026, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. Pavel Dvurechensky & Alexander Gasnikov, 2016. "Stochastic Intermediate Gradient Method for Convex Problems with Stochastic Inexact Oracle," Journal of Optimization Theory and Applications, Springer, vol. 171(1), pages 121-145, October.
    5. DEVOLDER, Olivier & GLINEUR, François & NESTEROV, Yurii, 2013. "Intermediate gradient methods for smooth convex problems with inexact oracle," CORE Discussion Papers 2013017, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    6. Masoud Ahookhosh & Arnold Neumaier, 2018. "Solving structured nonsmooth convex optimization with complexity $$\mathcal {O}(\varepsilon ^{-1/2})$$ O ( ε - 1 / 2 )," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(1), pages 110-145, April.
    7. Jueyou Li & Zhiyou Wu & Changzhi Wu & Qiang Long & Xiangyu Wang, 2016. "An Inexact Dual Fast Gradient-Projection Method for Separable Convex Optimization with Linear Coupled Constraints," Journal of Optimization Theory and Applications, Springer, vol. 168(1), pages 153-171, January.
    8. Masaru Ito, 2016. "New results on subgradient methods for strongly convex optimization problems with a unified analysis," Computational Optimization and Applications, Springer, vol. 65(1), pages 127-172, September.
    9. J. O. Royset & E. Y. Pee, 2012. "Rate of Convergence Analysis of Discretization and Smoothing Algorithms for Semiinfinite Minimax Problems," Journal of Optimization Theory and Applications, Springer, vol. 155(3), pages 855-882, December.
    10. TAYLOR, Adrien B. & HENDRICKX, Julien M. & François GLINEUR, 2016. "Exact worst-case performance of first-order methods for composite convex optimization," CORE Discussion Papers 2016052, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    11. DEVOLDER, Olivier, 2011. "Stochastic first order methods in smooth convex optimization," CORE Discussion Papers 2011070, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    12. Rachael Tappenden & Peter Richtárik & Jacek Gondzio, 2016. "Inexact Coordinate Descent: Complexity and Preconditioning," Journal of Optimization Theory and Applications, Springer, vol. 170(1), pages 144-176, July.
    13. DEVOLDER, Olivier & GLINEUR, François & NESTEROV, Yurii, 2013. "First-order methods with inexact oracle: the strongly convex case," CORE Discussion Papers 2013016, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    14. Kimon Fountoulakis & Rachael Tappenden, 2018. "A flexible coordinate descent method," Computational Optimization and Applications, Springer, vol. 70(2), pages 351-394, June.
    15. Renato D. C. Monteiro & Camilo Ortiz & Benar F. Svaiter, 2016. "An adaptive accelerated first-order method for convex optimization," Computational Optimization and Applications, Springer, vol. 64(1), pages 31-73, May.

  7. GILLIS, Nicolas & GLINEUR, François, 2011. "Accelerated multiplicative updates and hierarchical als algorithms for nonnegative matrix factorization," CORE Discussion Papers 2011030, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. Norikazu Takahashi & Ryota Hibi, 2014. "Global convergence of modified multiplicative updates for nonnegative matrix factorization," Computational Optimization and Applications, Springer, vol. 57(2), pages 417-440, March.
    2. Jingu Kim & Yunlong He & Haesun Park, 2014. "Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework," Journal of Global Optimization, Springer, vol. 58(2), pages 285-319, February.
    3. Gillis, Nicolas & Glineur, François & Tuyttens, Daniel & Vandaele, Arnaud, 2015. "Heuristics for exact nonnegative matrix factorization," CORE Discussion Papers 2015006, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. Rundong Du & Da Kuang & Barry Drake & Haesun Park, 2017. "DC-NMF: nonnegative matrix factorization based on divide-and-conquer for fast clustering and topic modeling," Journal of Global Optimization, Springer, vol. 68(4), pages 777-798, August.
    5. Duy Khuong Nguyen & Tu Bao Ho, 2017. "Accelerated parallel and distributed algorithm using limited internal memory for nonnegative matrix factorization," Journal of Global Optimization, Springer, vol. 68(2), pages 307-328, June.

  8. DEVOLDER, Olivier & GLINEUR, François & NESTEROV, Yurii, 2010. "Solving infinite-dimensional optimization problems by polynomial approximation," CORE Discussion Papers 2010029, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. Jubril, A.M. & Olaniyan, O.A. & Komolafe, O.A. & Ogunbona, P.O., 2014. "Economic-emission dispatch problem: A semi-definite programming approach," Applied Energy, Elsevier, vol. 134(C), pages 446-455.

  9. DEVOLDER, Olivier & GLINEUR, François & NESTEROV, Yurii, 2010. "Double smoothing technique for infinite-dimensional optimization problems with applications to optimal control," CORE Discussion Papers 2010034, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. DEVOLDER, Olivier & GLINEUR, François & NESTEROV, Yurii, 2011. "First-order methods of smooth convex optimization with inexact oracle," CORE Discussion Papers 2011002, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

  10. BOUS, Géraldine & FORTEMPS, Philippe & GLINEUR, François & PIRLOT, Marc, 2010. "ACUTA: a novel method for eliciting additive value functions on the basis of holistic preference statements," CORE Discussion Papers RP 2243, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. Vetschera, Rudolf, 2017. "Deriving rankings from incomplete preference information: A comparison of different approaches," European Journal of Operational Research, Elsevier, vol. 258(1), pages 244-253.
    2. Bouchery, Yann & Ghaffari, Asma & Jemai, Zied & Dallery, Yves, 2012. "Including sustainability criteria into inventory models," European Journal of Operational Research, Elsevier, vol. 222(2), pages 229-240.
    3. Dorota Górecka & Ewa Roszkowska & Tomasz Wachowicz, 2016. "The MARS Approach in the Verbal and Holistic Evaluation of the Negotiation Template," Group Decision and Negotiation, Springer, vol. 25(6), pages 1097-1136, November.
    4. Hurson, Christian & Siskos, Yannis, 2014. "A synergy of multicriteria techniques to assess additive value models," European Journal of Operational Research, Elsevier, vol. 238(2), pages 540-551.
    5. Khaled, Oumaima & Minoux, Michel & Mousseau, Vincent & Michel, Stéphane & Ceugniet, Xavier, 2018. "A multi-criteria repair/recovery framework for the tail assignment problem in airlines," Journal of Air Transport Management, Elsevier, vol. 68(C), pages 137-151.
    6. Nguyen, Duy Van, 2013. "Global maximization of UTA functions in multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 228(2), pages 397-404.
    7. Zheng, Jun & Lienert, Judit, 2018. "Stakeholder interviews with two MAVT preference elicitation philosophies in a Swiss water infrastructure decision: Aggregation using SWING-weighting and disaggregation using UTAGMS," European Journal of Operational Research, Elsevier, vol. 267(1), pages 273-287.
    8. Bottomley, Paul A. & Doyle, John R., 2013. "Comparing the validity of numerical judgements elicited by direct rating and point allocation: Insights from objectively verifiable perceptual tasks," European Journal of Operational Research, Elsevier, vol. 228(1), pages 148-157.
    9. Doumpos, Michael & Zopounidis, Constantin & Galariotis, Emilios, 2014. "Inferring robust decision models in multicriteria classification problems: An experimental analysis," European Journal of Operational Research, Elsevier, vol. 236(2), pages 601-611.
    10. Sobrie, Olivier & Gillis, Nicolas & Mousseau, Vincent & Pirlot, Marc, 2018. "UTA-poly and UTA-splines: Additive value functions with polynomial marginals," European Journal of Operational Research, Elsevier, vol. 264(2), pages 405-418.
    11. Reimann, Olivier & Schumacher, Christian & Vetschera, Rudolf, 2017. "How well does the OWA operator represent real preferences?," European Journal of Operational Research, Elsevier, vol. 258(3), pages 993-1003.
    12. Kadziński, Miłosz & Greco, Salvatore & Słowiński, Roman, 2012. "Selection of a representative value function in robust multiple criteria ranking and choice," European Journal of Operational Research, Elsevier, vol. 217(3), pages 541-553.
    13. Ghaderi, Mohammad & Ruiz, Francisco & Agell, Núria, 2017. "A linear programming approach for learning non-monotonic additive value functions in multiple criteria decision aiding," European Journal of Operational Research, Elsevier, vol. 259(3), pages 1073-1084.
    14. Miłosz Kadziński & Salvatore Greco & Roman Słowiński, 2013. "Selection of a Representative Value Function for Robust Ordinal Regression in Group Decision Making," Group Decision and Negotiation, Springer, vol. 22(3), pages 429-462, May.
    15. Paula Sarabando & Luís C. Dias & Rudolf Vetschera, 2013. "Mediation with Incomplete Information: Approaches to Suggest Potential Agreements," Group Decision and Negotiation, Springer, vol. 22(3), pages 561-597, May.
    16. Christoph Graf & Rudolf Vetschera & Yingchao Zhang, 2013. "Parameters of social preference functions: measurement and external validity," Theory and Decision, Springer, vol. 74(3), pages 357-382, March.
    17. Kadziński, Miłosz & Ciomek, Krzysztof & Słowiński, Roman, 2015. "Modeling assignment-based pairwise comparisons within integrated framework for value-driven multiple criteria sorting," European Journal of Operational Research, Elsevier, vol. 241(3), pages 830-841.

  11. GILLIS, Nicolas & GLINEUR, François, 2010. "On the geometric interpretation of the nonnegative rank," CORE Discussion Papers 2010051, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. Veit Elser, 2017. "Matrix product constraints by projection methods," Journal of Global Optimization, Springer, vol. 68(2), pages 329-355, June.
    2. Gillis, Nicolas & Glineur, François & Tuyttens, Daniel & Vandaele, Arnaud, 2015. "Heuristics for exact nonnegative matrix factorization," CORE Discussion Papers 2015006, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

  12. GILLIS, Nicolas & GLINEUR, François, 2010. "A multilevel approach for nonnegative matrix factorization," CORE Discussion Papers 2010047, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. Jingu Kim & Yunlong He & Haesun Park, 2014. "Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework," Journal of Global Optimization, Springer, vol. 58(2), pages 285-319, February.

  13. GILLIS, Nicolas & GLINEUR, François, 2009. "Using underapproximations for sparse nonnegative matrix factorization," CORE Discussion Papers 2009006, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. GILLIS, Nicolas & GLINEUR, François, 2010. "Nonnegative factorization and the maximum edge biclique problem," CORE Discussion Papers 2010059, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Jingu Kim & Yunlong He & Haesun Park, 2014. "Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework," Journal of Global Optimization, Springer, vol. 58(2), pages 285-319, February.
    3. Gillis, Nicolas & Glineur, François & Tuyttens, Daniel & Vandaele, Arnaud, 2015. "Heuristics for exact nonnegative matrix factorization," CORE Discussion Papers 2015006, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

  14. GILLIS, Nicolas & GLINEUR, François, 2008. "Nonnegative factorization and the maximum edge biclique problem," CORE Discussion Papers 2008064, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. GILLIS, Nicolas & GLINEUR, François, 2011. "Accelerated multiplicative updates and hierarchical als algorithms for nonnegative matrix factorization," CORE Discussion Papers 2011030, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. GILLIS, Nicolas & GLINEUR, François, 2010. "On the geometric interpretation of the nonnegative rank," CORE Discussion Papers 2010051, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. GILLIS, Nicolas & GLINEUR, François, 2011. "Low-rank matrix approximation with weights or missing data is NP-hard," CORE Discussion Papers RP 2382, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. Norikazu Takahashi & Ryota Hibi, 2014. "Global convergence of modified multiplicative updates for nonnegative matrix factorization," Computational Optimization and Applications, Springer, vol. 57(2), pages 417-440, March.
    5. Jingu Kim & Yunlong He & Haesun Park, 2014. "Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework," Journal of Global Optimization, Springer, vol. 58(2), pages 285-319, February.
    6. Nicolas Gillis & François Glineur, 2014. "A continuous characterization of the maximum-edge biclique problem," Journal of Global Optimization, Springer, vol. 58(3), pages 439-464, March.

  15. CHARES, Robert & GLINEUR, François, 2007. "An interior-point method for the single-facility location problem with mixed norms using a conic formulation," CORE Discussion Papers 2007071, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. Le Hien, 2015. "Differential properties of Euclidean projection onto power cone," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(3), pages 265-284, December.

  16. GLINEUR, François & TERLAKY, Tamas, 2004. "Conic formulation for lp-norm optimization," CORE Discussion Papers RP 1726, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. Baha Alzalg, 2016. "The Algebraic Structure of the Arbitrary-Order Cone," Journal of Optimization Theory and Applications, Springer, vol. 169(1), pages 32-49, April.
    2. GLINEUR, François & TERLAKY, Tamas, 2004. "Conic formulation for lp-norm optimization," CORE Discussion Papers RP 1726, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

Articles

  1. Arnaud Vandaele & Nicolas Gillis & François Glineur & Daniel Tuyttens, 2016. "Heuristics for exact nonnegative matrix factorization," Journal of Global Optimization, Springer, vol. 65(2), pages 369-400, June.
    See citations under working paper version above.
  2. Nicolas Gillis & François Glineur, 2014. "A continuous characterization of the maximum-edge biclique problem," Journal of Global Optimization, Springer, vol. 58(3), pages 439-464, March.

    Cited by:

    1. Melisew Tefera Belachew & Nicolas Gillis, 2017. "Solving the Maximum Clique Problem with Symmetric Rank-One Non-negative Matrix Approximation," Journal of Optimization Theory and Applications, Springer, vol. 173(1), pages 279-296, April.

  3. Bous, Géraldine & Fortemps, Philippe & Glineur, François & Pirlot, Marc, 2010. "ACUTA: A novel method for eliciting additive value functions on the basis of holistic preference statements," European Journal of Operational Research, Elsevier, vol. 206(2), pages 435-444, October.
    See citations under working paper version above.
  4. Robert Chares & François Glineur, 2008. "An interior-point method for the single-facility location problem with mixed norms using a conic formulation," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(3), pages 383-405, December.
    See citations under working paper version above.
  5. F. Glineur & T. Terlaky, 2004. "Conic Formulation for l p -Norm Optimization," Journal of Optimization Theory and Applications, Springer, vol. 122(2), pages 285-307, August.
    See citations under working paper version above.
  6. François Glineur, 2001. "Proving Strong Duality for Geometric Optimization Using a Conic Formulation," Annals of Operations Research, Springer, vol. 105(1), pages 155-184, July.

    Cited by:

    1. Robert Chares & François Glineur, 2008. "An interior-point method for the single-facility location problem with mixed norms using a conic formulation," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(3), pages 383-405, December.
    2. GLINEUR, François & TERLAKY, Tamas, 2004. "Conic formulation for lp-norm optimization," CORE Discussion Papers RP 1726, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

NEP Fields

NEP is an announcement service for new working papers, with a weekly report in each of many fields. This author has had 13 papers announced in NEP. These are the fields, ordered by number of announcements, along with their dates. If the author is listed in the directory of specialists for this field, a link is also provided.
  1. NEP-CMP: Computational Economics (2) 2010-10-02 2018-01-29
  2. NEP-ECM: Econometrics (1) 2011-02-12
  3. NEP-ORE: Operations Research (1) 2010-10-02

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, François Glineur should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.