Results 71 to 80 of about 145 (134)

A Theoretical And Numerical Comparison Of Some Semismooth Algorithms For Complementarity Problems

, 1997
: In this paper we introduce a general line search scheme which easily allows us to define and analyze known and new semismooth algorithms for the solution of nonlinear complementarity problems.
Tecla De Luca, Fondazione Ugo Bordoni, Francisco Facchinei, Christian Kanzow   +3 more
core  

On the Convergence of the Iteration Sequence of Infeasible Path Following Algorithms for Linear Complementarity Problems

, 1996
A generalized class of infeasible-interior-point methods for solving horizontal linear complementarity problem is analyzed and sufficient conditions are given for the convergence of the sequence of iterates produced by methods in this class.
J. Frédéric Bonnans, Florian A. Potra
core  

A New Unconstrained Differentiable Merit Function for Box Constrained Variational Inequality Problems and a Damped Gauss-Newton Method

, 1998
In this paper we propose a new unconstrained differentiable merit function f for box constrained variational inequality problems VIP(l; u; F ). We study various desirable properties of this new merit function f and propose a Gauss-Newton method in which ...
Robert S. Womersley, Defeng Sun
core  

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, Bras, Carmo, Eichfelder, Gabriele   +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

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 the Solution of the Extended Linear Complementarity Problem

, 1998
The extended linear complementarity problem (XLCP) has been introduced in a recent paper by Mangasarian and Pang. In the present research, minimization problems with simple bounds associated to this problem are defined.
Roberto Andreani
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

A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems

, 2003
The Second-Order Cone Complementarity Problem (SOCCP) is a wide class of problems containing the Nonlinear Complementarity Problem (NCP) and the Second-Order Cone Programming Problem (SOCP).
Nobuo Yamashita, Shunsuke Hayashi, Masao Fukushima   +2 more
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