Results 21 to 30 of about 274 (60)
Analytic Center Cutting Plane Methods for Variational Inequalities over Convex Bodies [PDF]
Journal of Inequalities and Applications, 2018, 2017 An analytic center cutting plane method is an iterative algorithm based on the computation of analytic centers. In this paper, we propose some analytic center cutting plane methods for solving quasimonotone or pseudomonotone variational inequalities whose domains are bounded or unbounded convex bodies.
arxiv +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
The almost semimonotone matrices
Special Matrices, 2019 A (strictly) semimonotone matrix A ∈ ℝn×n is such that for every nonzero vector x ∈ ℝn with nonnegative entries, there is an index k such that xk > 0 and (Ax)k is nonnegative (positive).
Wendler Megan
doaj +1 more source
On the nonlinear implicit complementarity problem
, 1992 International Journal of Mathematics and Mathematical Sciences, Volume 16, Issue 4, Page 783-789, 1993.
A. H. Siddiqi, Q. H. Ansari
wiley +1 more source
On some properties of $ω$-uniqueness in tensor complementarity problem [PDF]
arXiv, 2022 In this article we introduce column adequate tensor in the context of tensor complementarity problem and consider some important properties. The tensor complementarity problem is a class of nonlinear complematarity problems with the involved function being defined by a tensor.
arxiv
Pivoting in Linear Complementarity: Two Polynomial-Time Cases [PDF]
Discrete Comput. Geom., 42(2), pp. 187-205, 2009, 2008 We study the behavior of simple principal pivoting methods for the P-matrix linear complementarity problem (P-LCP). We solve an open problem of Morris by showing that Murty's least-index pivot rule (under any fixed index order) leads to a quadratic number of iterations on Morris's highly cyclic P-LCP examples.
arxiv +1 more source
Quadratic convergence of monotone iterates for semilinear elliptic obstacle problems
Journal of Inequalities and Applications, 2017 In this paper, we consider the numerical solution for the discretization of semilinear elliptic complementarity problems. A monotone algorithm is established based on the upper and lower solutions of the problem.
Jinping Zeng, Haowen Chen, Hongru Xu
doaj +1 more source
Resolvents of equilibrium problems in a complete geodesic space with negative curvature [PDF]
arXiv, 2022 In this paper, we propose a resolvent of an equilibrium problem in a geodesic space with negative curvature having the convex hull finite property. We prove its well-definedness as a single-valued mapping whose domain is whole space, and study the fundamental properties.
arxiv
Combinatorial Characterizations of K-matrices [PDF]
Linear Algebra Appl., 434, pp. 68-80, 2011, 2009 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. Our proof is elementary and simplifies the original proof substantially by exploiting the duality of oriented matroids.
arxiv +1 more source
Counting Unique-Sink Orientations [PDF]
Discrete Appl. Math., 163/2, pp. 155-164, 2014, 2010 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. We summarise old and show new lower and upper bounds on the sizes of some such classes.
arxiv +1 more source