A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
From MaRDI portal
Publication:2873262
DOI10.1137/120887795zbMATH Open1280.49042OpenAlexW1968154520MaRDI QIDQ2873262FDOQ2873262
Authors: Wotao Yin, Yangyang Xu 
Publication date: 23 January 2014
Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/9540779ab5e8fd4637287e73950d5d0a701f51fe
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
matrix completionproximal gradient methodNash equilibriumblock coordinate descenttensor completionblock multiconvexnonnegative matrix/tensor factorizationKurdyka-Łojasiewicz inequality
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Methods of reduced gradient type (90C52) Numerical methods of relaxation type (49M20) Extrapolation to the limit, deferred corrections (65B05)
Cited In (only showing first 100 items - show all)
- Accelerating nonnegative matrix factorization algorithms using extrapolation
- Convergence of proximal algorithms with stepsize controls for non-linear inverse problems and application to sparse non-negative matrix factorization
- An inexact PAM method for computing Wasserstein barycenter with unknown supports
- Parallel matrix factorization for low-rank tensor completion
- Block-simultaneous direction method of multipliers: a proximal primal-dual splitting algorithm for nonconvex problems with multiple constraints
- Weighted hyper-Laplacian prior with overlapping group sparsity for image restoration under Cauchy noise
- Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs
- An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis
- Alternating structure-adapted proximal gradient descent for nonconvex nonsmooth block-regularized problems
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- A generic coordinate descent solver for non-smooth convex optimisation
- Inertial alternating generalized forward-backward splitting for image colorization
- 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
- Blind source separation with outliers in transformed domains
- A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems
- Computing the \(p\)-spectral radii of uniform hypergraphs with applications
- A nonmonotone alternating updating method for a class of matrix factorization problems
- A convergent least-squares regularized blind deconvolution approach
- Global convergence of ADMM in nonconvex nonsmooth optimization
- 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
- Sparse low-rank separated representation models for learning from data
- Statistically optimal and computationally efficient low rank tensor completion from noisy entries
- Low-rank factorization for rank minimization with nonconvex regularizers
- Nonnegative low rank tensor approximations with multidimensional image applications
- Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming
- A block coordinate variable metric forward-backward algorithm
- Sparse subspace clustering with jointly learning representation and affinity matrix
- The proximal alternating iterative hard thresholding method for \(l_0\) minimization, with complexity \(\mathcal{O}(1/\sqrt{k})\)
- Riemannian gradient descent methods for graph-regularized matrix completion
- An augmented Lagrangian proximal alternating method for sparse discrete optimization problems
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- Penalized and Constrained Optimization: An Application to High-Dimensional Website Advertising
- A simplified view of first order methods for optimization
- Functional linear regression for functional response via sparse basis selection
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation
- A fast patch-dictionary method for whole image recovery
- Computing eigenvalues of large scale sparse tensors arising from a hypergraph
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- A block coordinate variable metric linesearch based proximal gradient method
- Low rank matrix completion by alternating steepest descent methods
- Rethinking data-driven point spread function modeling with a differentiable optical model
- An oracle inequality for quasi-Bayesian nonnegative matrix factorization
- Tensor completion in hierarchical tensor representations
- Descent methods for nonnegative matrix factorization
- Sparse representation based image deblurring model under random-valued impulse noise
- Twist tensor total variation regularized-reweighted nuclear norm based tensor completion for video missing area recovery
- On accelerating the regularized alternating least-squares algorithm for tensors
- Orthogonal nonnegative Tucker decomposition
- 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
- Inexact block coordinate descent methods with application to non-negative matrix factorization
- On global convergence of alternating least squares for tensor approximation
- Modern regularization methods for inverse problems
- Proximal gradient method for huberized support vector machine
- Alternating DC algorithm for partial DC programming problems
- Global and local structure preserving sparse subspace learning: an iterative approach to unsupervised feature selection
- On the convergence of higher-order orthogonal iteration
- Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations
- Fast gradient methods for uniformly convex and weakly smooth problems
- An objective penalty function method for biconvex programming
- Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications
- A self-adaptive regularized alternating least squares method for tensor decomposition problems
- Semi-blind image deblurring by a proximal alternating minimization method with convergence guarantees
- On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes
- GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression
- Finding a low-rank basis in a matrix subspace
- Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies
- Computing locally injective mappings by advanced MIPS
- Convergence of inexact forward-backward algorithms using the forward-backward envelope
- Title not available (Why is that?)
- A Global Optimization Approach for Multimarginal Optimal Transport Problems with Coulomb Cost
- The \(\ell_{2,p}\) regularized total variation with overlapping group sparsity prior for image restoration with impulse noise
- Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
- Blind Ptychographic Phase Retrieval via Convergent Alternating Direction Method of Multipliers
- Smoothing techniques and difference of convex functions algorithms for image reconstructions
- Avoiding bad steps in Frank-Wolfe variants
- A block coordinate descent method for sensor network localization
- Additive Schwarz methods for convex optimization as gradient methods
- Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory
- Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems
- Additive Schwarz methods for convex optimization with backtracking
- An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices
- Decomposition methods for computing directional stationary solutions of a class of nonsmooth nonconvex optimization problems
- Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
- Block stochastic gradient iteration for convex and nonconvex optimization
- Cyclic coordinate-update algorithms for fixed-point problems: analysis and applications
- Alternating direction method of multipliers for solving dictionary learning models
- 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
- 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
Uses Software
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)
