A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
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)
- 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
- Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming
- A variational method for Abel inversion tomography with mixed Poisson-Laplace-Gaussian noise
- Triple decomposition and tensor recovery of third order tensors
- 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
- 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
- Nonconvex Low-Rank Tensor Completion from Noisy Data
- Integrating multidimensional data for clustering analysis with applications to cancer patient 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
- Choose your path wisely: gradient descent in a Bregman distance framework
- 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
- Tensor Q-rank: new data dependent definition of tensor rank
- The convergence properties of infeasible inexact proximal alternating linearized minimization
- 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
- Generalized nonconvex hyperspectral anomaly detection via background representation learning with dictionary constraint
- Block Bregman majorization minimization with extrapolation
- A comparison of edge-preserving approaches for differential interference contrast microscopy
- PET-MRI joint reconstruction by joint sparsity based tight frame regularization
- The level-set subdifferential error bound via Moreau envelopes
- 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 efficient nonmonotone projected Barzilai-Borwein method for nonnegative matrix factorization with extrapolation
- Zero norm based analysis model for image smoothing and reconstruction
- Generalized nonconvex nonsmooth four-directional total variation with overlapping group sparsity for image restoration
- Quasi non-negative quaternion matrix factorization with application to color face recognition
- PhaseNet: a deep learning based phase reconstruction method for ground-based astronomy
- An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints
- Efficient method for symmetric nonnegative matrix factorization with an approximate augmented Lagrangian scheme
- Sketch-based multiplicative updating algorithms for symmetric nonnegative tensor factorizations with applications to face image clustering
- Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method
- Joint phase reconstruction and magnitude segmentation from velocity-encoded MRI data
- Sequential gradient dynamics in real analytic Morse systems
- 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
- Efficient blind compressed sensing using sparsifying transforms with convergence guarantees and application to magnetic resonance imaging
- 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
- Accelerating block coordinate descent for nonnegative tensor factorization
- Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems
- An ADMM-LAP method for total variation myopic deconvolution of adaptive optics retinal images
- A combined first and fractional order regularization method for mixed Poisson-White spike noisy image restoration
- First-order methods for problems with \(O(1)\) functional constraints can have almost the same convergence rate as for unconstrained problems
- Semi-implicit back propagation
- SISAL revisited
- Nonnegative Low Rank Matrix Completion by Riemannian Optimalization Methods
- Title not available (Why is that?)
- An approximation method of CP rank for third-order tensor completion
- Analysis of a variable metric block coordinate method under proximal errors
- Image completion and blind deconvolution: model and algorithm
- Fully-connected tensor network decomposition for robust tensor completion problem
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)