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.

• Alternating DC algorithm for partial DC programming problems (Q2124808) (← links)
• Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems (Q2133414) (← links)
• A primal-dual algorithm for nonnegative \(N\)-th order CP tensor decomposition: application to fluorescence spectroscopy data analysis (Q2146528) (← links)
• Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints (Q2148118) (← links)
• A variational method for Abel inversion tomography with mixed Poisson-Laplace-Gaussian noise (Q2158261) (← links)
• Inertial alternating direction method of multipliers for non-convex non-smooth optimization (Q2162531) (← links)
• Matrix completion methods for the total electron content video reconstruction (Q2170384) (← links)
• Semi-blind image deblurring by a proximal alternating minimization method with convergence guarantees (Q2177872) (← links)
• Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications (Q2189661) (← links)
• A nonconvex truncated regularization and box-constrained model for CT reconstruction (Q2198001) (← links)
• Tensor factorization with total variation and Tikhonov regularization for low-rank tensor completion in imaging data (Q2203366) (← links)
• Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming (Q2220658) (← links)
• Unsupervised machine learning based on non-negative tensor factorization for analyzing reactive-mixing (Q2222331) (← links)
• An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices (Q2238337) (← links)
• An augmented Lagrangian proximal alternating method for sparse discrete optimization problems (Q2299205) (← links)
• Markov chain block coordinate descent (Q2301127) (← links)
• A single image dehazing model using total variation and inter-channel correlation (Q2308515) (← links)
• Two fast vector-wise update algorithms for orthogonal nonnegative matrix factorization with sparsity constraint (Q2309252) (← links)
• A new proximal iterative hard thresholding method with extrapolation for \(\ell _0\) minimization (Q2311987) (← links)
• Block-simultaneous direction method of multipliers: a proximal primal-dual splitting algorithm for nonconvex problems with multiple constraints (Q2315079) (← links)
• Optimal multivariate Gaussian fitting with applications to PSF modeling in two-photon microscopy imaging (Q2320461) (← links)
• Proximal gradient method for huberized support vector machine (Q2337512) (← links)
• Alternating direction method of multipliers for solving dictionary learning models (Q2343040) (← links)
• Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates (Q2349844) (← links)
• Optimization on the hierarchical Tucker manifold - applications to tensor completion (Q2350002) (← links)
• Alternating proximal gradient method for sparse nonnegative Tucker decomposition (Q2356334) (← links)
• Global and local structure preserving sparse subspace learning: an iterative approach to unsupervised feature selection (Q2416964) (← links)
• Iteratively reweighted \(\ell _1\) algorithms with extrapolation (Q2419549) (← links)
• Run-and-inspect method for nonconvex optimization and global optimality bounds for R-local minimizers (Q2425163) (← links)
• Functional linear regression for functional response via sparse basis selection (Q2515851) (← links)
• Statistically optimal and computationally efficient low rank tensor completion from noisy entries (Q2656588) (← links)
• An approximation method of CP rank for third-order tensor completion (Q2662903) (← links)
• Image completion and blind deconvolution: model and algorithm (Q2666018) (← links)
• Fast gradient methods for uniformly convex and weakly smooth problems (Q2673504) (← links)
• Nonnegative low rank tensor approximations with multidimensional image applications (Q2678968) (← links)
• Pure characteristics demand models and distributionally robust mathematical programs with stochastic complementarity constraints (Q2693648) (← links)
• On global convergence of alternating least squares for tensor approximation (Q2696915) (← links)
• T-product factorization based method for matrix and tensor completion problems (Q2696924) (← links)
• Computing locally injective mappings by advanced MIPS (Q2802299) (← links)
• Computing eigenvalues of large scale sparse tensors arising from a hypergraph (Q2833535) (← links)
• Descent Methods for Nonnegative Matrix Factorization (Q2913167) (← links)
• Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization (Q2945126) (← links)
• Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality (Q2954392) (← links)
• Inexact block coordinate descent methods with application to non-negative matrix factorization (Q3096358) (← links)
• A Wavelet Frame Method with Shape Prior for Ultrasound Video Segmentation (Q3188195) (← links)
• Penalized and Constrained Optimization: An Application to High-Dimensional Website Advertising (Q3304839) (← links)
• Joint Phase Reconstruction and Magnitude Segmentation from Velocity-Encoded MRI Data (Q3379554) (← links)
• Accelerating Nonnegative Matrix Factorization Algorithms Using Extrapolation (Q3379602) (← links)
• Efficient Blind Compressed Sensing Using Sparsifying Transforms with Convergence Guarantees and Application to Magnetic Resonance Imaging (Q3454501) (← links)
• 5D respiratory motion model based image reconstruction algorithm for 4D cone-beam computed tomography (Q3458217) (← links)