scholarly journals On the nonlinear implicit complementarity problem

1993 ◽  
Vol 16 (4) ◽  
pp. 783-789 ◽  
Author(s):  
A. H. Siddiqi ◽  
Q. H. Ansari
Keyword(s):  
Exact Solution ◽  
Approximate Solution ◽  
Iterative Algorithm ◽  
Complementarity Problem ◽  
Implicit Complementarity Problem ◽  
New Class ◽  
Special Cases

In this paper, we consider a new class of implicit complementarity problem and study the existence of its solution. An iterative algorithm is also given to find the approximate solution of the new problem and prove that this approximate solution converges to the exact solution. Several special cases are also discussed.

scholarly journals A study on vector variational-like inequalities using convexificators and application to its bi-level form

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Gayatri Pany ◽  
Ram N. Mohapatra
Keyword(s):  
Exact Solution ◽  
Approximate Solution ◽  
Mathematical Programming ◽  
Iterative Algorithm ◽  
Vector Optimization ◽  
Optimization Problem ◽  
Vector Optimization Problem ◽  
Auxiliary Principle ◽  
Auxiliary Principle Technique

<p style='text-indent:20px;'>This paper deals with the weak versions of the vector variational-like inequalities, namely Stampacchia and Minty type under invexity in the framework of convexificators. The connection between both the problems along with the link to vector optimization problem are analyzed. An application to nonconvex mathematical programming has also been presented. Further, the bi-level version of these problems is formulated and a procedure to obtain the solution involving the auxiliary principle technique is described in detail. We have shown that the iterative algorithm with the help of which we get the approximate solution converges strongly to the exact solution of the problem.</p>

scholarly journals On generalised mixed co-quasi-variational inequalities with noncompact valued mappings

2004 ◽  
Vol 70 (1) ◽  
pp. 7-15
Author(s):  
Rais Ahmad ◽  
Qamrul Hasan Ansari ◽  
Syed Shakaib Irfan
Keyword(s):  
Exact Solution ◽  
Variational Inequality ◽  
Variational Inequalities ◽  
Iterative Algorithm ◽  
Approximate Solutions ◽  
Special Cases ◽  
Quasi Variational Inequality

In this paper, we consider generalised mixed co-quasi-variational inequalities with noncompact valued mappings and propose an iterative algorithm for computing their approximate solutions. We prove that the approximate solutions obtained by the proposed algorithm converge to the exact solution of our co-quasi-variational inequality. Some special cases are also discussed.

scholarly journals On certain classes of variational inequalities and related iterative algorithms

1996 ◽  
Vol 9 (1) ◽  
pp. 43-56 ◽  
Author(s):  
Muhammad Aslam Noor
Keyword(s):  
Approximate Solution ◽  
Variational Inequalities ◽  
Unique Solution ◽  
Iterative Algorithm ◽  
Iterative Algorithms ◽  
Projection Technique ◽  
Auxiliary Principle ◽  
Auxiliary Principle Technique ◽  
Special Cases

In this paper, we introduce and study some new classes of variational inequalities and Wiener-Hopf equations. Essentially using the projection technique, we establish the equivalence between the multivalued general quasi-variational inequalities and the multivalued implicit Wiener-Hopf equations. This equivalence enables us to suggest and analyze a number of iterative algorithms for solving multivalued general quasi-variational inequalities. We also consider the auxiliary principle technique to prove the existence of a unique solution of the variational-like inequalities. This technique is used to suggest a general and unified iterative algorithm for computing the approximate solution. Several special cases which can be obtained from our main results are also discussed. The results proved in this paper represent a significant refinement and improvement of the previously known results.

scholarly journals Survival and Reliability Analysis with an Epsilon-Positive Family of Distributions with Applications

Symmetry ◽  
2021 ◽  
Vol 13 (5) ◽  
pp. 908
Author(s):  
Perla Celis ◽  
Rolando de la Cruz ◽  
Claudio Fuentes ◽  
Héctor W. Gómez
Keyword(s):  
Survival Data ◽  
Maximum Likelihood Estimates ◽  
New Class ◽  
New Family ◽  
Gamma Distributions ◽  
Special Cases ◽  
Log Normal ◽  
Positive Support ◽  
Positive Distributions ◽  
Family Of Distributions

We introduce a new class of distributions called the epsilon–positive family, which can be viewed as generalization of the distributions with positive support. The construction of the epsilon–positive family is motivated by the ideas behind the generation of skew distributions using symmetric kernels. This new class of distributions has as special cases the exponential, Weibull, log–normal, log–logistic and gamma distributions, and it provides an alternative for analyzing reliability and survival data. An interesting feature of the epsilon–positive family is that it can viewed as a finite scale mixture of positive distributions, facilitating the derivation and implementation of EM–type algorithms to obtain maximum likelihood estimates (MLE) with (un)censored data. We illustrate the flexibility of this family to analyze censored and uncensored data using two real examples. One of them was previously discussed in the literature; the second one consists of a new application to model recidivism data of a group of inmates released from the Chilean prisons during 2007. The results show that this new family of distributions has a better performance fitting the data than some common alternatives such as the exponential distribution.

scholarly journals A New Class of Estimators Based on a General Relative Loss Function

Mathematics ◽  
2021 ◽  
Vol 9 (10) ◽  
pp. 1138
Author(s):  
Tao Hu ◽  
Baosheng Liang
Keyword(s):  
Loss Function ◽  
Asymptotically Normal ◽  
New Class ◽  
Statistical Inferences ◽  
Relative Loss ◽  
Special Cases ◽  
Class Of Estimators ◽  
Box Cox Transformation ◽  
Loss Estimator ◽  
Prostate Cancer Study

