Pages that link to "Item:Q2873262"

The following pages link to A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion (Q2873262):

Displaying 50 items.

• Parallel matrix factorization for low-rank tensor completion (Q256035) (← links)
• A fast patch-dictionary method for whole image recovery (Q326397) (← links)
• Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations (Q506609) (← links)
• GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression (Q515771) (← links)
• Finding a low-rank basis in a matrix subspace (Q517309) (← links)
• A block coordinate variable metric forward-backward algorithm (Q727391) (← links)
• The proximal alternating iterative hard thresholding method for \(l_0\) minimization, with complexity \(\mathcal{O}(1/\sqrt{k})\) (Q730526) (← links)
• Twist tensor total variation regularized-reweighted nuclear norm based tensor completion for video missing area recovery (Q781059) (← links)
• Convergence of proximal algorithms with stepsize controls for non-linear inverse problems and application to sparse non-negative matrix factorization (Q827076) (← links)
• Weighted hyper-Laplacian prior with overlapping group sparsity for image restoration under Cauchy noise (Q831244) (← links)
• Low rank matrix completion by alternating steepest descent methods (Q905914) (← links)
• A convergent least-squares regularized blind deconvolution approach (Q1636832) (← links)
• Local convergence of the heavy-ball method and iPiano for non-convex optimization (Q1637355) (← links)
• Sparse subspace clustering with jointly learning representation and affinity matrix (Q1643239) (← links)
• A simplified view of first order methods for optimization (Q1650767) (← links)
• A globally convergent algorithm for nonconvex optimization based on block coordinate update (Q1676921) (← links)
• An oracle inequality for quasi-Bayesian nonnegative matrix factorization (Q1678528) (← links)
• Algorithm for overcoming the curse of dimensionality for time-dependent non-convex Hamilton-Jacobi equations arising from optimal control and differential games problems (Q1691386) (← links)
• On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes (Q1711086) (← links)
• Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs (Q1734768) (← links)
• Global convergence of ADMM in nonconvex nonsmooth optimization (Q1736880) (← links)
• On accelerating the regularized alternating least-squares algorithm for tensors (Q1744316) (← links)
• Computing the \(p\)-spectral radii of uniform hypergraphs with applications (Q1747024) (← links)
• Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods (Q1785009) (← links)
• A block coordinate variable metric linesearch based proximal gradient method (Q1790669) (← links)
• An inexact PAM method for computing Wasserstein barycenter with unknown supports (Q1983867) (← links)
• Inertial alternating generalized forward-backward splitting for image colorization (Q1999474) (← links)
• Sparse representation based image deblurring model under random-valued impulse noise (Q2002373) (← links)
• Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems (Q2022292) (← links)
• Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems (Q2026713) (← links)
• Reproducible kernel Hilbert space based global and local image segmentation (Q2028914) (← links)
• Riemannian gradient descent methods for graph-regularized matrix completion (Q2029849) (← links)
• Selective linearization for multi-block statistical learning (Q2030520) (← links)
• The point-wise convergence of shifted symmetric higher order power method (Q2031333) (← links)
• Algorithms for nonnegative matrix factorization with the Kullback-Leibler divergence (Q2031873) (← links)
• Low-rank factorization for rank minimization with nonconvex regularizers (Q2044472) (← links)
• On DC based methods for phase retrieval (Q2050353) (← links)
• A Barzilai-Borwein gradient algorithm for spatio-temporal Internet traffic data completion via tensor triple decomposition (Q2051078) (← links)
• An objective penalty function method for biconvex programming (Q2052381) (← links)
• Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization (Q2052408) (← links)
• MAP inference via \(\ell_2\)-sphere linear program reformulation (Q2056127) (← links)
• A parallel algorithm for ridge-penalized estimation of the multivariate exponential family from data of mixed types (Q2058766) (← links)
• A new method based on the manifold-alternative approximating for low-rank matrix completion (Q2061479) (← links)
• An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems (Q2067857) (← links)
• Tensor Q-rank: new data dependent definition of tensor rank (Q2071330) (← links)
• Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems (Q2089886) (← links)
• The \(\ell_{2,p}\) regularized total variation with overlapping group sparsity prior for image restoration with impulse noise (Q2098805) (← links)
• Avoiding bad steps in Frank-Wolfe variants (Q2111475) (← links)
• A block coordinate descent method for sensor network localization (Q2119759) (← links)
• Additive Schwarz methods for convex optimization with backtracking (Q2122660) (← links)