scholarly journals Algorithm for Solutions of Nonlinear Equations of Strongly Monotone Type and Applications to Convex Minimization and Variational Inequality Problems

2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Mathew O. Aibinu ◽  
Surendra C. Thakur ◽  
Sibusiso Moyo

Real-life problems are governed by equations which are nonlinear in nature. Nonlinear equations occur in modeling problems, such as minimizing costs in industries and minimizing risks in businesses. A technique which does not involve the assumption of existence of a real constant whose calculation is unclear is used to obtain a strong convergence result for nonlinear equations of p,η-strongly monotone type, where η>0,p>1. An example is presented for the nonlinear equations of p,η-strongly monotone type. As a consequence of the main result, the solutions of convex minimization and variational inequality problems are obtained. This solution has applications in other fields such as engineering, physics, biology, chemistry, economics, and game theory.

Mathematics ◽  
2020 ◽  
Vol 8 (2) ◽  
pp. 271 ◽  
Author(s):  
Ramandeep Behl ◽  
Ioannis K. Argyros

Many real-life problems can be reduced to scalar and vectorial nonlinear equations by using mathematical modeling. In this paper, we introduce a new iterative family of the sixth-order for a system of nonlinear equations. In addition, we present analyses of their convergences, as well as the computable radii for the guaranteed convergence of them for Banach space valued operators and error bounds based on the Lipschitz constants. Moreover, we show the applicability of them to some real-life problems, such as kinematic syntheses, Bratu’s, Fisher’s, boundary value, and Hammerstein integral problems. We finally wind up on the ground of achieved numerical experiments, where they perform better than other competing schemes.


1997 ◽  
Vol 10 (3) ◽  
pp. 289-295 ◽  
Author(s):  
Ram U. Verma

The solvability of a class of generalized nonlinear variational inequality problems involving multivalued, strongly monotone and strongly Lipschitz (a special type) operators, which are closely associated with generalized nonlinear complementarily problems, is discussed.


Energies ◽  
2020 ◽  
Vol 13 (12) ◽  
pp. 3292 ◽  
Author(s):  
Habib ur Rehman ◽  
Poom Kumam ◽  
Meshal Shutaywi ◽  
Nasser Aedh Alreshidi ◽  
Wiyada Kumam

This manuscript aims to incorporate an inertial scheme with Popov’s subgradient extragradient method to solve equilibrium problems that involve two different classes of bifunction. The novelty of our paper is that methods can also be used to solve problems in many fields, such as economics, mathematical finance, image reconstruction, transport, elasticity, networking, and optimization. We have established a weak convergence result based on the assumption of the pseudomonotone property and a certain Lipschitz-type cost bifunctional condition. The stepsize, in this case, depends upon on the Lipschitz-type constants and the extrapolation factor. The bifunction is strongly pseudomonotone in the second method, but stepsize does not depend on the strongly pseudomonotone and Lipschitz-type constants. In contrast, the first convergence result, we set up strong convergence with the use of a variable stepsize sequence, which is decreasing and non-summable. As the application, the variational inequality problems that involve pseudomonotone and strongly pseudomonotone operator are considered. Finally, two well-known Nash–Cournot equilibrium models for the numerical experiment are reviewed to examine our convergence results and show the competitive advantage of our suggested methods.


Axioms ◽  
2020 ◽  
Vol 9 (4) ◽  
pp. 127
Author(s):  
Wiyada Kumam ◽  
Kanikar Muangchoo

A number of applications from mathematical programmings, such as minimization problems, variational inequality problems and fixed point problems, can be written as equilibrium problems. Most of the schemes being used to solve this problem involve iterative methods, and for that reason, in this paper, we introduce a modified iterative method to solve equilibrium problems in real Hilbert space. This method can be seen as a modification of the paper titled “A new two-step proximal algorithm of solving the problem of equilibrium programming” by Lyashko et al. (Optimization and its applications in control and data sciences, Springer book pp. 315–325, 2016). A weak convergence result has been proven by considering the mild conditions on the cost bifunction. We have given the application of our results to solve variational inequality problems. A detailed numerical study on the Nash–Cournot electricity equilibrium model and other test problems is considered to verify the convergence result and its performance.


2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Parin Chaipunya ◽  
Konrawut Khammahawong ◽  
Poom Kumam

AbstractThe main purpose of this paper is to introduce a new iterative algorithm to solve inclusion problems in Hadamard manifolds. Moreover, applications to convex minimization problems and variational inequality problems are studied. A numerical example also is presented to support our main theorem.


Mathematics ◽  
2020 ◽  
Vol 8 (10) ◽  
pp. 1809 ◽  
Author(s):  
Ramandeep Behl ◽  
Samaher Khalaf Alharbi ◽  
Fouad Othman Mallawi ◽  
Mehdi Salimi

Finding higher-order optimal derivative-free methods for multiple roots (m≥2) of nonlinear expressions is one of the most fascinating and difficult problems in the area of numerical analysis and Computational mathematics. In this study, we introduce a new fourth order optimal family of Ostrowski’s method without derivatives for multiple roots of nonlinear equations. Initially the convergence analysis is performed for particular values of multiple roots—afterwards it concludes in general form. Moreover, the applicability and comparison demonstrated on three real life problems (e.g., Continuous stirred tank reactor (CSTR), Plank’s radiation and Van der Waals equation of state) and two standard academic examples that contain the clustering of roots and higher-order multiplicity (m=100) problems, with existing methods. Finally, we observe from the computational results that our methods consume the lowest CPU timing as compared to the existing ones. This illustrates the theoretical outcomes to a great extent of this study.


Sign in / Sign up

Export Citation Format

Share Document