The following pages link to Suvrit Sra (Q295976):
Displaying 37 items.
- A proof of Thompson's determinantal inequality (Q295977) (← links)
- Hlawka-Popoviciu inequalities on positive definite tensors (Q498324) (← links)
- On inequalities for normalized Schur functions (Q499500) (← links)
- Inference and mixture modeling with the elliptical Gamma distribution (Q1659056) (← links)
- The sum of squared logarithms inequality in arbitrary dimensions (Q1789392) (← links)
- The multivariate Watson distribution: maximum-likelihood estimation and other aspects (Q1931867) (← links)
- Explicit eigenvalues of certain scaled trigonometric matrices (Q1932592) (← links)
- Fast projections onto mixed-norm balls with applications (Q1944995) (← links)
- Introducing discrepancy values of matrices with application to bounding norms of commutators (Q2158292) (← links)
- An alternative to EM for Gaussian mixture models: batch and stochastic Riemannian optimization (Q2188245) (← links)
- A short note on parameter approximation for von Mises-Fisher distributions: and a fast implementation of \(I_{s}(x)\) (Q2512779) (← links)
- Metrics induced by Jensen-Shannon and related divergences on positive definite matrices (Q2656633) (← links)
- Positive definite matrices and the S-divergence (Q2802101) (← links)
- A non-monotonic method for large-scale non-negative least squares (Q2867422) (← links)
- Geometric Optimization in Machine Learning (Q2954275) (← links)
- Positive Definite Matrices: Data Representation and Applications to Computer Vision (Q2954277) (← links)
- On the Matrix Square Root via Geometric Optimization (Q3186698) (← links)
- Recent Advances in Stochastic Riemannian Optimization (Q3300553) (← links)
- (Q3546376) (← links)
- The Metric Nearness Problem (Q3609032) (← links)
- Approximation Algorithms for Tensor Clustering (Q3648764) (← links)
- Efficient Nearest Neighbors via Robust Sparse Hashing (Q4592402) (← links)
- Modular proximal optimization for multidimensional total-variation regularization (Q4614088) (← links)
- Logarithmic inequalities under a symmetric polynomial dominance order (Q4644432) (← links)
- Fast Projection‐Based Methods for the Least Squares Nonnegative Matrix Approximation Problem (Q4969616) (← links)
- (Q5009519) (← links)
- Projection-free nonconvex stochastic optimization on Riemannian manifolds (Q5042891) (← links)
- New concavity and convexity results for symmetric polynomials and their ratios (Q5145554) (← links)
- Correlation matrix nearness and completion under observation uncertainty (Q5174190) (← links)
- Tackling Box-Constrained Optimization via a New Projected Quasi-Newton Approach (Q5200263) (← links)
- Conic Geometric Optimization on the Manifold of Positive Definite Matrices (Q5252529) (← links)
- Riemannian optimization via Frank-Wolfe methods (Q6038651) (← links)
- Sion’s Minimax Theorem in Geodesic Metric Spaces and a Riemannian Extragradient Algorithm (Q6060148) (← links)
- Functions with positive differences on convex cones (Q6136258) (← links)
- On Geodesically Convex Formulations for the Brascamp-Lieb Constant (Q6300225) (← links)
- Three Operator Splitting with a Nonconvex Loss Function (Q6362367) (← links)
- Efficient Sampling on Riemannian Manifolds via Langevin MCMC (Q6522038) (← links)
