The following pages link to Nicolas Gillis (Q288237):
Displaying 50 items.
- Heuristics for exact nonnegative matrix factorization (Q288239) (← links)
- Sparse nonnegative matrix underapproximation and its application to hyperspectral image analysis (Q389667) (← links)
- On the linear extension complexity of regular \(n\)-gons (Q513256) (← links)
- A continuous characterization of the maximum-edge biclique problem (Q742133) (← links)
- Off-diagonal symmetric nonnegative matrix factorization (Q820738) (← links)
- Optimizing over the properly efficient set of convex multi-objective optimization problems (Q828826) (← links)
- Using underapproximations for sparse nonnegative matrix factorization (Q962750) (← links)
- On computing the distance to stability for matrices using linear dissipative Hamiltonian systems (Q1679841) (← links)
- UTA-poly and UTA-splines: additive value functions with polynomial marginals (Q1681484) (← links)
- A semi-analytical approach for the positive semidefinite Procrustes problem (Q1688909) (← links)
- Multiplicative updates for polynomial root finding (Q1705644) (← links)
- On the geometric interpretation of the nonnegative rank (Q1758469) (← links)
- Algorithms for positive semidefinite factorization (Q1790680) (← links)
- A geometric lower bound on the extension complexity of polytopes based on the \(f\)-vector (Q1983109) (← links)
- A note on approximating the nearest stable discrete-time descriptor systems with fixed rank (Q2010262) (← links)
- Minimal-norm static feedbacks using dissipative Hamiltonian matrices (Q2029851) (← links)
- Algorithms for nonnegative matrix factorization with the Kullback-Leibler divergence (Q2031873) (← links)
- On a minimum enclosing ball of a collection of linear subspaces (Q2032259) (← links)
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization (Q2044495) (← links)
- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization (Q2046565) (← links)
- On the non-symmetric semidefinite Procrustes problem (Q2144240) (← links)
- Inertial alternating direction method of multipliers for non-convex non-smooth optimization (Q2162531) (← links)
- Low-rank matrix approximation in the infinity norm (Q2273885) (← links)
- Orthogonal joint sparse NMF for microarray data analysis (Q2311900) (← links)
- Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation (Q2401518) (← links)
- Approximating the nearest stable discrete-time system (Q2419035) (← links)
- A multilevel approach for nonnegative matrix factorization (Q2428091) (← links)
- A survey on deep matrix factorizations (Q2668399) (← links)
- Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms (Q2668410) (← links)
- Robustness analysis of Hottopixx, a linear programming model for factoring nonnegative matrices (Q2866231) (← links)
- Successive nonnegative projection algorithm for robust nonnegative blind source separation (Q2876848) (← links)
- Robust Near-Separable Nonnegative Matrix Factorization Using Linear Optimization (Q2934034) (← links)
- Enhancing Pure-Pixel Identification Performance via Preconditioning (Q3192648) (← links)
- Exact and Heuristic Algorithms for Semi-Nonnegative Matrix Factorization (Q3195441) (← links)
- Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard (Q3225532) (← links)
- On approximating the nearest Ω‐stable matrix (Q3297082) (← links)
- Accelerating Nonnegative Matrix Factorization Algorithms Using Extrapolation (Q3379602) (← links)
- Computing the nearest stable matrix pairs (Q4558702) (← links)
- A Fast Gradient Method for Nonnegative Sparse Regression With Self-Dictionary (Q4616947) (← links)
- Efficient and Non-Convex Coordinate Descent for Symmetric Nonnegative Matrix Factorization (Q4621012) (← links)
- Dictionary-Based Tensor Canonical Polyadic Decomposition (Q4621704) (← links)
- Finding the Nearest Positive-Real System (Q4637764) (← links)
- Multiplicative Updates for NMF with $\beta$-Divergences under Disjoint Equality Constraints (Q4994438) (← links)
- Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms (Q4999395) (← links)
- Provably Robust Blind Source Separation of Linear-Quadratic Near-Separable Mixtures (Q5024389) (← links)
- Identifiability of Complete Dictionary Learning (Q5025788) (← links)
- Accelerating block coordinate descent for nonnegative tensor factorization (Q5033190) (← links)
- Characterization of the dissipative mappings and their application to perturbations of dissipative‐Hamiltonian systems (Q5033215) (← links)
- Block Bregman Majorization Minimization with Extrapolation (Q5037560) (← links)
- A Provably Correct and Robust Algorithm for Convolutive Nonnegative Matrix Factorization (Q5102789) (← links)
