A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
From MaRDI portal
Publication:2873262
Recommendations
- Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
- An alternating direction algorithm for matrix completion with nonnegative factors
- Inexact block coordinate descent methods with application to non-negative matrix factorization
- Descent methods for nonnegative matrix factorization
- Tensor completion using total variation and low-rank matrix factorization
Cited in
(only showing first 100 items - show all)- Penalized and Constrained Optimization: An Application to High-Dimensional Website Advertising
- Local convergence of the heavy-ball method and iPiano for non-convex optimization
- Proximal gradient method for huberized support vector machine
- Semi-blind image deblurring by a proximal alternating minimization method with convergence guarantees
- Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs
- Nonnegative low rank tensor approximations with multidimensional image applications
- Accelerating nonnegative matrix factorization algorithms using extrapolation
- Blind source separation with outliers in transformed domains
- An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis
- Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies
- A convergent least-squares regularized blind deconvolution approach
- On global convergence of alternating least squares for tensor approximation
- Block-simultaneous direction method of multipliers: a proximal primal-dual splitting algorithm for nonconvex problems with multiple constraints
- Fast gradient methods for uniformly convex and weakly smooth problems
- A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems
- Weighted hyper-Laplacian prior with overlapping group sparsity for image restoration under Cauchy noise
- An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems
- Twist tensor total variation regularized-reweighted nuclear norm based tensor completion for video missing area recovery
- The proximal alternating iterative hard thresholding method for \(l_0\) minimization, with complexity \(\mathcal{O}(1/\sqrt{k})\)
- Hybrid Jacobian and Gauss-Seidel proximal block coordinate update methods for linearly constrained convex programming
- Sparse low-rank separated representation models for learning from data
- Computing eigenvalues of large scale sparse tensors arising from a hypergraph
- Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Tensor completion in hierarchical tensor representations
- On accelerating the regularized alternating least-squares algorithm for tensors
- Statistically optimal and computationally efficient low rank tensor completion from noisy entries
- Algorithm for overcoming the curse of dimensionality for time-dependent non-convex Hamilton-Jacobi equations arising from optimal control and differential games problems
- A new proximal iterative hard thresholding method with extrapolation for \(\ell _0\) minimization
- Low rank matrix completion by alternating steepest descent methods
- Convergence of proximal algorithms with stepsize controls for non-linear inverse problems and application to sparse non-negative matrix factorization
- Orthogonal nonnegative Tucker decomposition
- Alternating structure-adapted proximal gradient descent for nonconvex nonsmooth block-regularized problems
- A simplified view of first order methods for optimization
- An inexact PAM method for computing Wasserstein barycenter with unknown supports
- Functional linear regression for functional response via sparse basis selection
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation
- Modern regularization methods for inverse problems
- An objective penalty function method for biconvex programming
- Alternating DC algorithm for partial DC programming problems
- Rethinking data-driven point spread function modeling with a differentiable optical model
- Riemannian gradient descent methods for graph-regularized matrix completion
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Low-rank factorization for rank minimization with nonconvex regularizers
- Parallel matrix factorization for low-rank tensor completion
- Descent methods for nonnegative matrix factorization
- A block coordinate variable metric forward-backward algorithm
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- A generic coordinate descent solver for non-smooth convex optimisation
- Inexact block coordinate descent methods with application to non-negative matrix factorization
- An oracle inequality for quasi-Bayesian nonnegative matrix factorization
- On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes
- Sparse representation based image deblurring model under random-valued impulse noise
- Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications
- Global and local structure preserving sparse subspace learning: an iterative approach to unsupervised feature selection
- Convergence results for projected line-search methods on varieties of low-rank matrices via Łojasiewicz inequality
- GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression
- Computing the \(p\)-spectral radii of uniform hypergraphs with applications
- Finding a low-rank basis in a matrix subspace
- Optimization on the hierarchical Tucker manifold - applications to tensor completion
- Computing locally injective mappings by advanced MIPS
- A fast patch-dictionary method for whole image recovery
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- A block coordinate variable metric linesearch based proximal gradient method
- A self-adaptive regularized alternating least squares method for tensor decomposition problems
- Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations
- On the convergence of higher-order orthogonal iteration
- A nonmonotone alternating updating method for a class of matrix factorization problems
- Sparse subspace clustering with jointly learning representation and affinity matrix
- Alternating proximal gradient method for sparse nonnegative Tucker decomposition
- An augmented Lagrangian proximal alternating method for sparse discrete optimization problems
- Inertial alternating generalized forward-backward splitting for image colorization
- Markov chain block coordinate descent
- Additive Schwarz methods for convex optimization with backtracking
- A parallel algorithm for ridge-penalized estimation of the multivariate exponential family from data of mixed types
- Tensor Canonical Correlation Analysis With Convergence and Statistical Guarantees
- On DC based methods for phase retrieval
- Choose your path wisely: gradient descent in a Bregman distance framework
- A new method based on the manifold-alternative approximating for low-rank matrix completion
- Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes
- A variational method for Abel inversion tomography with mixed Poisson-Laplace-Gaussian noise
- Integrating multidimensional data for clustering analysis with applications to cancer patient data
- A block coordinate descent method for sensor network localization
- Non-convex fractional-order derivative for single image blind restoration
- Unsupervised machine learning based on non-negative tensor factorization for analyzing reactive-mixing
- Cyclic coordinate-update algorithms for fixed-point problems: analysis and applications
- 5D respiratory motion model based image reconstruction algorithm for 4D cone-beam computed tomography
- Two fast vector-wise update algorithms for orthogonal nonnegative matrix factorization with sparsity constraint
- A nonconvex truncated regularization and box-constrained model for CT reconstruction
- Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems
- A Barzilai-Borwein gradient algorithm for spatio-temporal Internet traffic data completion via tensor triple decomposition
- Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization
- The convergence properties of infeasible inexact proximal alternating linearized minimization
- Blind Ptychographic Phase Retrieval via Convergent Alternating Direction Method of Multipliers
- MAP inference via \(\ell_2\)-sphere linear program reformulation
- Data Driven Tight Frame for Compressed Sensing MRI Reconstruction via Off-the-Grid Regularization
- Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems
- Reproducible kernel Hilbert space based global and local image segmentation
- Selective linearization for multi-block statistical learning
This page was built for publication: A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2873262)
