The following pages link to Inderjit S. Dhillon (Q169574):
Displaying 42 items.
- On the existence of equiangular tight frames (Q996316) (← links)
- Semi-supervised graph clustering: a kernel approach (Q1009309) (← links)
- Current inverse iteration software can fail (Q1279696) (← links)
- Fernando's solution to Wilkinson's problem: An application of double factorization (Q1373322) (← links)
- Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices (Q1434380) (← links)
- (Q1855435) (redirect page) (← links)
- Inner deflation for symmetric tridiagonal matrices (Q1855436) (← links)
- Class visualization of high-dimensional data with applications. (Q1874121) (← links)
- Relatively robust representations of symmetric tridiagonals (Q1976913) (← links)
- Clustered matrix approximation (Q2834689) (← links)
- Efficient Matrix Sensing Using Rank-1 Gaussian Measurements (Q2835614) (← links)
- A non-monotonic method for large-scale non-negative least squares (Q2867422) (← links)
- Low-rank kernel learning with Bregman matrix divergences (Q2880885) (← links)
- (Q2934029) (← links)
- (Q2934102) (← links)
- (Q3174147) (← links)
- Matrix Nearness Problems with Bregman Divergences (Q3537440) (← links)
- Constructing Packings in Grassmannian Manifolds via Alternating Projection (Q3546249) (← links)
- (Q3546376) (← links)
- (Q3546377) (← links)
- Finite-Step Algorithms for Constructing Optimal CDMA Signature Sequences (Q3547719) (← links)
- Designing structured tight frames via an alternating projection method (Q3547720) (← links)
- The design and implementation of the MRRR algorithm (Q3549194) (← links)
- The Metric Nearness Problem (Q3609032) (← links)
- Reliable Computation of the Condition Number of a Tridiagonal Matrix in <i>O</i>(<i>n</i>) Time (Q4389107) (← links)
- (Q4558475) (← links)
- (Q4614121) (← links)
- Efficient and Non-Convex Coordinate Descent for Symmetric Nonnegative Matrix Factorization (Q4621012) (← links)
- Orthogonal Eigenvectors and Relative Gaps (Q4650963) (← links)
- 10.1162/153244303322753661 (Q4827815) (← links)
- On a Zero-Finding Problem Involving the Matrix Exponential (Q4918164) (← links)
- Fast Projection‐Based Methods for the Least Squares Nonnegative Matrix Approximation Problem (Q4969616) (← links)
- Tackling Box-Constrained Optimization via a New Projected Quasi-Newton Approach (Q5200263) (← links)
- Generalized Finite Algorithms for Constructing Hermitian Matrices with Prescribed Diagonal and Spectrum (Q5317650) (← links)
- (Q5347969) (← links)
- (Q5361283) (← links)
- (Q5405129) (← links)
- Glued Matrices and the MRRR Algorithm (Q5470328) (← links)
- A Parallel Eigensolver for Dense Symmetric Matrices Based on Multiple Relatively Robust Representations (Q5693186) (← links)
- Concept decompositions for large sparse text data using clustering (Q5928973) (← links)
- Approximate Newton Policy Gradient Algorithms (Q6074547) (← links)
- Accelerating Primal-Dual Methods for Regularized Markov Decision Processes (Q6202767) (← links)
