The algorithm iteratively solves and updates a problem closely related to the original assignment problem and maps its solution into the solution space of the original problem.
Thus, either a shift-and-invert technique that transforms the problem and maps the desired eigenvalue to the periphery is necessary or other techniques like Newton's method [37, 38] or the Jacobi-Davidson method [39, 40] have to be used.
Bin-packing, set partitioning, set covering, combinatorial design problems, circuits and mapping problems are some of them.
The Differential Quadrature (DQ) method is utilized for solving the mathematical problem and isogeometric mapping is implemented for the nonlinear mapping of complex shapes.
Under the new rules, each city administration must appoint an anti-corruption compliance officer to monitor problems and map out new anti-graft and transparency plans.
Recently, Takahashi and Takahashi [12] considered the equilibrium problem and nonexpansive mapping by viscosity approximation methods.
On the other hand, Takahashi and Takahashi [18] considered the generalized equilibrium problem and nonexpansive mapping in a Hilbert space.
This paper focuses mainly on a split equilibrium problem and nonexpansive mapping involving pseudomonotone and monotone equilibrium bifunctions in real Hilbert spaces.
Two linesearch algorithms for solving a split equilibrium problem and nonexpansive mapping (operatorname{SEPNM}(C, Q, A, f, g, S, T)) in Hilbert spaces have been proposed, in which the bifunction f is pseudomonotone on C with respect to its solution set, the bifunction g is monotone on Q, and S and T are nonexpansive mappings.
Moreover, applications to a more general system of variational inequalities, the constrained convex minimization problem and K-mapping are included.
