Copositivity tests based on the linear complementarity problem [PDF]
, 2014 Copositivity tests are presented based on new necessary and suffcient conditions requiring the solution of linear complementarity problems (LCP). Methodologies involving Lemke's method, an enumerative algorithm and a linear mixed-integer programming ...
Judice, Joaquim +2 more
core
An alternative error bound for linear complementarity problems involving [Formula: see text]-matrices. [PDF]
J Inequal Appl, 2018 Gao L.
europepmc +1 more source
Stability Of Linear Equations Solvers In Interior-Point Methods
, 1994 . Primal-dual interior-point methods for linear complementarity and linear programming problems solve a linear system of equations to obtain a modified Newton step at each iteration.
Stephen J. Wright
core
A new smoothing modified three-term conjugate gradient method for [Formula: see text]-norm minimization problem. [PDF]
J Inequal Appl, 2018 Du S, Chen M.
europepmc +1 more source
On Conditions for Strict Feasibility in Nonlinear Complementarity Problems
, 2000 . The strict feasibility plays an important role in the development of theory and algorithms of complementarity problems. In this paper, we establish sufficient conditions to ensure the strict feasibility of a nonlinear complementarity problem.
D. Li, Y. B. Zhao
core
Error bounds for linear complementarity problems of weakly chained diagonally dominant B-matrices. [PDF]
J Inequal Appl, 2017 Wang F.
europepmc +1 more source
Remarks On The Numerical Solution Of Certain Linear Complementarity Problems
, 2007 . In a recent paper, J. K. Aitchison and N. K. Upton have proposed a mathematical model of the behaviour of a cloud formed immediately after the sudden release of a pollutant, together with an algorithm for determining numerical solutions of the ...
Michele Benzi
core
An improved error bound for linear complementarity problems for B-matrices. [PDF]
J Inequal Appl, 2017 Gao L, Li C.
europepmc +1 more source
Merit Functions and Descent Algorithms for a Class of Variational Inequality Problems
, 1997 . We consider a variational inequality problem, where the cost mapping is the sum of a single-valued mapping and the subdifferential mapping of a convex function. For this problem we introduce a new class of equivalent optimization formulations; based on
Michael Patriksson, Patriksson, Michael
core
Robust solutions to box-constrained stochastic linear variational inequality problem. [PDF]
J Inequal Appl, 2017 Luo MJ, Zhang Y.
europepmc +1 more source