A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion

DOI10.1137/120887795zbMath1280.49042OpenAlexW1968154520MaRDI QIDQ2873262

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

zbMATH Keywords

matrix completion Nash equilibrium block coordinate descent Kurdyka-Łojasiewicz inequality tensor completion proximal gradient method block multiconvex nonnegative matrix/tensor factorization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Extrapolation to the limit, deferred corrections (65B05) Numerical methods of relaxation type (49M20) Methods of reduced gradient type (90C52)

Related Items

An efficient nonmonotone projected Barzilai–Borwein method for nonnegative matrix factorization with extrapolation, Sequential gradient dynamics in real analytic Morse systems, Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method, Block Bregman Majorization Minimization with Extrapolation, Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes, Weighted multiple blockwise imputation method for high-dimensional regression with blockwise missing data, Flexible parameter selection methods for Rician noise removal with convergence guarantee, A Columnwise Update Algorithm for Sparse Stochastic Matrix Factorization, Tensor Canonical Correlation Analysis With Convergence and Statistical Guarantees, Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory, Nonconvex Low-Rank Tensor Completion from Noisy Data, First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems, Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications, An extrapolated iteratively reweighted $\ell_1$ method with complexity analysis, 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, Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems, A combined first and fractional order regularization method for mixed Poisson-White spike noisy image restoration, The convergence properties of infeasible inexact proximal alternating linearized minimization, Semi-implicit back propagation, Fully-connected tensor network decomposition for robust tensor completion problem, Iterative rank-one matrix completion via singular value decomposition and nuclear norm regularization, A Global Optimization Approach for Multimarginal Optimal Transport Problems with Coulomb Cost, Convergence of Gradient-Based Block Coordinate Descent Algorithms for Nonorthogonal Joint Approximate Diagonalization of Matrices, Explicit explore, exploit, or escape $(E^4)$: near-optimal safety-constrained reinforcement learning in polynomial time, A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems, Correntropy based model predictive controller with multi-constraints for robust path trajectory tracking of self-driving vehicle, A block-randomized stochastic method with importance sampling for CP tensor decomposition, A comparison of edge-preserving approaches for differential interference contrast microscopy, Non-convex fractional-order derivative for single image blind restoration, An inertial alternating minimization with Bregman distance for a class of nonconvex and nonsmooth problems, Additive Schwarz Methods for Convex Optimization as Gradient Methods, Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for $\boldsymbol{\ell_1}$ -Norm Principal Component Analysis, Quasi non-negative quaternion matrix factorization with application to color face recognition, An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant, Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems, Nonnegative Low Rank Matrix Completion by Riemannian Optimalization Methods, Analysis of a variable metric block coordinate method under proximal errors, Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming, Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies, Smoothing techniques and difference of convex functions algorithms for image reconstructions, Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope, Zero norm based analysis model for image smoothing and reconstruction, Data Driven Tight Frame for Compressed Sensing MRI Reconstruction via Off-the-Grid Regularization, Orthogonal Nonnegative Tucker Decomposition, An ADMM-LAP method for total variation myopic deconvolution of adaptive optics retinal images, Decomposition Methods for Computing Directional Stationary Solutions of a Class of Nonsmooth Nonconvex Optimization Problems, Unnamed Item, On the convergence of higher-order orthogonal iteration, PET-MRI Joint Reconstruction by Joint Sparsity Based Tight Frame Regularization, Blind Source Separation with Outliers in Transformed Domains, Iterative algorithm for the symmetric and nonnegative tensor completion problem, A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions, Nonnegative tensor decomposition with custom clustering for microphase separation of block copolymers, A self-adaptive regularized alternating least squares method for tensor decomposition problems, Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming, Modern regularization methods for inverse problems, Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems, Blind Ptychographic Phase Retrieval via Convergent Alternating Direction Method of Multipliers, Sparse low-rank separated representation models for learning from data, Unnamed Item, Integrating Multidimensional Data for Clustering Analysis With Applications to Cancer Patient Data, Triple Decomposition and Tensor Recovery of Third Order Tensors, Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework, SISAL Revisited, A generic coordinate descent solver for non-smooth convex optimisation, First-Order Algorithms for a Class of Fractional Optimization Problems, Rethinking data-driven point spread function modeling with a differentiable optical model, A block coordinate descent method for sensor network localization, Additive Schwarz methods for convex optimization with backtracking, Alternating DC algorithm for partial DC programming problems, Convergence of proximal algorithms with stepsize controls for non-linear inverse problems and application to sparse non-negative matrix factorization, Weighted hyper-Laplacian prior with overlapping group sparsity for image restoration under Cauchy noise, Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems, A convergent least-squares regularized blind deconvolution approach, Local convergence of the heavy-ball method and iPiano for non-convex optimization, Efficient Blind Compressed Sensing Using Sparsifying Transforms with Convergence Guarantees and Application to Magnetic Resonance Imaging, 5D respiratory motion model based image reconstruction algorithm for 4D cone-beam computed tomography, A primal-dual algorithm for nonnegative $N$-th order CP tensor decomposition: application to fluorescence spectroscopy data analysis, Sparse subspace clustering with jointly learning representation and affinity matrix, Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints, Tensor Completion in Hierarchical Tensor Representations, A fast patch-dictionary method for whole image recovery, A Wavelet Frame Method with Shape Prior for Ultrasound Video Segmentation, A simplified view of first order methods for optimization, A variational method for Abel inversion tomography with mixed Poisson-Laplace-Gaussian noise, A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems, Inertial alternating direction method of multipliers for non-convex non-smooth optimization, Statistically optimal and computationally efficient low rank tensor completion from noisy entries, Matrix completion methods for the total electron content video reconstruction, An approximation method of CP rank for third-order tensor completion, Image completion and blind deconvolution: model and algorithm, Semi-blind image deblurring by a proximal alternating minimization method with convergence guarantees, A globally convergent algorithm for nonconvex optimization based on block coordinate update, An oracle inequality for quasi-Bayesian nonnegative matrix factorization, Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization, Fast gradient methods for uniformly convex and weakly smooth problems, Global and local structure preserving sparse subspace learning: an iterative approach to unsupervised feature selection, Iteratively reweighted $\ell _1$ algorithms with extrapolation, Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications, Nonnegative low rank tensor approximations with multidimensional image applications, Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality, Algorithm for overcoming the curse of dimensionality for time-dependent non-convex Hamilton-Jacobi equations arising from optimal control and differential games problems, Run-and-inspect method for nonconvex optimization and global optimality bounds for R-local minimizers, A nonconvex truncated regularization and box-constrained model for CT reconstruction, Low rank matrix completion by alternating steepest descent methods, Pure characteristics demand models and distributionally robust mathematical programs with stochastic complementarity constraints, Tensor factorization with total variation and Tikhonov regularization for low-rank tensor completion in imaging data, On global convergence of alternating least squares for tensor approximation, T-product factorization based method for matrix and tensor completion problems, On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes, Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming, Unsupervised machine learning based on non-negative tensor factorization for analyzing reactive-mixing, Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs, Global convergence of ADMM in nonconvex nonsmooth optimization, Penalized and Constrained Optimization: An Application to High-Dimensional Website Advertising, An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices, An inexact PAM method for computing Wasserstein barycenter with unknown supports, On accelerating the regularized alternating least-squares algorithm for tensors, Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations, Computing the $p$-spectral radii of uniform hypergraphs with applications, GAITA: a Gauss-Seidel iterative thresholding algorithm for $\ell_q$ regularized least squares regression, Finding a low-rank basis in a matrix subspace, Inertial alternating generalized forward-backward splitting for image colorization, Sparse representation based image deblurring model under random-valued impulse noise, Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems, Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems, Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods, Reproducible kernel Hilbert space based global and local image segmentation, Riemannian gradient descent methods for graph-regularized matrix completion, Selective linearization for multi-block statistical learning, The point-wise convergence of shifted symmetric higher order power method, Algorithms for nonnegative matrix factorization with the Kullback-Leibler divergence, A block coordinate variable metric forward-backward algorithm, A block coordinate variable metric linesearch based proximal gradient method, The proximal alternating iterative hard thresholding method for $l_0$ minimization, with complexity $\mathcal{O}(1/\sqrt{k})$, Computing locally injective mappings by advanced MIPS, Functional linear regression for functional response via sparse basis selection, Low-rank factorization for rank minimization with nonconvex regularizers, Joint Phase Reconstruction and Magnitude Segmentation from Velocity-Encoded MRI Data, Accelerating Nonnegative Matrix Factorization Algorithms Using Extrapolation, An augmented Lagrangian proximal alternating method for sparse discrete optimization problems, On DC based methods for phase retrieval, Markov chain block coordinate descent, A Barzilai-Borwein gradient algorithm for spatio-temporal Internet traffic data completion via tensor triple decomposition, An objective penalty function method for biconvex programming, 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, A parallel algorithm for ridge-penalized estimation of the multivariate exponential family from data of mixed types, A single image dehazing model using total variation and inter-channel correlation, Two fast vector-wise update algorithms for orthogonal nonnegative matrix factorization with sparsity constraint, A new method based on the manifold-alternative approximating for low-rank matrix completion, A new proximal iterative hard thresholding method with extrapolation for $\ell _0$ minimization, Block-simultaneous direction method of multipliers: a proximal primal-dual splitting algorithm for nonconvex problems with multiple constraints, An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems, Computing Eigenvalues of Large Scale Sparse Tensors Arising from a Hypergraph, Tensor Q-rank: new data dependent definition of tensor rank, Optimal multivariate Gaussian fitting with applications to PSF modeling in two-photon microscopy imaging, Twist tensor total variation regularized-reweighted nuclear norm based tensor completion for video missing area recovery, Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems, Proximal gradient method for huberized support vector machine, The $\ell_{2,p}$ regularized total variation with overlapping group sparsity prior for image restoration with impulse noise, Alternating direction method of multipliers for solving dictionary learning models, Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates, Optimization on the hierarchical Tucker manifold - applications to tensor completion, Avoiding bad steps in Frank-Wolfe variants, Parallel matrix factorization for low-rank tensor completion, Alternating proximal gradient method for sparse nonnegative Tucker decomposition

Uses Software

Matlab