Motivated by the relative loss estimator of the median, we propose a new class of estimators for linear quantile models using a general relative loss function defined by the Box–Cox transformation function. The proposed method is very flexible. It includes a traditional quantile regression and median regression under the relative loss as special cases. Compared to the traditional linear quantile estimator, the proposed estimator has smaller variance and hence is more efficient in making statistical inferences. We show that, in theory, the proposed estimator is consistent and asymptotically normal under appropriate conditions. Extensive simulation studies were conducted, demonstrating good performance of the proposed method. An application of the proposed method in a prostate cancer study is provided.

scholarly journals On a Generalization of One-Dimensional Kinetics

Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1264
Author(s):  
Vladimir V. Uchaikin ◽  
Renat T. Sibatov ◽  
Dmitry N. Bezbatko
Keyword(s):  
Exact Solution ◽  
Asymptotic Behavior ◽  
Constant Velocity ◽  
Telegraph Equation ◽  
Material Derivative ◽  
Symmetric Random Walk ◽  
One Dimensional ◽  
Special Cases ◽  
Fractional Telegraph Equation ◽  
Asymmetric Case

One-dimensional random walks with a constant velocity between scattering are considered. The exact solution is expressed in terms of multiple convolutions of path-distributions assumed to be different for positive and negative directions of the walk axis. Several special cases are considered when the convolutions are expressed in explicit form. As a particular case, the solution of A. S. Monin for a symmetric random walk with exponential path distribution and its generalization to the asymmetric case are obtained. Solution of fractional telegraph equation with the fractional material derivative is presented. Asymptotic behavior of its solution for an asymmetric case is provided.

scholarly journals Approximated least-squares solutions of a generalized Sylvester-transpose matrix equation via gradient-descent iterative algorithm

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Adisorn Kittisopaporn ◽  
Pattrawut Chansangiam
Keyword(s):  
Least Squares ◽  
Iterative Algorithm ◽  
Gradient Descent ◽  
Main Idea ◽  
Full Column Rank ◽  
Minimum Error ◽  
Matrix Coefficients ◽  
Special Cases ◽  
Efficiency And Effectiveness ◽  
Associated Matrix

AbstractThis paper proposes an effective gradient-descent iterative algorithm for solving a generalized Sylvester-transpose equation with rectangular matrix coefficients. The algorithm is applicable for the equation and its interesting special cases when the associated matrix has full column-rank. The main idea of the algorithm is to have a minimum error at each iteration. The algorithm produces a sequence of approximated solutions converging to either the unique solution, or the unique least-squares solution when the problem has no solution. The convergence analysis points out that the algorithm converges fast for a small condition number of the associated matrix. Numerical examples demonstrate the efficiency and effectiveness of the algorithm compared to renowned and recent iterative methods.

scholarly journals Existence and algorithm of solutions for generalized nonlinear variational-like inequalities

2005 ◽  
Vol 2005 (12) ◽  
pp. 1843-1851 ◽  
Author(s):  
Zeqing Liu ◽  
Juhe Sun ◽  
Soo Hak Shim ◽  
Shin Min Kang
Keyword(s):  
Iterative Algorithm ◽  
Recent Literature ◽  
Existence Of Solutions ◽  
Approximate Solutions ◽  
New Class

We introduce and study a new class of generalized nonlinear variational-like inequalities. Under suitable conditions, we prove the existence of solutions for the class of generalized nonlinear variational-like inequalities. A new iterative algorithm for finding the approximate solutions of the generalized nonlinear variational-like inequality is given and the convergence of the algorithm is also proved. The results presented in this paper improve and generalize some results in recent literature.

scholarly journals Best Proximity Point for Generalized Proximal Weak Contractions in Complete Metric Space

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Erdal Karapınar ◽  
V. Pragadeeswarar ◽  
M. Marudai
Keyword(s):  
Approximate Solution ◽  
Metric Space ◽  
Existence And Uniqueness ◽  
Metric Spaces ◽  
Best Proximity Point ◽  
Complete Metric Space ◽  
Optimal Approximate Solution ◽  
Weak Contraction ◽  
Complete Metric Spaces ◽  
New Class

We introduce a new class of nonself-mappings, generalized proximal weak contraction mappings, and prove the existence and uniqueness of best proximity point for such mappings in the context of complete metric spaces. Moreover, we state an algorithm to determine such an optimal approximate solution designed as a best proximity point. We establish also an example to illustrate our main results. Our result provides an extension of the related results in the literature.

scholarly journals Mixed quasi invex equilibrium problems

2004 ◽  
Vol 2004 (57) ◽  
pp. 3057-3067 ◽  
Author(s):  
Muhammad Aslam Noor
Keyword(s):  
Variational Inequalities ◽  
Equilibrium Problems ◽  
Strong Monotonicity ◽  
Auxiliary Principle ◽  
Auxiliary Principle Technique ◽  
Iterative Schemes ◽  
New Class ◽  
Special Cases ◽  
Weaker Conditions

We introduce a new class of equilibrium problems, known asmixed quasi invex equilibrium(orequilibrium-like) problems. This class of invex equilibrium problems includes equilibrium problems, variational inequalities, and variational-like inequalities as special cases. Several iterative schemes for solving invex equilibrium problems are suggested and analyzed using the auxiliary principle technique. It is shown that the convergence of these iterative schemes requires either pseudomonotonicity or partially relaxed strong monotonicity, which are weaker conditions than the previous ones. As special cases, we also obtained the correct forms of the algorithms for solving variational-like inequalities, which have been considered in the setting of convexity. In fact, our results represent significant and important refinements of the previously known results.

Sign in / Sign up

Export Citation Format

Share Document