Pages that link to "Item:Q3225532"
From MaRDI portal
The following pages link to Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard (Q3225532):
Displayed 24 items.
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem (Q337120) (← links)
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms (Q482289) (← links)
- Markov chain methods for the bipartite Boolean quadratic programming problem (Q1753461) (← links)
- Block tensor train decomposition for missing data estimation (Q1757240) (← links)
- An efficient method for non-negative low-rank completion (Q1986538) (← links)
- Convex low rank approximation (Q1991504) (← links)
- Low-rank matrix approximation in the infinity norm (Q2273885) (← links)
- A gradient system for low rank matrix completion (Q2305876) (← links)
- Low-rank tensor completion based on log-det rank approximation and matrix factorization (Q2330690) (← links)
- Low-rank matrix completion via preconditioned optimization on the Grassmann manifold (Q2347362) (← links)
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (Q2355744) (← links)
- Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs (Q2629716) (← links)
- Exact solutions in low-rank approximation with zeros (Q2669183) (← links)
- The bipartite Boolean quadric polytope (Q2673249) (← links)
- A global exact penalty for rank-constrained optimization problem and applications (Q2696914) (← links)
- Weighted norms in subspace-based methods for time series analysis (Q2955991) (← links)
- Color Image Inpainting via Robust Pure Quaternion Matrix Completion: Error Bound and Weighted Loss (Q5043739) (← links)
- The Bipartite QUBO (Q5050150) (← links)
- Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking (Q5139848) (← links)
- On the Complexity of Robust PCA and <i>ℓ</i><sub>1</sub>-Norm Low-Rank Matrix Approximation (Q5219689) (← links)
- Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy (Q6038660) (← links)
- An Apocalypse-Free First-Order Low-Rank Optimization Algorithm with at Most One Rank Reduction Attempt per Iteration (Q6053418) (← links)
- Spurious Valleys, NP-Hardness, and Tractability of Sparse Matrix Factorization with Fixed Support (Q6101122) (← links)
- Normal Cones Intersection Rule and Optimality Analysis for Low-Rank Matrix Optimization with Affine Manifolds (Q6116233) (← links)