Profil

Vandaele Arnaud

Université de Mons - UMONS > Faculté Polytechnique > Service de Mathématique et Recherche opérationnelle

Université de Mons - UMONS > Faculté Polytechnique > Mathématique et Recherche opérationnelle

Main Referenced Co-authors
GILLIS, Nicolas  (17)
TUYTTENS, Daniel  (15)
Cohen, Jeremy E. (4)
Nadisic, Nicolas  (4)
Glineur, François (3)
Main Referenced Keywords
Combinatorial optimization problem (1); Cutting stock problem (1); GRASP (1); Metaheuristics (1);
Main Referenced Unit & Research Centers
CRTI - Centre de Recherche en Technologie de l'Information (6)
CREMMI - Modélisation mathématique et informatique (1)
Main Referenced Disciplines
Mathematics (43)
Computer science (16)
Electrical & electronics engineering (10)

Publications (total 43)

The most downloaded
62 downloads
Vandaele, A., Glineur, F., & Gillis, N. (21 March 2018). Algorithms for positive semidefinite factorization. Computational Optimization and Applications, 71 (1), 193-219. https://hdl.handle.net/20.500.12907/42120

The most cited

34 citations (Scopus®)

Vandaele, A., Gillis, N., Lei, Q., Zhong, K., & Dhillon, I. (01 November 2016). Efficient and Non-Convex Coordinate Descent for Symmetric Nonnegative Matrix Factorization. IEEE Transactions on Signal Processing, 64 (21), 5571-5584. https://hdl.handle.net/20.500.12907/41891

Dache, A., Vandaele, A., & Gillis, N. (2024). Orthogonal Symmetric Nonnegative Matrix Tri-Factorization. IEEE International Workshop on Machine Learning for Signal Processing.
Peer Reviewed verified by ORBi

Lefebvre, J., Vandaele, A., & Gillis, N. (2024). Component-wise Squared Factorization. IEEE International Workshop on Machine Learning for Signal Processing.
Peer Reviewed verified by ORBi

Awari, A. A., Nguyen, H., Wertz, S., Vandaele, A., & Gillis, N. (2024). Coordinate Descent Algorithm for Nonlinear Matrix Decomposition with the ReLU function. European Signal Processing Conference.
Peer reviewed

Seraghiti, G., Awari, A. A., Vandaele, A., Porcelli, M., & Gillis, N. (2023). Accelerated Algorithms for Nonlinear Matrix Decomposition with the ReLU function. IEEE International Workshop on Machine Learning for Signal Processing. doi:10.1109/MLSP55844.2023.10285984
Peer reviewed

Kolomvakis, C., Vandaele, A., & Gillis, N. (2023). Algorithms for Boolean Matrix Factorization using Integer Programming. IEEE International Workshop on Machine Learning for Signal Processing. doi:10.1109/MLSP55844.2023.10285969
Peer reviewed

Dache, A., Nicolas Nadisic, Vandaele, A., & Gillis, N. (2023). Exact and Heuristic Methods for Simultaneous Sparse Coding. European Signal Processing Conference. doi:10.23919/EUSIPCO58844.2023.10289845
Peer reviewed

Nadisic, N., Cohen, J. E., Vandaele, A., & Gillis, N. (10 October 2022). Matrix-wise ℓ0-constrained Sparse Nonnegative Least Squares. Machine Learning, 111, 4453-4495. doi:10.1007/s10994-022-06260-2
Peer Reviewed verified by ORBi

Nadisic, N., Vandaele, A., Gillis, N., & Cohen, J. E. (2021). Exact biobjective k-sparse nonnegative least squares. European Signal Processing Conference. doi:10.23919/EUSIPCO54536.2021.9616202
Peer reviewed

Ang, M. S., Gillis, N., Vandaele, A., & De Sterck, H. (2021). Nonnegative Unimodal Matrix Factorization. IEEE International Conference on Acoustics, Speech and Signal Processing. Proceedings. doi:10.1109/ICASSP39728.2021.9414631
Peer reviewed

Moutier, F., Vandaele, A., & Gillis, N. (19 January 2021). Off-diagonal symmetric nonnegative matrix factorization. Numerical Algorithms, 88, 939-963. doi:10.1007/s11075-020-01063-9
Peer Reviewed verified by ORBi

Nadisic, N., Vandaele, A., Cohen, J. E., & Gillis, N. (2020). Sparse Separable Nonnegative Matrix Factorization. European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases. doi:10.1007/978-3-030-67658-2_20
Peer reviewed

De Handschutter, P., Gillis, N., Vandaele, A., & Siebert, X. (01 March 2020). Near-Convex Archetypal Analysis. IEEE Signal Processing Letters, 27 (1), 81-85.
Peer Reviewed verified by ORBi

Nadisic, N., Vandaele, A., Gillis, N., & Cohen, J. E. (2020). Exact Sparse Nonnegative Least Squares. IEEE International Conference on Acoustics, Speech and Signal Processing. Proceedings.
Peer reviewed

Vandaele, A. (10 July 2018). One-dimensional cutting stock instances for which few patterns are needed [Paper presentation]. EURO2018 - 29th European Conference on Operational Research, Valence, Spain.

Vandaele, A. (06 July 2018). One-dimensional cutting stock instances for which few patterns are needed [Paper presentation]. 23rd International Symposium on Mathematical Programming, Bordeaux, France.

Vandaele, A., Glineur, F., & Gillis, N. (21 March 2018). Algorithms for positive semidefinite factorization. Computational Optimization and Applications, 71 (1), 193-219.
Peer Reviewed verified by ORBi

Vandaele, A., Gillis, N., & Glineur, F. (15 May 2017). On the Linear Extension Complexity of Regular n-gons. Linear Algebra and its Applications, 521, 217-239.
Peer Reviewed verified by ORBi

