A Levenberg-Marquardt method for solving the tensor split feasibility problem

DOI10.1007/s40305-020-00337-2zbMath1488.90206OpenAlexW3126340075MaRDI QIDQ2059189

Jin-Ling Zhao, Yu-Xuan Jin

Publication date: 13 December 2021

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-020-00337-2

zbMATH Keywords

tensorprojectionLevenberg-Marquardt methodsplit feasibility problemsemi-symmetric

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hybrid CQ projection algorithm with line-search process for the split feasibility problem
• On the convergence analysis of two-step modulus-based matrix splitting iteration method for linear complementarity problems
• Several acceleration schemes for solving the multiple-sets split feasibility problem
• Modified modulus-based matrix splitting algorithms for a class of weakly nondifferentiable nonlinear complementarity problems
• A note on the Levenberg-Marquardt parameter
• A multiprojection algorithm using Bregman projections in a product space
• Global uniqueness and solvability of tensor variational inequalities
• A Levenberg-Marquardt method for solving semi-symmetric tensor equations
• On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
• Accelerated modulus-based matrix splitting iteration method for a class of nonlinear complementarity problems
• Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
• Connectedness of the solution set of the tensor complementarity problem
• Solving sparse non-negative tensor equations: algorithms and applications
• Self-adaptive projection method for co-coercive variational inequalities
• Inertial accelerated algorithms for solving a split feasibility problem
• Solving multi-linear systems with \(\mathcal {M}\)-tensors
• Eigenvalues of a real supersymmetric tensor
• The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
• Self-adaptive projection methods for the multiple-sets split feasibility problem
• The multiple-sets split feasibility problem and its applications for inverse problems
• A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• Algorithm 862
• A self-adaptive projection method for solving the multiple-sets split feasibility problem
• An Algorithm for Least-Squares Estimation of Nonlinear Parameters
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Iterative oblique projection onto convex sets and the split feasibility problem
• The Modulus-Based Levenberg-Marquardt Method for Solving Linear Complementarity Problem
• A self-adaptive projection-type method for nonlinear multiple-sets split feasibility problem

This page was built for publication: A Levenberg-Marquardt method for solving the tensor split feasibility problem