The following pages link to Tamara G. Kolda (Q2349122):
Displaying 44 items.
- Tensor Decompositions and Applications (Q91405) (← links)
- (Q1583332) (redirect page) (← links)
- Graph partitioning models for parallel computing (Q1583333) (← links)
- Numerical optimization for symmetric tensor decomposition (Q2349123) (← links)
- Asynchronous Parallel Pattern Search for Nonlinear Optimization (Q2719273) (← links)
- Orthogonal Tensor Decompositions (Q2784344) (← links)
- Optimizing an Empirical Scoring Function for Transmembrane Protein Structure Determination (Q2890442) (← links)
- A Scalable Generative Graph Model with Community Structure (Q2940027) (← links)
- Exploiting Symmetry in Tensors for High Performance: Multiplication with Symmetric Tensors (Q2940030) (← links)
- Counting Triangles in Massive Graphs with MapReduce (Q2940042) (← links)
- (Q3108691) (← links)
- Asynchronous parallel hybrid optimization combining DIRECT and GSS (Q3161143) (← links)
- Shifted Power Method for Computing Tensor Eigenpairs (Q3225530) (← links)
- An improved hyperbolic embedding algorithm (Q3388886) (← links)
- Newton-based optimization for Kullback–Leibler nonnegative tensor factorizations (Q3458827) (← links)
- Algorithm 856 (Q3549196) (← links)
- Algorithm 862 (Q3549202) (← links)
- Nonlinearly Constrained Optimization Using Heuristic Penalty Methods and Asynchronous Parallel Generating Set Search (Q3565158) (← links)
- Efficient MATLAB Computations with Sparse and Factored Tensors (Q3614817) (← links)
- BFGS with Update Skipping and Varying Memory (Q4229463) (← links)
- (Q4247215) (← links)
- (Q4435425) (← links)
- A Counterexample to the Possibility of an Extension of the Eckart--Young Low-Rank Approximation Theorem for the Orthogonal Rank Tensor Decomposition (Q4443771) (← links)
- (Q4464639) (← links)
- Partitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel Processing (Q4509819) (← links)
- A Practical Randomized CP Tensor Decomposition (Q4643335) (← links)
- On the Convergence of Asynchronous Parallel Pattern Search (Q4651977) (← links)
- On Tensors, Sparsity, and Nonnegative Factorizations (Q4918166) (← links)
- Wedge sampling for computing clustering coefficients and triangle counts on large graphs<sup>†</sup> (Q4969952) (← links)
- Faster Johnson–Lindenstrauss transforms via Kronecker products (Q5033281) (← links)
- Stochastic Gradients for Large-Scale Tensor Decomposition (Q5037555) (← links)
- Practical Leverage-Based Sampling for Low-Rank Tensor Decomposition (Q5099421) (← links)
- TuckerMPI (Q5132319) (← links)
- Estimating Higher-Order Moments Using Symmetric Tensor Decomposition (Q5146702) (← links)
- Generalized Canonical Polyadic Tensor Decomposition (Q5216247) (← links)
- Software for Sparse Tensor Decomposition on Emerging Computing Architectures (Q5230593) (← links)
- An Adaptive Shifted Power Method for Computing Generalized Tensor Eigenpairs (Q5246495) (← links)
- Asynchronous Parallel Generating Set Search for Linearly Constrained Optimization (Q5320691) (← links)
- An in-depth analysis of stochastic Kronecker graphs (Q5395712) (← links)
- Stationarity Results for Generating Set Search for Linearly Constrained Optimization (Q5426892) (← links)
- Revisiting Asynchronous Parallel Pattern Search for Nonlinear Optimization (Q5470210) (← links)
- A Parallel, Asynchronous Method for Derivative-Free Nonlinear Programs (Q5747822) (← links)
- Parallel Tensor Compression for Large-Scale Scientific Data (Q6511766) (← links)
- Scalable symmetric Tucker tensor decomposition (Q6623664) (← links)
