PROPACK

swMATH4019MaRDI QIDQ16208FDOQ16208

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• The joint bidiagonalization process with partial reorthogonalization
• An alternating direction method with continuation for nonconvex low rank minimization
• Spectral Compressed Sensing via Projected Gradient Descent
• Normalized iterative hard thresholding for matrix completion
• Median filtering‐based methods for static background extraction from surveillance video
• Iterative representing set selection for nested cross approximation
• An implementable proximal point algorithmic framework for nuclear norm minimization
• Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
• A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA
• Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
• Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
• Flexible low-rank statistical modeling with missing data and side information
• Spectral regularization algorithms for learning large incomplete matrices
• A fast symmetric SVD algorithm for square Hankel matrices
• Low-rank spectral optimization via gauge duality
• LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
• The minimum-rank gram matrix completion via modified fixed point continuation method
• A Lanczos-like reduction of symmetric structured matrices to semiseparable form
• A NEW MODEL FOR SPARSE AND LOW-RANK MATRIX DECOMPOSITION
• A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices
• Fast singular value thresholding without singular value decomposition
• A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices
• Krylov Methods for Low-Rank Regularization
• Minimum \( n\)-rank approximation via iterative hard thresholding
• Computing the smallest singular triplets of a large matrix
• Matrix completion via minimizing an approximate rank
• Recovery of low rank symmetric matrices via Schatten \(p\) norm minimization
• Approximating the leading singular triplets of a large matrix function
• Convergence of fixed-point continuation algorithms for matrix rank minimization
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Computing real solutions of polynomial systems via low-rank moment matrix completion
• Optimally linearizing the alternating direction method of multipliers for convex programming
• Fast Cadzow's algorithm and a gradient variant
• A Refined Harmonic Lanczos Bidiagonalization Method and an Implicitly Restarted Algorithm for Computing the Smallest Singular Triplets of Large Matrices
• An iterative algorithm for third-order tensor multi-rank minimization
• A robust and efficient parallel SVD solver based on restarted Lanczos bidiagonalization
• Scalable robust matrix recovery: Frank-Wolfe meets proximal methods
• Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
• Fixed-rank matrix factorizations and Riemannian low-rank optimization
• An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion
• Recovering low-rank matrices from corrupted observations via the linear conjugate gradient algorithm
• Matrix completion and low-rank SVD via fast alternating least squares
• PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations
• A Hybrid LSMR Algorithm for Large-Scale Tikhonov Regularization
• A partially isochronous splitting algorithm for three-block separable convex minimization problems
• Lanczos method for large-scale quaternion singular value decomposition
• An Efficient Iterative Approach for Large-Scale Separable Nonlinear Inverse Problems
• Subspace methods for computing the pseudospectral abscissa and the stability radius
• Projected Landweber iteration for matrix completion
• Fast ESPRIT algorithms based on partial singular value decompositions
• An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
• ADMiRA: Atomic Decomposition for Minimum Rank Approximation
• A Proximal Point Algorithm for Sequential Feature Extraction Applications
• Numerical Methods for Electronic Structure Calculations of Materials
• Efficient algorithms for robust and stable principal component pursuit problems
• A unified approach for minimizing composite norms
• Accelerating large partial EVD/SVD calculations by filtered block Davidson methods
• Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
• A Filtered Lanczos Procedure for Extreme and Interior Eigenvalue Problems
• Using negative curvature in solving nonlinear programs
• SVD based initialization: A head start for nonnegative matrix factorization
• Low-Rank Optimization with Trace Norm Penalty
• Literature survey on low rank approximation of matrices
• An alternating direction method with increasing penalty for stable principal component pursuit
• Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
• Randomized LU decomposition
• Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data
• Matrix recipes for hard thresholding methods
• On the convergence of Krylov methods with low-rank truncations
• Robust principal component pursuit via inexact alternating minimization on matrix manifolds
• An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
• Matrix completion with nonconvex regularization: spectral operators and scalable algorithms
• Computing interior eigenvalues of large sparse symmetric matrices
• An augmented LSQR method
• Hierarchical Community Detection by Recursive Partitioning
• Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably
• A distributed Douglas-Rachford splitting method for multi-block convex minimization problems
• Templates for convex cone problems with applications to sparse signal recovery
• An Efficient Gauss--Newton Algorithm for Symmetric Low-Rank Product Matrix Approximations
• A preconditioned GMRES for complex dense linear systems from electromagnetic wave scattering problems
• Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
• An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
• On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective
• An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets
• Randomized core reduction for discrete ill-posed problem
• Spectral Computed Tomography with Linearization and Preconditioning
• Cobra: Parallel path following for computing the matrix pseudospectrum
• Computing the Kreiss Constant of a Matrix
• A DEIM induced CUR factorization
• Adaptive nonnegative matrix factorization and measure comparisons for recommender systems
• Parallel Prony's Method with Multivariate Matrix Pencil Approach and Its Numerical Aspects
• Computational Materials Science and Engineering
• Lanczos and the Riemannian SVD in information retrieval applications
• Proximal linearization methods for Schatten \(p\)-quasi-norm minimization
• Accelerating patch-based low-rank image restoration using kd-forest and Lanczos approximation
• WARPd: A Linearly Convergent First-Order Primal-Dual Algorithm for Inverse Problems with Approximate Sharpness Conditions
• On obtaining sparse semantic solutions for inverse problems, control, and neural network training
• Incremental CP Tensor Decomposition by Alternating Minimization Method
• Data clustering with quantum mechanics
• An efficient, memory-saving approach for the Loewner framework

This page was built for software: PROPACK