نتایج جستجو برای: single valued complementarity problem
تعداد نتایج: 1716462 فیلتر نتایج به سال:
The extended linear complementarity problem and linear complementary-slackness systems * B. De Schutter If you want to cite this report, please use the following reference instead: B. De Schutter, " The extended linear complementarity problem and linear complementary-slackness systems, "
In this paper we study a rst-order and a high-order algorithm for solving linear complementarity problems. These algorithms are implicitly associated with a large neighborhood whose size may depend on the dimension of the problems. The complexity of these algorithms depends on the size of the neighborhood. For the rst order algorithm, we achieve the complexity bound which the typical large-step...
among numerous np-hard problems, the traveling salesman problem (tsp) has been one of the most explored, yet unknown one. even a minor modification changes the problem’s status, calling for a different solution. the generalized traveling salesman problem (gtsp)expands the tsp to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...
In this paper, we introduce and study a class of generalized nonlinear complementarity problems and construct an iterative algorithm, called the Noor iterations with errors, by using the change of variables technique. We establish the existence and uniqueness of solution of the generalized nonlinear complementarity problem and the convergence and stability of iterative sequence generated by the...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید