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 equilibrium[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Kurdyka-%EF%BF%BD%EF%BF%BDojasiewicz+inequality&go=Go Kurdyka-��ojasiewicz inequality]block coordinate descenttensor completionblock multiconvexnonnegative matrix/tensor factorization
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)
- 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
- Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications
- 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
- 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
- Triple Decomposition and Tensor Recovery of Third Order Tensors
- Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
- Integrating Multidimensional Data for Clustering Analysis With Applications to Cancer Patient 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
- 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
- Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming
- Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework
- A variational method for Abel inversion tomography with mixed Poisson-Laplace-Gaussian noise
- Matrix completion methods for the total electron content video reconstruction
- Tensor Canonical Correlation Analysis With Convergence and Statistical Guarantees
- On DC based methods for phase retrieval
- Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization
- 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
- MAP inference via \(\ell_2\)-sphere linear program reformulation
- Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope
- Nonconvex Low-Rank Tensor Completion from Noisy Data
- Tensor factorization with total variation and Tikhonov regularization for low-rank tensor completion in imaging data
- An inertial alternating minimization with Bregman distance for a class of nonconvex and nonsmooth problems
- An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant
- A parallel algorithm for ridge-penalized estimation of the multivariate exponential family from data of mixed types
- A new method based on the manifold-alternative approximating for low-rank matrix completion
- A nonconvex truncated regularization and box-constrained model for CT reconstruction
- Iterative rank-one matrix completion via singular value decomposition and nuclear norm regularization
- Non-convex fractional-order derivative for single image blind restoration
- T-product factorization based method for matrix and tensor completion problems
- Additive Schwarz Methods for Convex Optimization as Gradient Methods
- Tensor Q-rank: new data dependent definition of tensor rank
- The convergence properties of infeasible inexact proximal alternating linearized minimization
- Decomposition Methods for Computing Directional Stationary Solutions of a Class of Nonsmooth Nonconvex Optimization Problems
- Markov chain block coordinate descent
- Data Driven Tight Frame for Compressed Sensing MRI Reconstruction via Off-the-Grid Regularization
- A single image dehazing model using total variation and inter-channel correlation
- 5D respiratory motion model based image reconstruction algorithm for 4D cone-beam computed tomography
- Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems
- Inertial alternating direction method of multipliers for non-convex non-smooth optimization
- Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes
- Two fast vector-wise update algorithms for orthogonal nonnegative matrix factorization with sparsity constraint
- Optimal multivariate Gaussian fitting with applications to PSF modeling in two-photon microscopy imaging
- Tensor Completion in Hierarchical Tensor Representations
- 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
- Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality
- 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
- 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
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- Alternating proximal gradient method for sparse nonnegative Tucker decomposition
- A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems
- Computing the \(p\)-spectral radii of uniform hypergraphs with applications
- 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
- Accelerating Nonnegative Matrix Factorization Algorithms Using Extrapolation
- 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
- Orthogonal Nonnegative Tucker Decomposition
- 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
- 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
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)
