PROPACK

swMATH4019MaRDI QIDQ16208FDOQ16208

Author name not available (Why is that?)

Official website: http://sun.stanford.edu/~rmunk/PROPACK/

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

• On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective
• The joint bidiagonalization process with partial reorthogonalization
• A proximal point algorithm for sequential feature extraction applications
• Spectral Compressed Sensing via Projected Gradient Descent
• Normalized iterative hard thresholding for matrix completion
• Low-rank optimization with trace norm penalty
• An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets
• Randomized core reduction for discrete ill-posed problem
• A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA
• Spectral Computed Tomography with Linearization and Preconditioning
• Cobra: Parallel path following for computing the matrix pseudospectrum
• LORAKS
• A fast symmetric SVD algorithm for square Hankel matrices
• An efficient Gauss-Newton algorithm for symmetric low-rank product matrix approximations
• A DEIM induced CUR factorization
• Adaptive nonnegative matrix factorization and measure comparisons for recommender systems
• A hybrid LSMR algorithm for large-scale Tikhonov regularization
• Finding low-rank solutions via nonconvex matrix factorization, efficiently and provably
• A Lanczos-like reduction of symmetric structured matrices to semiseparable form
• Proximal linearization methods for Schatten \(p\)-quasi-norm minimization
• Fast singular value thresholding without singular value decomposition
• Accelerating patch-based low-rank image restoration using kd-forest and Lanczos approximation
• A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices
• Median filtering-based methods for static background extraction from surveillance video.
• Iterative representing set selection for nested cross approximation.
• On obtaining sparse semantic solutions for inverse problems, control, and neural network training
• Computing the smallest singular triplets of a large matrix
• Approximating the leading singular triplets of a large matrix function
• Data clustering with quantum mechanics
• An efficient, memory-saving approach for the Loewner framework
• Computing real solutions of polynomial systems via low-rank moment matrix completion
• Optimally linearizing the alternating direction method of multipliers for convex programming
• Provable accelerated gradient method for nonconvex low rank optimization
• Fast Cadzow's algorithm and a gradient variant
• Matrix completion for matrices with low-rank displacement
• Scalable robust matrix recovery: Frank-Wolfe meets proximal methods
• An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion
• Computation of the maximum likelihood estimator in low-rank factor analysis
• A cross-product approach for low-rank approximations of large matrices
• The minimum-rank Gram matrix completion via modified fixed point continuation method
• Landmark diffusion maps (L-dMaps): accelerated manifold learning out-of-sample extension
• A partially isochronous splitting algorithm for three-block separable convex minimization problems
• Projected Landweber iteration for matrix completion
• Fast ESPRIT algorithms based on partial singular value decompositions
• A new model for sparse and low-rank matrix decomposition
• Krylov methods for low-rank regularization
• Using negative curvature in solving nonlinear programs
• An alternating direction method with increasing penalty for stable principal component pursuit
• Randomized LU decomposition
• Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data
• On the convergence of Krylov methods with low-rank truncations
• Robust principal component pursuit via inexact alternating minimization on matrix manifolds
• Computing interior eigenvalues of large sparse symmetric matrices
• A new shift strategy for the implicitly restarted refined harmonic Lanczos method
• A distributed Douglas-Rachford splitting method for multi-block convex minimization problems
• Improved Lagrangian-PPA based prediction correction method for linearly constrained convex optimization
• A preconditioned GMRES for complex dense linear systems from electromagnetic wave scattering problems
• Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion
• Accelerating convergence by augmented Rayleigh-Ritz projections for large-scale eigenpair computation
• A deterministic-stochastic method for computing the Boltzmann collision integral in \(\mathcal{O}(MN)\) operations
• Parallel Prony's Method with Multivariate Matrix Pencil Approach and Its Numerical Aspects
• Lanczos and the Riemannian SVD in information retrieval applications
• Collective matrix completion
• A self-learning algebraic multigrid method for extremal singular triplets and eigenpairs
• ROSTAPACK
• The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision
• Computing the Kreiss constant of a matrix
• Large-Scale Inverse Problems in Imaging
• WARPd: a linearly convergent first-order primal-dual algorithm for inverse problems with approximate sharpness conditions
• Hybrid iterative refined restarted Lanczos bidiagonalization methods
• Incremental CP tensor decomposition by alternating minimization method
• A Golub-Kahan Davidson method for accurately computing a few singular triplets of large sparse matrices
• Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition
• Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition
• Computational materials science and engineering
• An alternating direction method with continuation for nonconvex low rank minimization
• An implementable proximal point algorithmic framework for nuclear norm minimization
• Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
• A refined harmonic Lanczos bidiagonalization method and an implicitly restarted algorithm for computing the smallest singular triplets of large matrices
• 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
• RASL
• Low-rank spectral optimization via gauge duality
• LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
• An efficient iterative approach for large-scale separable nonlinear inverse problems
• Minimum \( n\)-rank approximation via iterative hard thresholding
• A filtered Lanczos procedure for extreme and interior eigenvalue problems
• Matrix completion via minimizing an approximate rank
• Recovery of low rank symmetric matrices via Schatten \(p\) norm minimization
• 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
• An iterative algorithm for third-order tensor multi-rank minimization
• A robust and efficient parallel SVD solver based on restarted Lanczos bidiagonalization
• 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
• Recovering low-rank matrices from corrupted observations via the linear conjugate gradient algorithm
• EIGIFP
• LSQR

This page was built for software: PROPACK