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.

• Tensor Completion in Hierarchical Tensor Representations (Q3460842) (← links)
• A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems (Q4562251) (← links)
• Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming (Q4609466) (← links)
• Decomposition Methods for Computing Directional Stationary Solutions of a Class of Nonsmooth Nonconvex Optimization Problems (Q4641680) (← links)
• On the convergence of higher-order orthogonal iteration (Q4685516) (← links)
• PET-MRI Joint Reconstruction by Joint Sparsity Based Tight Frame Regularization (Q4689757) (← links)
• Blind Source Separation with Outliers in Transformed Domains (Q4689770) (← links)
• Iterative algorithm for the symmetric and nonnegative tensor completion problem (Q4967254) (← links)
• A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions (Q4967326) (← links)
• Nonnegative tensor decomposition with custom clustering for microphase separation of block copolymers (Q4970264) (← links)
• Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming (Q4976160) (← links)
• Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory (Q4993287) (← links)
• First-Order Algorithms for a Class of Fractional Optimization Problems (Q5026841) (← links)
• An efficient nonmonotone projected Barzilai–Borwein method for nonnegative matrix factorization with extrapolation (Q5031230) (← links)
• Accelerating block coordinate descent for nonnegative tensor factorization (Q5033190) (← links)
• Block Bregman Majorization Minimization with Extrapolation (Q5037560) (← links)
• Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes (Q5038180) (← links)
• Flexible parameter selection methods for Rician noise removal with convergence guarantee (Q5044132) (← links)
• (Q5053184) (← links)
• A Columnwise Update Algorithm for Sparse Stochastic Matrix Factorization (Q5057774) (← links)
• Tensor Canonical Correlation Analysis With Convergence and Statistical Guarantees (Q5066457) (← links)
• Nonconvex Low-Rank Tensor Completion from Noisy Data (Q5080674) (← links)
• First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems (Q5097011) (← links)
• Additive Schwarz Methods for Convex Optimization as Gradient Methods (Q5110553) (← links)
• Smoothing techniques and difference of convex functions algorithms for image reconstructions (Q5131820) (← links)
• Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope (Q5131965) (← links)
• Zero norm based analysis model for image smoothing and reconstruction (Q5139309) (← links)
• Data Driven Tight Frame for Compressed Sensing MRI Reconstruction via Off-the-Grid Regularization (Q5143293) (← links)
• Orthogonal Nonnegative Tucker Decomposition (Q5147984) (← links)
• An ADMM-LAP method for total variation myopic deconvolution of adaptive optics retinal images (Q5148414) (← links)
• (Q5155916) (← links)
• A self-adaptive regularized alternating least squares method for tensor decomposition problems (Q5220069) (← links)
• Modern regularization methods for inverse problems (Q5230515) (← links)
• Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems (Q5231698) (← links)
• Blind Ptychographic Phase Retrieval via Convergent Alternating Direction Method of Multipliers (Q5236635) (← links)
• Sparse low-rank separated representation models for learning from data (Q5243616) (← links)
• Sequential gradient dynamics in real analytic Morse systems (Q5278381) (← links)
• Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications (Q5348257) (← links)
• A comparison of edge-preserving approaches for differential interference contrast microscopy (Q5356959) (← links)
• Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies (Q5379467) (← links)
• Integrating Multidimensional Data for Clustering Analysis With Applications to Cancer Patient Data (Q5857118) (← links)
• Triple Decomposition and Tensor Recovery of Third Order Tensors (Q5857846) (← links)
• Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework (Q5860343) (← links)
• SISAL Revisited (Q5863525) (← links)
• A generic coordinate descent solver for non-smooth convex optimisation (Q5865339) (← links)
• Rethinking data-driven point spread function modeling with a differentiable optical model (Q5877572) (← links)
• Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method (Q5883312) (← links)
• Weighted multiple blockwise imputation method for high-dimensional regression with blockwise missing data (Q5887986) (← links)
• An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis (Q6043137) (← links)
• A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in \(m \times n\) real matrix space with application in image clustering (Q6056240) (← links)