Vandaele, A., Gillis, N., Lei, Q., Zhong, K., & Dhillon, I. (01 November 2016). Efficient and Non-Convex Coordinate Descent for Symmetric Nonnegative Matrix Factorization. IEEE Transactions on Signal Processing, 64 (21), 5571-5584.
Peer Reviewed verified by ORBi

Vandaele, A. (12 September 2016). Algorithms for Nonnegative Matrix Factorization and PSD Factorization with Applications to Extended Formulations [Paper presentation]. 4th European Conference on Computational Optimization, Leuven, Belgium.

Vandaele, A. (08 September 2016). Algorithms for Nonnegative Matrix Factorization and PSD Factorization with Applications to Extended Formulations [Paper presentation]. 5th IMA Conference on Numerical Linear Algebra and Optimization, Birmingham, Unknown/unspecified.

Vandaele, A. (11 July 2016). Exact NMF and Compact Extensions of N-Gons [Paper presentation]. SIAM Annual Meeting, Boston, United States - Massachusetts.

Vandaele, A., & Tuyttens, D. (2016). On the computational complexity of the Cover Printing Problem [Paper presentation]. 28th European Conference on Operational Research, Poznan, Poland.

Vandaele, A., Gillis, N., Glineur, F., & Tuyttens, D. (01 June 2016). Heuristics for exact nonnegative matrix factorization. Journal of Global Optimization, 65 (2), 369-400.
Peer Reviewed verified by ORBi

Vandaele, A. (29 January 2016). Coordinate Descent Methods for Positive Semidefinite Factorization [Paper presentation]. Orbel 30, UCLouvain - CORE, Belgium.

Vandaele, A., & Tuyttens, D. (2015). A Random-Key Genetic Algorithm for Printing Problems [Paper presentation]. EURO 2015 - 27th European Conference on Operational Research, Glasgow, United Kingdom.

Vandaele, A. (09 June 2015). Heuristics for Exact Nonnegative Matrix Factorization [Poster presentation]. HCM Workshop in low-rank approximation, University of Bonn, Germany.

Vandaele, A. (2015). Positive semidefinite factorizations of nonnegative matrices [Paper presentation]. 29th Conference of the Belgian Operational Research Society (ORBEL 29), University of Antwerp, Belgium.

Tuyttens, D., & Vandaele, A. (02 November 2014). Towards an efficient resolution of printing problems. Discrete Optimization, 14, 126-146.
Peer Reviewed verified by ORBi

Vandaele, A., & Tuyttens, D. (2014). Exact resolution of the Cover Printing problem with a branch and bound algorithm [Paper presentation]. IFORS-2014 20th Conference of the International Federetaion of Operationel Research, Barcelone, Spain.

Vandaele, A. (23 June 2014). A refined rectangle covering number as lower bound for extended formulations [Poster presentation]. The 17th Conference on Integer Programming and Combinatorial Optimization, Bonn, Germany.

Vandaele, A., & Tuyttens, D. (2014). Exact resolution of the Cover printing problem [Paper presentation]. ORBEL 28, UMONS, Mons, Belgium.

Mezmaz, M., Vandaele, A., Tuyttens, D., Itani, S., & Melab, N. (2014). Towards a Lightning Inspired Meta-Heuristic [Paper presentation]. ORBEL 28, UMONS, Mons, Belgium.

Vandaele, A., Tuyttens, D., Dhouib, E., & Teghem, J. (2013). A new Branch-and-Bound algorithm for solving bi-objective permutation flowshop problems with time lags [Paper presentation]. 26th European Conference on Operational Research , EURO/INFORMS MMXIII, Rome, Italy.

Vandaele, A., & Tuyttens, D. (2013). A branch and bound algorithm for a lexicographic optimization of a bi-objective permutation flowshop with time lags [Paper presentation]. ORBEL 27, Kortrijk, Belgium.

Vandaele, A. (2012). Linear least squares with different types of constraints: effectiveness of methods [Paper presentation]. Congrès EURO XXV, Vilnius, Lithuania.

Vandaele, A. (06 July 2012). NNLS Methods Applied to the Non-Negative Matrix Factorization Problem [Paper presentation]. 10th EUROPT Workshop, Siauliai, Lithuania.

Vandaele, A. (01 March 2012). Linear Least Squares with different types of constraints [Paper presentation]. Mathematical Programming Seminar, La Roche-en-Ardenne, Belgium.

Vandaele, A., & Tuyttens, D. (22 March 2011). Extending a GRASP technique from printing problems to the cutting stock problem [Poster presentation]. 6ème édition de la Matinée des Chercheurs (MDC 2011), Mons, Belgium.

Vandaele, A., & Tuyttens, D. (2011). Extending a GRASP technique from printing problems to the cutting stock problem [Paper presentation]. ORBEL 25, Gand, Belgium.

Tuyttens, D., & Vandaele, A. (2010). A grasp algorithm to solve the label printing problem [Paper presentation]. Congrès EURO XXIV Lisbonne, Portugal, Portugal.

Tuyttens, D., & Vandaele, A. (01 April 2010). Using a greedy random adaptative search procedure to solve the cover printing problem. Computers and Operations Research, 37 (4), 640-648. doi:10.1016/j.cor.2009.06.006
Peer Reviewed verified by ORBi

Tuyttens, D., & Vandaele, A. (2009). Using a greedy random adaptative search procedure to solve the cover printing problem [Paper presentation]. EURO XXIII, European operations research association, Bonn, Germany.

Tuyttens, D., & Vandaele, A. (2009). Using a greedy random adaptative search procedure to solve the cover printing problem [Paper presentation]. Conférence ORBEL 23, Leuven, Belgium.

Contact ORBi UMONS