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)- Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes
- Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies
- Computing locally injective mappings by advanced MIPS
- Convergence of proximal algorithms with stepsize controls for non-linear inverse problems and application to sparse non-negative matrix factorization
- Parallel matrix factorization for low-rank tensor completion
- An inexact PAM method for computing Wasserstein barycenter with unknown supports
- Accelerating nonnegative matrix factorization algorithms using extrapolation
- A block-randomized stochastic method with importance sampling for CP tensor decomposition
- Nonconvex weighted variational metal artifacts removal via convergent primal-dual algorithms
- The \(\ell_{2,p}\) regularized total variation with overlapping group sparsity prior for image restoration with impulse noise
- Block Bregman majorization minimization with extrapolation
- Generalized nonconvex hyperspectral anomaly detection via background representation learning with dictionary constraint
- scientific article; zbMATH DE number 7626714 (Why is no real title available?)
- Convergence of inexact forward-backward algorithms using the forward-backward envelope
- A Global Optimization Approach for Multimarginal Optimal Transport Problems with Coulomb Cost
- A comparison of edge-preserving approaches for differential interference contrast microscopy
- Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
- Weighted hyper-Laplacian prior with overlapping group sparsity for image restoration under Cauchy noise
- PET-MRI joint reconstruction by joint sparsity based tight frame regularization
- Block-simultaneous direction method of multipliers: a proximal primal-dual splitting algorithm for nonconvex problems with multiple constraints
- The level-set subdifferential error bound via Moreau envelopes
- Blind Ptychographic Phase Retrieval via Convergent Alternating Direction Method of Multipliers
- Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Avoiding bad steps in Frank-Wolfe variants
- A subgradient method with constant step-size for \(\ell_1\)-composite optimization
- An inexactly accelerated algorithm for nonnegative tensor CP decomposition with the column unit constraints
- A power method for computing the dominant eigenvalue of a dual quaternion Hermitian matrix
- Iterative algorithm for the symmetric and nonnegative tensor completion problem
- Nonnegative tensor decomposition with custom clustering for microphase separation of block copolymers
- An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis
- Alternating structure-adapted proximal gradient descent for nonconvex nonsmooth block-regularized problems
- Inertial alternating generalized forward-backward splitting for image colorization
- Smoothing techniques and difference of convex functions algorithms for image reconstructions
- A generic coordinate descent solver for non-smooth convex optimisation
- An efficient nonmonotone projected Barzilai-Borwein method for nonnegative matrix factorization with extrapolation
- Hybrid Jacobian and Gauss-Seidel proximal block coordinate update methods for linearly constrained convex programming
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- Convergence results for projected line-search methods on varieties of low-rank matrices via Łojasiewicz inequality
- Alternating proximal gradient method for sparse nonnegative Tucker decomposition
- A block coordinate descent method for sensor network localization
- Zero norm based analysis model for image smoothing and reconstruction
- Blind source separation with outliers in transformed domains
- A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems
- Additive Schwarz methods for convex optimization as gradient methods
- Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory
- Computing the \(p\)-spectral radii of uniform hypergraphs with applications
- Additive Schwarz methods for convex optimization with backtracking
- Generalized nonconvex nonsmooth four-directional total variation with overlapping group sparsity for image restoration
- Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems
- A convergent least-squares regularized blind deconvolution approach
- Quasi non-negative quaternion matrix factorization with application to color face recognition
- Global convergence of ADMM in nonconvex nonsmooth optimization
- A nonmonotone alternating updating method for a class of matrix factorization problems
- An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices
- PhaseNet: a deep learning based phase reconstruction method for ground-based astronomy
- Optimization on the hierarchical Tucker manifold - applications to tensor completion
- An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems
- Local convergence of the heavy-ball method and iPiano for non-convex optimization
- An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints
- Decomposition methods for computing directional stationary solutions of a class of nonsmooth nonconvex optimization problems
- Statistically optimal and computationally efficient low rank tensor completion from noisy entries
- Efficient method for symmetric nonnegative matrix factorization with an approximate augmented Lagrangian scheme
- Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
- Sketch-based multiplicative updating algorithms for symmetric nonnegative tensor factorizations with applications to face image clustering
- Low-rank factorization for rank minimization with nonconvex regularizers
- Sparse low-rank separated representation models for learning from data
- Block stochastic gradient iteration for convex and nonconvex optimization
- Nonnegative low rank tensor approximations with multidimensional image applications
- A block coordinate variable metric forward-backward algorithm
- Alternating direction method of multipliers for solving dictionary learning models
- Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method
- Sparse subspace clustering with jointly learning representation and affinity matrix
- Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming
- Cyclic coordinate-update algorithms for fixed-point problems: analysis and applications
- The proximal alternating iterative hard thresholding method for \(l_0\) minimization, with complexity \(\mathcal{O}(1/\sqrt{k})\)
- Joint phase reconstruction and magnitude segmentation from velocity-encoded MRI data
- Unsupervised machine learning based on non-negative tensor factorization for analyzing reactive-mixing
- 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
- Algorithms for nonnegative matrix factorization with the Kullback-Leibler divergence
- The point-wise convergence of shifted symmetric higher order power method
- Riemannian gradient descent methods for graph-regularized matrix completion
- Sequential gradient dynamics in real analytic Morse systems
- An augmented Lagrangian proximal alternating method for sparse discrete optimization problems
- Efficient blind compressed sensing using sparsifying transforms with convergence guarantees and application to magnetic resonance imaging
- A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in \(m \times n\) real matrix space with application in image clustering
- Low-rank matrix recovery problem minimizing a new ratio of two norms approximating the rank function then using an ADMM-type solver with applications
- Weighted multiple blockwise imputation method for high-dimensional regression with blockwise missing data
- Convergence of Gradient-Based Block Coordinate Descent Algorithms for Nonorthogonal Joint Approximate Diagonalization of Matrices
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- A primal-dual algorithm for nonnegative N-th order CP tensor decomposition: application to fluorescence spectroscopy data analysis
- Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints
- Iterative gradient denoising algorithm for signal recovery using analysis-based implicit prior
- Correntropy based model predictive controller with multi-constraints for robust path trajectory tracking of self-driving vehicle
- Penalized and Constrained Optimization: An Application to High-Dimensional Website Advertising
- A simplified view of first order methods for optimization
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation
- Functional linear regression for functional response via sparse basis selection
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)
