IDENTIFIKASI MISKONSEPSI DALAM MENYELESAIKAN SOAL PERTIDAKSAMAAN LINEAR SATU VARIABEL YANG MEMUAT NILAI MUTLAK

This research aims to describe the forms of student misconceptions and the factors that cause misconceptions experienced by students in solving linear inequality problems with one variable containing absolute values in class X SMA Muhammadiyah 1 Pontianak. The subjects of this research were students of class X IPA 3 SMA Muhammadiyah 1 Pontianak, totaling 25 students. The research uses descriptive method as the research method. Case study is a form of research used. The results of the research revealed that the research subjects experienced five forms of misconception, namely notation misconceptions experienced by 1 student or by 4%, generalizing misconceptions experienced by 3 students or by 12%, misconceptions of the application of rules experienced by 6 students or by 24%, calculation misconceptions experienced by 2 students or by 8%, and specialization misconceptions experienced by 3 students or 12%. The misconceptions experienced by these students are caused by wrong intuition and incomplete reasoning, where students' intuitive thoughts that arise spontaneously when solving problems are still wrong and students' reasoning or logic is still wrong in drawing conclusions and being too broad in generalizing. Keywords: Misconceptions, Two-Tier Diagnostic Test, One Variable Linear Inequality Problem with Absolute Values

Strong Convergence of an Inertial Iterative Algorithm for Generalized Mixed Variational-like Inequality Problem and Bregman Relatively Nonexpansive Mapping in Reflexive Banach Space

In this paper, we consider a generalized mixed variational-like inequality problem and prove a Minty-type lemma for its related auxiliary problems in a real Banach space. We prove the existence of a solution of these auxiliary problems and also prove some properties for the solution set of generalized mixed variational-like inequality problem. Furthermore, we introduce and study an inertial hybrid iterative method for solving the generalized mixed variational-like inequality problem involving Bregman relatively nonexpansive mapping in Banach space. We study the strong convergence for the proposed algorithm. Finally, we list some consequences and computational examples to emphasize the efficiency and relevancy of the main result.

INERTIAL RELAXED TSENG METHOD FOR SOLVING VARIATIONAL INEQUALITY PROBLEM IN HILBERT SPACE

The research efforts of this paper is to present a new inertial relaxed Tseng extrapolation method with weaker conditions for approximating the solution of a variational inequality problem, where the underlying operator is only required to be pseudomonotone. The strongly pseudomonotonicity and inverse strongly monotonicity assumptions which the existing literature used are successfully weakened. The strong convergence of the proposed method to a minimum-norm solution of a variational inequality problem are established. Furthermore, we present an application and some numerical experiments to show the efficiency and applicability of our method in comparison with other methods in the literature.

An Inertial Iterative Algorithm to Find Common Solution of a Split Generalized Equilibrium and a Variational Inequality Problem in Hilbert Spaces

In this paper, we introduce and study an iterative algorithm via inertial and viscosity techniques to find a common solution of a split generalized equilibrium and a variational inequality problem in Hilbert spaces. Further, we prove that the sequence generated by the proposed theorem converges strongly to the common solution of our problem. Furthermore, we list some consequences of our established algorithm. Finally, we construct a numerical example to demonstrate the applicability of the theorem. We emphasize that the result accounted in the manuscript unifies and extends various results in this field of study.

Yosida Complementarity Problem with Yosida Variational Inequality Problem and Yosida Proximal Operator Equation Involving XOR-Operation

Due to the importance of Yosida approximation operator, we generalized the variational inequality problem and its equivalent problems by using Yosida approximation operator. The aim of this work is to introduce and study a Yosida complementarity problem, a Yosida variational inequality problem, and a Yosida proximal operator equation involving XOR-operation. We prove an existence result together with convergence analysis for Yosida proximal operator equation involving XOR-operation. For this purpose, we establish an algorithm based on fixed point formulation. Our approach is based on a proximal operator technique involving a subdifferential operator. As an application of our main result, we provide a numerical example using the MATLAB program R2018a. Comparing different iterations, a computational table is assembled and some graphs are plotted to show the convergence of iterative sequences for different initial values.

An explicit extragradient algorithm for solving variational inequality problem with application

In this paper, we introduce a new explicit extragradient algorithm for solving Variational Inequality Problem (VIP) in Banach spaces. The proposed algorithm uses a linesearch method whose inner iterations are independent of any projection onto feasible sets. Under standard and mild assumption of pseudomonotonicity and uniform continuity of the VIP associated operator, we establish the strong convergence of the scheme. Further, we apply our algorithm to find an equilibrium point with minimal environmental cost for a model in electricity production. Finally, a numerical result is presented to illustrate the given model. Our result extends, improves and unifies other related results in the literature.

On the Parallel Subgradient Extragradient Rule for Solving Systems of Variational Inequalities in Hadamard Manifolds

In a Hadamard manifold, let the VIP and SVI represent a variational inequality problem and a system of variational inequalities, respectively, where the SVI consists of two variational inequalities which are of symmetric structure mutually. This article designs two parallel algorithms to solve the SVI via the subgradient extragradient approach, where each algorithm consists of two parts which are of symmetric structure mutually. It is proven that, if the underlying vector fields are of monotonicity, then the sequences constructed by these algorithms converge to a solution of the SVI. We also discuss applications of these algorithms for approximating solutions to the VIP. Our theorems complement some recent and important ones in the literature.