LMaFit

swMATH12221MaRDI QIDQ24152FDOQ24152

Author name not available (Why is that?)

Official website: http://lmafit.blogs.rice.edu/

Cited In (93)

• Linear embedding by joint robust discriminant analysis and inter-class sparsity
• The dual step size of the alternating direction method can be larger than 1.618 when one function is strongly convex
• An alternating direction method with continuation for nonconvex low rank minimization
• Normalized iterative hard thresholding for matrix completion
• Low-rank optimization with trace norm penalty
• A hybrid algorithm for the two-trust-region subproblem
• Robust PCA and subspace tracking from incomplete observations using \(\ell _0\)-surrogates
• An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems
• Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
• Guarantees of Riemannian optimization for low rank matrix recovery
• An alternating direction algorithm for matrix completion with nonnegative factors
• Toeplitz matrix completion via a low-rank approximation algorithm
• The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion
• Low-rank and sparse matrices fitting algorithm for low-rank representation
• Multi-stage convex relaxation method for low-rank and sparse matrix separation problem
• Robust bilinear factorization with missing and grossly corrupted observations
• Robust low-rank kernel multi-view subspace clustering based on the Schatten \(p\)-norm and correntropy
• RASL
• Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization
• A nonmonotone alternating updating method for a class of matrix factorization problems
• An alternating minimization method for robust principal component analysis
• Fast singular value thresholding without singular value decomposition
• Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
• Global convergence of ADMM in nonconvex nonsmooth optimization
• On the convergence rate of the augmented Lagrangian-based parallel splitting method
• Parallel stochastic gradient algorithms for large-scale matrix completion
• Matrix completion and related problems via strong duality
• Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Fixed-rank matrix factorizations and Riemannian low-rank optimization
• A reweighted nuclear norm minimization algorithm for low rank matrix recovery
• A fast tri-factorization method for low-rank matrix recovery and completion
• An efficient matrix factorization based low-rank representation for subspace clustering
• An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion
• Matrix completion discriminant analysis
• na28
• FTVd
• RecPF
• Eigentaste
• softImpute
• Jellyfish
• Optspace
• An alternating augmented Lagrangian method for constrained nonconvex optimization
• GenRTR
• rsvd
• BADMM
• RTRMC
• upclass
• Pyglrm
• ADMiRA
• Low rank matrix completion by alternating steepest descent methods
• A patch-based low-rank tensor approximation model for multiframe image denoising
• RobRSVD
• Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data
• Applications of gauge duality in robust principal component analysis and semidefinite programming
• ROML: a robust feature correspondence approach for matching objects in a set of images
• Low-rank matrix completion by Riemannian optimization
• Robust locally linear analysis with applications to image denoising and blind inpainting
• Algorithm for overcoming the curse of dimensionality for time-dependent non-convex Hamilton-Jacobi equations arising from optimal control and differential games problems
• Revisiting the redistancing problem using the Hopf-Lax formula
• Matrix recipes for hard thresholding methods
• An approximation theory of matrix rank minimization and its application to quadratic equations
• Robust principal component pursuit via inexact alternating minimization on matrix manifolds
• An alternating minimization method for matrix completion problems
• Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit
• A proximal point algorithm for log-determinant optimization with group Lasso regularization
• Active subspace: toward scalable low-rank learning
• Robust PCA using nonconvex rank approximation and sparse regularizer
• Robust low-rank tensor recovery: models and algorithms
• Bregman reweighted alternating minimization and its application to image deblurring
• Structured low-rank approximation with missing data
• Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
• Approximation of rank function and its application to the nearest low-rank correlation matrix
• Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
• Seismic data reconstruction via matrix completion
• Data-driven attacks and data recovery with noise on state estimation of smart grid
• High-dimensional integrative analysis with homogeneity and sparsity recovery
• A fixed-point proximity algorithm for recovering low-rank components from incomplete observation data with application to motion capture data refinement
• Local linear convergence of an ADMM-type splitting framework for equality constrained optimization
• A faster generalized ADMM-based algorithm using a sequential updating scheme with relaxed step sizes for multiple-block linearly constrained separable convex programming
• Alternating direction method of multipliers for solving dictionary learning models
• A partial PPA block-wise ADMM for multi-block linearly constrained separable convex optimization
• Ontology sparse vector learning algorithm for ontology similarity measuring and ontology mapping via ADAL technology
• Adapting regularized low-rank models for parallel architectures
• Homotopy method for matrix rank minimization based on the matrix hard thresholding method
• Collaborative filtering with information-rich and~information-sparse entities
• Scalable low-rank representation
• Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property
• Unsupervised robust discriminative manifold embedding with self-expressiveness
• Dynamic behavior analysis via structured rank minimization
• A two-level distributed algorithm for nonconvex constrained optimization
• Guarantees of Riemannian optimization for low rank matrix completion
• Portfolio Optimization with Nonparametric Value at Risk: A Block Coordinate Descent Method

This page was built for software: LMaFit