Meenakshi Gugnani
Meenakshi Gugnani has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Anjali
Maharshi Dayanand University, Rohtak
1 shared publication - Charu Batra
Department of Mathematics, Maharshi Dayanand University, Rohtak 124001, India
1 shared publication - Nishu Gupta
Department of Mathematics, Government College, Julana, Jind, 126101, India
1 shared publication
Latest Publications
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Numerical Algebra, Control & Optimization
- Vol. 15 (3) , 823-842
Tseng type iterative algorithm for generalized variational inequality and variational inclusion problems with applications
In this paper, we find the common solution of generalized variational inequality problem and variational inclusion problem. We propose a novel iterative algorithm based on modification of Tseng type method and obtain strong convergence result under certain mild conditions in the frame of real Hilbert spaces. The suggested algorithm does not require prior knowledge of the Lipschitz constant of the associated monotone operator. We apply our result for solving convex minimization problem and split feasibility problem. Moreover, we provide numerical experiment to support our result and compare it with other existing methods.
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Numerical Algebra, Control & Optimization
- Vol. 15 (3) , 823-842
Tseng type iterative algorithm for generalized variational inequality and variational inclusion problems with applications
In this paper, we find the common solution of generalized variational inequality problem and variational inclusion problem. We propose a novel iterative algorithm based on modification of Tseng type method and obtain strong convergence result under certain mild conditions in the frame of real Hilbert spaces. The suggested algorithm does not require prior knowledge of the Lipschitz constant of the associated monotone operator. We apply our result for solving convex minimization problem and split feasibility problem. Moreover, we provide numerical experiment to support our result and compare it with other existing methods.
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Numerical Algebra, Control & Optimization
- Vol. 15 (3) , 785-799
Strong convergence theorem for new four-step iterative method
In this paper, we introduce a new iterative method, namely the J-New iterative method. We prove its strong convergence result using a contractive condition. We also study the stability of the J-New iterative method. We present a comparison theorem showing that the J-New method converges faster than the J-Hammad method. Moreover, we give numerical examples to validate the performance of our algorithm and compare the rate of convergence of the J-New algorithm with the J-Hammad, J-Khan, J-SP, J-Noor, J-Ishikawa, and J-Mann algorithms. Specifically, we show that the convergence rate of the J-New method is superior to that of the other methods mentioned, establishing it as the most efficient among the compared iterative techniques. Also, we give an application of our main result.
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Numerical Algebra, Control & Optimization
- Vol. 15 (3) , 785-799
Strong convergence theorem for new four-step iterative method
In this paper, we introduce a new iterative method, namely the J-New iterative method. We prove its strong convergence result using a contractive condition. We also study the stability of the J-New iterative method. We present a comparison theorem showing that the J-New method converges faster than the J-Hammad method. Moreover, we give numerical examples to validate the performance of our algorithm and compare the rate of convergence of the J-New algorithm with the J-Hammad, J-Khan, J-SP, J-Noor, J-Ishikawa, and J-Mann algorithms. Specifically, we show that the convergence rate of the J-New method is superior to that of the other methods mentioned, establishing it as the most efficient among the compared iterative techniques. Also, we give an application of our main result.
- 1 January 2024
- Published by Vijnana Parishad of India
- Vol. 54 (01) , 88-96
MODIFIED MANN AND VISCOSITY ALGORITHMS FOR ENRICHED NONEXPANSIVE MAPPINGS
This paper examines algorithms for solving fixed point problems for enriched nonexpansive mappings. We combine the inertial technique with our algorithms for a better rate of convergence. Strong convergence of proposed algorithms in a real Hilbert space is proved. We also provide a numerical example to demonstrate that our algorithm defined by equation (3.1) converges more quickly than Modified Kransnoselskii Mann Algorithm (MKMA) [4].
- 1 January 2024
- Published by Vijnana Parishad of India
- Vol. 54 (01) , 88-96
MODIFIED MANN AND VISCOSITY ALGORITHMS FOR ENRICHED NONEXPANSIVE MAPPINGS
This paper examines algorithms for solving fixed point problems for enriched nonexpansive mappings. We combine the inertial technique with our algorithms for a better rate of convergence. Strong convergence of proposed algorithms in a real Hilbert space is proved. We also provide a numerical example to demonstrate that our algorithm defined by equation (3.1) converges more quickly than Modified Kransnoselskii Mann Algorithm (MKMA) [4].