A Levenberg-Marquardt method for solving the tensor split feasibility problem
From MaRDI portal
Publication:2059189
Recommendations
- Semidefinite relaxation algorithm for solving tensor split feasibility problem
- A Levenberg-Marquardt method for solving semi-symmetric tensor equations
- scientific article; zbMATH DE number 7313891
- The split feasibility problem and its solution algorithm
- A splitting-relaxed projection method for solving the split feasibility problem
Cites work
- A Levenberg-Marquardt method for solving semi-symmetric tensor equations
- A multiprojection algorithm using Bregman projections in a product space
- A note on the Levenberg-Marquardt parameter
- A self-adaptive projection method for solving the multiple-sets split feasibility problem
- A self-adaptive projection-type method for nonlinear multiple-sets split feasibility problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Accelerated modulus-based matrix splitting iteration method for a class of nonlinear complementarity problems
- Algorithm 862
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- Connectedness of the solution set of the tensor complementarity problem
- Eigenvalues of a real supersymmetric tensor
- Global uniqueness and solvability of tensor variational inequalities
- scientific article; zbMATH DE number 1694914 (Why is no real title available?)
- scientific article; zbMATH DE number 3441150 (Why is no real title available?)
- Hybrid CQ projection algorithm with line-search process for the split feasibility problem
- Inertial accelerated algorithms for solving a split feasibility problem
- Iterative oblique projection onto convex sets and the split feasibility problem
- Modified modulus-based matrix splitting algorithms for a class of weakly nondifferentiable nonlinear complementarity problems
- Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
- On the convergence analysis of two-step modulus-based matrix splitting iteration method for linear complementarity problems
- On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
- Self-adaptive projection method for co-coercive variational inequalities
- Self-adaptive projection methods for the multiple-sets split feasibility problem
- Several acceleration schemes for solving the multiple-sets split feasibility problem
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- Solving sparse non-negative tensor equations: algorithms and applications
- The modulus-based Levenberg-Marquardt method for solving linear complementarity problem
- The multiple-sets split feasibility problem and its applications for inverse problems
- The selective projection method for convex feasibility and split feasibility problems
- The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
Cited in
(5)- A Levenberg-Marquardt method for solving semi-symmetric tensor equations
- A two-step accelerated Levenberg-Marquardt method for solving multilinear systems in tensor-train format
- Semidefinite relaxation algorithm for solving tensor split feasibility problem
- scientific article; zbMATH DE number 7313891 (Why is no real title available?)
- A unified relaxation method for tensor split feasibility problems on unions of sets
This page was built for publication: A Levenberg-Marquardt method for solving the tensor split feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2059189)
