A bilevel programming by L_( *, ) - L_F for tensor completion
From MaRDI portal
Publication:7348103
Cites work
- A Multilinear Singular Value Decomposition
- A projected gradient method for \(\alpha\ell_1-\beta\ell_2\) sparsity regularization
- A proximal difference-of-convex algorithm with extrapolation
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
- A Singular Value Thresholding Algorithm for Matrix Completion
- Accurate regularized Tucker decomposition for image restoration
- Bayesian tensor Tucker completion with a flexible core
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Improved iteratively reweighted least squares for unconstrained smoothed _q minimization
- Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Tensor completion by L_-L_F bilevel programming
- Tensor-train decomposition
- The expression of a tensor or a polyadic as a sum of products.
- Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
This page was built for publication: A bilevel programming by \(L_{( *, \epsilon )} - L_F\) for tensor completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7348103)
