Results 11 to 20 of about 88 (86)
Relations between Abs-Normal NLPs and MPCCs. Part 2: Weak Constraint Qualifications [PDF]
Journal of Nonsmooth Analysis and Optimization, 2021 This work continues an ongoing effort to compare non-smooth optimization problems in abs-normal form to Mathematical Programs with Complementarity Constraints (MPCCs).
Lisa C. Hegerhorst-Schultchen +2 more
doaj +1 more source
Demonstratio Mathematica, 2020 In this work, we introduce two new inertial-type algorithms for solving variational inequality problems (VIPs) with monotone and Lipschitz continuous mappings in real Hilbert spaces.
Alakoya Timilehin Opeyemi +2 more
doaj +1 more source
Demonstratio Mathematica, 2021 In this paper, we introduce a self-adaptive projection method for finding a common element in the solution set of variational inequalities (VIs) and fixed point set for relatively nonexpansive mappings in 2-uniformly convex and uniformly smooth real ...
Jolaoso Lateef Olakunle
doaj +1 more source
Open Mathematics, 2022 In this paper, we study the problem of finding a common solution of the pseudomonotone variational inequality problem and fixed point problem for demicontractive mappings.
Uzor Victor Amarachi +2 more
doaj +1 more source
Least Change Secant Update Methods for Nonlinear Complementarity Problem
Ingeniería y Ciencia, 2015 In this work, we introduce a family of Least Change Secant Update Methods for solving Nonlinear Complementarity Problems based on its reformulation as a nonsmooth system using the one-parametric class of nonlinear complementarity functions introduced by ...
Favián Arenas A +2 more
doaj +1 more source
Forward‐backward resolvent splitting methods for general mixed variational inequalities
International Journal of Mathematics and Mathematical Sciences, Volume 2003, Issue 43, Page 2759-2770, 2003., 2003 We use the technique of updating the solution to suggest and analyze a class of new splitting methods for solving general mixed variational inequalities. It is shown that these modified methods converge for pseudomonotone operators, which is a weaker condition than monotonicity. Our methods differ from the known three‐step forward‐backward splitting of
Muhammad Aslam Noor +2 more
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
M-matrix and inverse M-matrix extensions
Special Matrices, 2020 A class of matrices that simultaneously generalizes the M-matrices and the inverse M-matrices is brought forward and its properties are reviewed. It is interesting to see how this class bridges the properties of the matrices it generalizes and provides a
McDonald J.J. +6 more
doaj +1 more source
Asymptotic stationarity and regularity for nonsmooth optimization problems [PDF]
Journal of Nonsmooth Analysis and Optimization, 2020 Based on the tools of limiting variational analysis, we derive a sequential necessary optimality condition for nonsmooth mathematical programs which holds without any additional assumptions. In order to ensure that stationary points in this new sense are
Patrick Mehlitz
doaj +1 more source
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