Pages that link to "Item:Q4580860"
From MaRDI portal
The following pages link to Parallel Algorithms for Constrained Tensor Factorization via Alternating Direction Method of Multipliers (Q4580860):
Displayed 15 items.
- Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery (Q1701931) (← links)
- Alternating iterative methods for solving tensor equations with applications (Q1736417) (← links)
- Global convergence of ADMM in nonconvex nonsmooth optimization (Q1736880) (← links)
- A primal-dual algorithm for nonnegative \(N\)-th order CP tensor decomposition: application to fluorescence spectroscopy data analysis (Q2146528) (← links)
- Dynamic behavior analysis via structured rank minimization (Q2193906) (← links)
- Bregman reweighted alternating minimization and its application to image deblurring (Q2224931) (← links)
- Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property (Q2231349) (← links)
- A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems (Q2307744) (← links)
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization (Q2425169) (← links)
- Exploiting Efficient Representations in Large-Scale Tensor Decompositions (Q4631411) (← links)
- A general system for heuristic minimization of convex functions over non-convex sets (Q4638917) (← links)
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints (Q4976346) (← links)
- An Alternating Augmented Lagrangian method for constrained nonconvex optimization (Q5113713) (← links)
- A simple effective heuristic for embedded mixed-integer quadratic programming (Q5207801) (← links)
- A TT-Based Hierarchical Framework for Decomposing High-Order Tensors (Q5221033) (← links)