Results 31 to 40 of about 137 (132)
New error bounds for linear complementarity problems of Σ-SDD matrices and SB-matrices
Open Mathematics, 2019 A new error bound for the linear complementarity problem (LCP) of Σ-SDD matrices is given, which depends only on the entries of the involved matrices. Numerical examples are given to show that the new bound is better than that provided by García-Esnaola ...
Hou Zhiwu, Jing Xia, Gao Lei
doaj +1 more source
Iterative methods for nonlinear quasi complementarity problems
International Journal of Mathematics and Mathematical Sciences, Volume 10, Issue 2, Page 339-344, 1987., 1986 In this paper, we consider and study an iterative algorithm for finding the approximate solution of the nonlinear quasi complementarity problem of finding u ϵ k(u) such that where m is a point‐to‐point mapping, T is a (nonlinear) continuous mapping from a real Hilbert space H into itself and k*(u) is the polar cone of the convex cone k(u) in H. We also
Muhammad Aslam Noor
wiley +1 more source
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
Joint location and pricing within a user-optimized environment
EURO Journal on Computational Optimization, 2020 In the design of service facilities, whenever the behaviour of customers is impacted by queueing or congestion, the resulting equilibrium cannot be ignored by a firm that strives to maximize revenue within a competitive environment.
Teodora Dan +2 more
doaj +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
Continuity and maximal quasimonotonicity of normal cone operators
, 2022 In this paper, we study some properties of the adjusted normal cone operator of quasiconvex functions. In particular, we introduce a new notion of maximal quasimotonicity for set-valued maps different from similar ones recently appeared in literature ...
BIANCHI, Monica +2 more
core +1 more source
A new smoothing method for solving nonlinear complementarity problems
Open Mathematics, 2019 In this paper, a new improved smoothing Newton algorithm for the nonlinear complementarity problem was proposed. This method has two-fold advantages. First, compared with the classical smoothing Newton method, our proposed method needn’t nonsingular of ...
Zhu Jianguang, Hao Binbin
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
A globally convergent algorithm for MPCC
EURO Journal on Computational Optimization, 2015 We propose a penalty formulation based on the new regularization scheme for mathematical programs with complementarity constraints (MPCCs). We present an active set method which solves a sequence of penalty-regularized problems.
Abdeslam Kadrani +2 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