Jellyfish

swMATH12431MaRDI QIDQ24359FDOQ24359

Author name not available (Why is that?)

Cited In (34)

• Enabling numerically exact local solver for waveform inversion -- a low-rank approach
• Analysis of multiview legislative networks with structured matrix factorization: does Twitter influence translate to the real world?
• Robust principal component analysis using facial reduction
• Inexact coordinate descent: complexity and preconditioning
• Low-rank matrix completion via preconditioned optimization on the Grassmann manifold
• On the rates of convergence of parallelized averaged stochastic gradient algorithms
• 1-bit matrix completion: PAC-Bayesian analysis of a variational approximation
• Conditional gradient algorithms for norm-regularized smooth convex optimization
• Distributed matrix completion and robust factorization
• Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
• On the efficiency of random permutation for ADMM and coordinate descent
• A Continuous-Time Analysis of Distributed Stochastic Gradient
• Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries
• Linear feature transform and enhancement of classification on deep neural network
• A Bayesian approach for noisy matrix completion: optimal rate under general sampling distribution
• Spectral gap in random bipartite biregular graphs and applications
• Parallel stochastic gradient algorithms for large-scale matrix completion
• Decentralized and privacy-preserving low-rank matrix completion
• Block stochastic gradient iteration for convex and nonconvex optimization
• Optimization landscape of Tucker decomposition
• Multilevel stochastic gradient methods for nested composition optimization
• Why random reshuffling beats stochastic gradient descent
• Approximate matrix completion based on cavity method
• The alternating descent conditional gradient method for sparse inverse problems
• Orthogonal rank-one matrix pursuit for low rank matrix completion
• Convergence rate of incremental gradient and incremental Newton methods
• A Riemannian gossip approach to subspace learning on Grassmann manifold
• Matrix recipes for hard thresholding methods
• Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
• T-product factorization based method for matrix and tensor completion problems
• Rank determination for low-rank data completion
• Fast methods for denoising matrix completion formulations, with applications to robust seismic data interpolation
• Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version
• Probabilistic low-rank matrix completion from quantized measurements

This page was built for software: Jellyfish