Results 31 to 40 of about 274 (60)
Arab Journal of Mathematical Sciences, 2014 In this paper, we introduce and study an implicit iterative method to approximate a common solution of split equilibrium problem and fixed point problem for a nonexpansive semigroup in real Hilbert spaces. Further, we prove that the nets generated by the
K.R. Kazmi, S.H. Rizvi
doaj +1 more source
Demonstratio Mathematica, 2018 The purpose of this paper is to study a split generalized mixed equilibrium problem and a fixed point problem for nonspreading mappings in real Hilbert spaces.We introduce a new iterative algorithm and prove its strong convergence for approximating a ...
Jolaoso Lateef Olakunle +3 more
doaj +1 more source
Convergence results for some piecewise linear solvers [PDF]
arXiv, 2020 Let $A$ be a real $n\times n$ matrix and $z,b\in \mathbb R^n$. The piecewise linear equation system $z-A\vert z\vert = b$ is called an \textit{absolute value equation}. We consider two solvers for this problem, one direct, one semi-iterative, and extend their previously known ranges of convergence.
arxiv
How to Detect and Construct N-matrices [PDF]
arXiv, 2020 N-matrices are real $n\times n$ matrices all of whose principal minors are negative. We provide (i) an $O(2^n)$ test to detect whether or not a given matrix is an N-matrix, and (ii) a characterization of N-matrices, leading to the recursive construction of every N-matrix.
arxiv
Efficient Computation of a Canonical Form for a Generalized P-matrix [PDF]
arXiv, 2012 We use recent results on algorithms for Markov decision problems to show that a canonical form for a generalized P-matrix can be computed, in some important cases, by a strongly polynomial algorithm.
arxiv
Smoothing Methods for Nonlinear Complementarity Problems [PDF]
arXiv, 2010 In this paper, we present a new smoothing approach to solve general nonlinear complementarity problems. Under the $P_0$ condition on the original problems, we prove some existence and convergence results . We also present an error estimate under a new and general monotonicity condition. The numerical tests confirm the efficiency of our proposed methods.
arxiv
A Polynomial-Time Algorithm for the Tridiagonal and Hessenberg P-Matrix Linear Complementarity Problem [PDF]
arXiv, 2011 We give a polynomial-time dynamic programming algorithm for solving the linear complementarity problem with tridiagonal or, more generally, Hessenberg P-matrices. We briefly review three known tractable matrix classes and show that none of them contains all tridiagonal P-matrices.
arxiv
How to project onto the monotone nonnegative cone using Pool Adjacent Violators type algorithms [PDF]
arXiv, 2012 The metric projection onto an order nonnegative cone from the metric projection onto the corresponding order cone is derived. Particularly, we can use Pool Adjacent Violators-type algorithms developed for projecting onto the monotone cone for projecting onto the monotone nonnegative cone too.
arxiv
Hybrid algorithms without the extra-steps for equilibrium problems [PDF]
arXiv, 2015 In this paper, we introduce some new hybrid algorithms for finding a solution of a system of equilibrium problems. In these algorithms, by constructing specially cutting-halfspaces, we avoid using the extra-steps as in the extragradient method and the Armijo linesearch method which are inherently costly when the feasible set has a complex structure ...
arxiv
Demonstratio MathematicaIn this article, we study the split variational inclusion and fixed point problems using Bregman weak relatively nonexpansive mappings in the pp-uniformly convex smooth Banach spaces.
Ngwepe Matlhatsi Dorah +3 more
doaj +1 more source