Pages that link to "Item:Q742133"
From MaRDI portal
The following pages link to A continuous characterization of the maximum-edge biclique problem (Q742133):
Displaying 13 items.
- Global convergence of modified multiplicative updates for nonnegative matrix factorization (Q461447) (← links)
- A continuous characterization of the maximum-edge biclique problem (Q742133) (← links)
- Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables (Q1628128) (← links)
- A unified global convergence analysis of multiplicative update rules for nonnegative matrix factorization (Q1790683) (← links)
- An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices (Q2238337) (← links)
- Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation (Q2401518) (← links)
- Descent Methods for Nonnegative Matrix Factorization (Q2913167) (← links)
- Exact and Heuristic Algorithms for Semi-Nonnegative Matrix Factorization (Q3195441) (← links)
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs (Q4632202) (← links)
- (Q4691855) (← links)
- Rethinking arithmetic for deep neural networks (Q4993501) (← links)
- The Bipartite QUBO (Q5050150) (← links)
- Accelerated SVD-based initialization for nonnegative matrix factorization (Q6616157) (← links)