Results 31 to 40 of about 651 (102)
Projective algorithms for solving complementarity problems
International Journal of Mathematics and Mathematical Sciences, Volume 29, Issue 2, Page 99-113, 2002., 2002 We present robust projective algorithms of the von Neumann type for the linear complementarity problem and for the generalized linear complementarity problem. The methods, an extension of Projections Onto Convex Sets (POCS) are applied to a class of problems consisting of finding the intersection of closed nonconvex sets. We give conditions under which
Caroline N. Haddad, George J. Habetler
wiley +1 more source
A primal-dual approach of weak vector equilibrium problems
Open Mathematics, 2018 In this paper we provide some new sufficient conditions that ensure the existence of the solution of a weak vector equilibrium problem in Hausdorff topological vector spaces ordered by a cone.
László Szilárd
doaj +1 more source
Generalized strongly set‐valued nonlinear complementarity problems
International Journal of Mathematics and Mathematical Sciences, Volume 22, Issue 3, Page 597-604, 1999., 1999 In this paper, we introduce a new class of generalized strongly set‐valued nonlinear complementarity problems and construct new iterative algorithms. We show the existence of solutions for this kind of nonlinear complementarity problems and the convergence of iterative sequences generated by the algorithm. Our results extend some recent results in this
Nan-Jing Huang, Yeol Je Cho
wiley +1 more source
On the spherical convexity of quadratic functions [PDF]
, 2018 In this paper we study the spherical convexity of quadratic functions on spherically convex sets. In particular, conditions characterizing the spherical convexity of quadratic functions on spherical convex sets associated to the positive orthants and ...
Ferreira, O. P., Németh, S. Z.
core +2 more sources
A penalty method and a regularization strategy to solve MPCC [PDF]
, 2011 The goal of this paper is to solve mathematical programme with complementarity constraints using nonlinear programming techniques. This work presents two algorithms based on several nonlinear techniques such as sequential quadratic programming, penalty ...
Matias, João L. H. +2 more
core +1 more source
Counting Unique-Sink Orientations [PDF]
, 2013 Unique-sink orientations (USOs) are an abstract class of orientations of the n-cube graph. We consider some classes of USOs that are of interest in connection with the linear complementarity problem.
Bernd Gärtner +27 more
core +3 more sources
Combinatorial Characterizations of K-matrices [PDF]
, 2010 We present a number of combinatorial characterizations of K-matrices. This extends a theorem of Fiedler and Ptak on linear-algebraic characterizations of K-matrices to the setting of oriented matroids.
Berman +23 more
core +3 more sources
Open Mathematics, 2017 Some new error bounds for the linear complementarity problems are obtained when the involved matrices are weakly chained diagonally dominant B-matrices. Numerical examples are given to show the effectiveness of the proposed bounds.
Sun Deshu, Wang Feng
doaj +1 more source
, 2017 Recently, M. Bouafoa, et al. [3] investigated a new kernel function which differs from the self-regular kernel functions. The kernel function has a trigonometric Barrier Term. In this paper we generalize the analysis presented in the above paper for P∗(κ)
M. E. Ghami, G. Q. Wang
semanticscholar +1 more source
Demonstratio Mathematica, 2019 We consider a new subgradient extragradient iterative algorithm with inertial extrapolation for approximating a common solution of variational inequality problems and fixed point problems of a multivalued demicontractive mapping in a real Hilbert space ...
Jolaoso Lateef Olakunle +3 more
doaj +1 more source