Arnaud Vandaele

From MaRDI portal
(Redirected from Arnaud Vandaele)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization
(available as arXiv preprint)
2026-01-01Paper
The ReLU Matrix Decomposition: NP-Hardness, Ill-Posedness, and ReLU-Rank
(available as arXiv preprint)
2026-01-01Paper
Matrix-wise _0-constrained sparse nonnegative least squares
Machine Learning
2023-06-12Paper
Off-diagonal symmetric nonnegative matrix factorization
Numerical Algorithms
2021-09-27Paper
Efficient and Non-Convex Coordinate Descent for Symmetric Nonnegative Matrix Factorization
IEEE Transactions on Signal Processing
2019-02-08Paper
Algorithms for positive semidefinite factorization
Computational Optimization and Applications
2018-10-02Paper
On the linear extension complexity of regular n-gons
Linear Algebra and its Applications
2017-03-03Paper
Heuristics for exact nonnegative matrix factorization
Journal of Global Optimization
2016-05-25Paper
Towards an efficient resolution of printing problems
Discrete Optimization
2015-04-09Paper
Computing The Extension Complexities of All 4-Dimensional 0/1-Polytopes2014-06-18Paper
Computing The Extension Complexities of All 4-Dimensional 0/1-Polytopes
(available as arXiv preprint)
2014-01-01Paper
Using a greedy random adaptative search procedure to solve the cover printing problem
Computers & Operations Research
2009-11-27Paper


Research outcomes over time


This page was built for person: Arnaud Vandaele