Arnaud Vandaele

Orcid: 0000-0001-8181-3043

According to our database1, Arnaud Vandaele authored at least 18 papers between 2010 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Accelerated Algorithms For Nonlinear Matrix Decomposition With The Relu Function.
Proceedings of the 33rd IEEE International Workshop on Machine Learning for Signal Processing, 2023

Algorithms for Boolean Matrix Factorization using Integer Programming.
Proceedings of the 33rd IEEE International Workshop on Machine Learning for Signal Processing, 2023

Exact and Heuristic Methods for Simultaneous Sparse Coding.
Proceedings of the 31st European Signal Processing Conference, 2023

2022
Matrix-wise ℓ <sub>0</sub>-constrained sparse nonnegative least squares.
Mach. Learn., 2022

2021
Off-diagonal symmetric nonnegative matrix factorization.
Numer. Algorithms, 2021

Nonnegative Unimodal Matrix Factorization.
Proceedings of the IEEE International Conference on Acoustics, 2021

Exact Biobjective k-Sparse Nonnegative Least Squares.
Proceedings of the 29th European Signal Processing Conference, 2021

2020
Near-Convex Archetypal Analysis.
IEEE Signal Process. Lett., 2020

A Homotopy-based Algorithm for Sparse Multiple Right-hand Sides Nonnegative Least Squares.
CoRR, 2020

Sparse Separable Nonnegative Matrix Factorization.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2020

Exact Sparse Nonnegative Least Squares.
Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

2018
Algorithms for positive semidefinite factorization.
Comput. Optim. Appl., 2018

2016
Efficient and Non-Convex Coordinate Descent for Symmetric Nonnegative Matrix Factorization.
IEEE Trans. Signal Process., 2016

Heuristics for exact nonnegative matrix factorization.
J. Glob. Optim., 2016

2015
Coordinate Descent Methods for Symmetric Nonnegative Matrix Factorization.
CoRR, 2015

On the Linear Extension Complexity of Regular n-gons.
CoRR, 2015

2014
Towards an efficient resolution of printing problems.
Discret. Optim., 2014

2010
Using a greedy random adaptative search procedure to solve the cover printing problem.
Comput. Oper. Res., 2010


  Loading...