Sparse least squares solutions of multilinear equations
From MaRDI portal
Abstract: In this paper, we propose a sparse least squares (SLS) optimization model for solving multilinear equations, in which the sparsity constraint on the solutions can effectively reduce storage and computation costs. By employing variational properties of the sparsity set, along with differentiation properties of the objective function in the SLS model, the first-order optimality conditions are analyzed in terms of the stationary points. Based on the equivalent characterization of the stationary points, we propose the Newton Hard-Threshold Pursuit (NHTP) algorithm and establish its locally quadratic convergence under some regularity conditions. Numerical experiments conducted on simulated datasets including cases of Completely Positive(CP)-tensors and symmetric strong M-tensors illustrate the efficacy of our proposed NHTP method.
Recommendations
- Sparse least squares solutions of tensor equations
- A proximal point like method for solving tensor least-squares problems
- A globally and quadratically convergent algorithm for solving multilinear systems with \(\mathcal {M}\)-tensors
- Solving sparse non-negative tensor equations: algorithms and applications
- Tensor Methods for Large, Sparse Nonlinear Least Squares Problems
Cited in
(5)- Sparse least squares solutions of tensor equations
- Neural networks for solving least squares solution of polynomial systems with time-varying tensors
- A linearized alternating direction method of multipliers for solving complex semi-symmetric tensor equations and its applications
- An ADMM-based interior point method for solving nonnegative tensor least squares problems and its applications
- On the multilinear systems. I: Comparison of splittings of tensors
This page was built for publication: Sparse least squares solutions of multilinear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6405214)
