PROPACK

swMATH4019MaRDI QIDQ16208

No author found.

Related Items (only showing first 100 items - show all)

Data clustering with quantum mechanics ⋮ The joint bidiagonalization process with partial reorthogonalization ⋮ 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 ⋮ A Self-Learning Algebraic Multigrid Method for Extremal Singular Triplets and Eigenpairs ⋮ A Filtered Lanczos Procedure for Extreme and Interior Eigenvalue Problems ⋮ On obtaining sparse semantic solutions for inverse problems, control, and neural network training ⋮ A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices ⋮ A robust and efficient parallel SVD solver based on restarted Lanczos bidiagonalization ⋮ Minimum \( n\)-rank approximation via iterative hard thresholding ⋮ A Hybrid LSMR Algorithm for Large-Scale Tikhonov Regularization ⋮ An implicitly restarted block Lanczos bidiagonalization method using Leja shifts ⋮ An efficient, memory-saving approach for the Loewner framework ⋮ Unnamed Item ⋮ An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing ⋮ Accelerating large partial EVD/SVD calculations by filtered block Davidson methods ⋮ A partially isochronous splitting algorithm for three-block separable convex minimization problems ⋮ An augmented LSQR method ⋮ On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective ⋮ Proximal linearization methods for Schatten \(p\)-quasi-norm minimization ⋮ Hybrid iterative refined restarted Lanczos bidiagonalization methods ⋮ Randomized LU decomposition ⋮ Landmark diffusion maps (L-dMaps): accelerated manifold learning out-of-sample extension ⋮ Computation of the maximum likelihood estimator in low-rank factor analysis ⋮ Using negative curvature in solving nonlinear programs ⋮ Matrix completion with nonconvex regularization: spectral operators and scalable algorithms ⋮ A new shift strategy for the implicitly restarted refined harmonic Lanczos method ⋮ Literature survey on low rank approximation of matrices ⋮ Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm ⋮ An implementable proximal point algorithmic framework for nuclear norm minimization ⋮ Matrix completion for matrices with low-rank displacement ⋮ A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices ⋮ Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition ⋮ Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data ⋮ Computing the smallest singular triplets of a large matrix ⋮ A deterministic-stochastic method for computing the Boltzmann collision integral in \(\mathcal{O}(MN)\) operations ⋮ An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion ⋮ Efficient algorithms for robust and stable principal component pursuit problems ⋮ A unified approach for minimizing composite norms ⋮ Fast ESPRIT algorithms based on partial singular value decompositions ⋮ Computational Materials Science and Engineering ⋮ Krylov Methods for Low-Rank Regularization ⋮ An alternating direction method with increasing penalty for stable principal component pursuit ⋮ On the convergence of Krylov methods with low-rank truncations ⋮ A NEW MODEL FOR SPARSE AND LOW-RANK MATRIX DECOMPOSITION ⋮ Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations ⋮ A fast symmetric SVD algorithm for square Hankel matrices ⋮ SVD based initialization: A head start for nonnegative matrix factorization ⋮ Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion ⋮ Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization ⋮ Matrix recipes for hard thresholding methods ⋮ A Proximal Point Algorithm for Sequential Feature Extraction Applications ⋮ Convergence of fixed-point continuation algorithms for matrix rank minimization ⋮ Templates for convex cone problems with applications to sparse signal recovery ⋮ Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares ⋮ Fixed-rank matrix factorizations and Riemannian low-rank optimization ⋮ Adaptive nonnegative matrix factorization and measure comparisons for recommender systems ⋮ Projected Landweber iteration for matrix completion ⋮ A preconditioned GMRES for complex dense linear systems from electromagnetic wave scattering problems ⋮ Numerical Methods for Electronic Structure Calculations of Materials ⋮ Lanczos method for large-scale quaternion singular value decomposition ⋮ Lanczos and the Riemannian SVD in information retrieval applications ⋮ Large-Scale Inverse Problems in Imaging ⋮ A Lanczos-like reduction of symmetric structured matrices to semiseparable form ⋮ Spectral Compressed Sensing via Projected Gradient Descent ⋮ An Efficient Iterative Approach for Large-Scale Separable Nonlinear Inverse Problems ⋮ An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets ⋮ Fast singular value thresholding without singular value decomposition ⋮ Approximating the leading singular triplets of a large matrix function ⋮ Recovery of Low Rank Symmetric Matrices via Schatten p Norm Minimization ⋮ Robust principal component pursuit via inexact alternating minimization on matrix manifolds ⋮ Flexible low-rank statistical modeling with missing data and side information ⋮ A cross-product approach for low-rank approximations of large matrices ⋮ A DEIM Induced CUR Factorization ⋮ Unnamed Item ⋮ An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition ⋮ Low-Rank Spectral Optimization via Gauge Duality ⋮ 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 ⋮ Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition ⋮ Provable accelerated gradient method for nonconvex low rank optimization ⋮ Randomized core reduction for discrete ill-posed problem ⋮ Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably ⋮ A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices ⋮ Scalable Robust Matrix Recovery: Frank--Wolfe Meets Proximal Methods ⋮ Parallel Prony's Method with Multivariate Matrix Pencil Approach and Its Numerical Aspects ⋮ Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization ⋮ Matrix completion via minimizing an approximate rank ⋮ Spectral Computed Tomography with Linearization and Preconditioning ⋮ Computing real solutions of polynomial systems via low-rank moment matrix completion ⋮ Incremental CP Tensor Decomposition by Alternating Minimization Method ⋮ LSMR: An Iterative Algorithm for Sparse Least-Squares Problems ⋮ Improved Lagrangian-PPA based prediction correction method for linearly constrained convex optimization ⋮ Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems ⋮ Normalized Iterative Hard Thresholding for Matrix Completion ⋮ Recovering low-rank matrices from corrupted observations via the linear conjugate gradient algorithm ⋮ Computing interior eigenvalues of large sparse symmetric matrices ⋮ Subspace Methods for Computing the Pseudospectral Abscissa and the Stability Radius ⋮ An alternating direction method with continuation for nonconvex low rank minimization

This page was built for software: PROPACK