A Levenberg-Marquardt method for solving the tensor split feasibility problem
type: Item
instance of: scholarly article
title: A Levenberg-Marquardt method for solving the tensor split feasibility problem
zbMATH Open document ID: 1488.90206
author: Yu-Xuan Jin
author: Jinling Zhao
published in: Journal of the Operations Research Society of China
publication date: 2021-12-13T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 65K10
zbMATH DE Number: 7443757
zbMATH Keywords: tensor
zbMATH Keywords: split feasibility problem
zbMATH Keywords: semi-symmetric
zbMATH Keywords: projection
zbMATH Keywords: Levenberg-Marquardt method
MaRDI profile type: Publication
full work available at URL: s40305-020-00337-2
OpenAlex ID: W3126340075
cites work: Algorithm 862
cites work: Iterative oblique projection onto convex sets and the split feasibility problem
cites work: A unified treatment of some iterative algorithms in signal processing and image reconstruction
cites work: A multiprojection algorithm using Bregman projections in a product space
cites work: The multiple-sets split feasibility problem and its applications for inverse problems
cites work: The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
cites work: Hybrid CQ projection algorithm with line-search process for the split feasibility problem
cites work: Inertial accelerated algorithms for solving a split feasibility problem
cites work: Solving multi-linear systems with \(\mathcal {M}\)-tensors
cites work: A note on the Levenberg-Marquardt parameter
cites work: On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
cites work: Self-adaptive projection method for co-coercive variational inequalities
cites work: Q5142522
cites work: The Modulus-Based Levenberg-Marquardt Method for Solving Linear Complementarity Problem
cites work: Accelerated modulus-based matrix splitting iteration method for a class of nonlinear complementarity problems
cites work: On the convergence analysis of two-step modulus-based matrix splitting iteration method for linear complementarity problems
cites work: Solving sparse non-negative tensor equations: algorithms and applications
cites work: Connectedness of the solution set of the tensor complementarity problem
cites work: A self-adaptive projection-type method for nonlinear multiple-sets split feasibility problem
cites work: A Levenberg-Marquardt method for solving semi-symmetric tensor equations
cites work: Modified modulus-based matrix splitting algorithms for a class of weakly nondifferentiable nonlinear complementarity problems
cites work: An Algorithm for Least-Squares Estimation of Nonlinear Parameters
cites work: Eigenvalues of a real supersymmetric tensor
cites work: Global uniqueness and solvability of tensor variational inequalities
cites work: A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
cites work: Q2765625
cites work: Q4767830
cites work: A self-adaptive projection method for solving the multiple-sets split feasibility problem
cites work: Self-adaptive projection methods for the multiple-sets split feasibility problem
cites work: Several acceleration schemes for solving the multiple-sets split feasibility problem
cites work: Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
DOI: 10.1007/S40305-020-00337-2
description: scientific article; zbMATH DE number 7443757