Results 71 to 80 of about 140 (134)
Locating the least 2-norm solution of linear programs via a path-following methods
, 2002 . A linear program has a unique least 2-norm solution provided that the linear program has a solution. To locate this solution, most of the existing methods were devised to solve certain equivalent perturbed quadratic programs or unconstrained ...
Yun-bin Zhao +3 more
core +1 more source
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 +3 more
core
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
An alternative error bound for linear complementarity problems involving [Formula: see text]-matrices. [PDF]
J Inequal Appl, 2018 Gao L.
europepmc +1 more source
, 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
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
Error bounds for linear complementarity problems of weakly chained diagonally dominant B-matrices. [PDF]
J Inequal Appl, 2017 Wang F.
europepmc +1 more source
, 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
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
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