We are interested in the solution of Horizontal Linear Complementarity Problems, HLCPs, that is complementarity problems with more variables than equations. Globally metrically regular HLCPs have nonempty solution sets that are stable with respect to "right-hand-side perturbations" of the data, hence are numerically attractive. The main purpose of the paper is to show how the stability on conditioning properties of globally metrically regular HLCPs are preserved by a homotopy framework for solving the HLCP that finds a "stable" direcaion at each iteration as a local minimizer of a strongly convex quadratic program with linear complementarity constraints, QPCC. Apart from intrinsic interest in numerical solution of HLCPs, this investigation ...
In this paper we consider the class of mathematical programs with complementarity constraints (MPCC)...
One shows that different formulations of the linear complementarity problem (LCP), such as the horiz...
Recent improvements in the capabilities of complementarity solvers have led to an increased interest...
AbstractIn this note, we present an algorithm to reduce a horizontal linear complementarity problem ...
Abstract. We consider the extended linear complementarity problem (XLCP) introduced by Mangasarian a...
AbstractIn this note, we present an algorithm to reduce a horizontal linear complementarity problem ...
In this thesis, we study two generalizations of the classical linear complementarity problem (LCP) -...
In this paper we consider the class of mathematical programs with complementarity constraints (MPCC)...
A Mathematical Program with Linear Complementarity Constraints (MPLCC) is an optimization problem wh...
AP *-geometric linear complementarity problem (P *GP) as a generalization of the monotone geometric ...
AbstractIn this paper, we present a smoothing Gauss–Newton method for solving the generalized horizo...
We consider a class of quadratic programs with linear complementarity constraints (QPLCC) which belo...
In this paper, general linear complementarity problems (LCPs) are studied via global optimization pr...
AbstractThe extended linear complementarity problem (XLCP) has been introduced in a recent paper by ...
summary:In the paper we consider EPCCs with convex quadratic objective functions and one set of comp...
In this paper we consider the class of mathematical programs with complementarity constraints (MPCC)...
One shows that different formulations of the linear complementarity problem (LCP), such as the horiz...
Recent improvements in the capabilities of complementarity solvers have led to an increased interest...
AbstractIn this note, we present an algorithm to reduce a horizontal linear complementarity problem ...
Abstract. We consider the extended linear complementarity problem (XLCP) introduced by Mangasarian a...
AbstractIn this note, we present an algorithm to reduce a horizontal linear complementarity problem ...
In this thesis, we study two generalizations of the classical linear complementarity problem (LCP) -...
In this paper we consider the class of mathematical programs with complementarity constraints (MPCC)...
A Mathematical Program with Linear Complementarity Constraints (MPLCC) is an optimization problem wh...
AP *-geometric linear complementarity problem (P *GP) as a generalization of the monotone geometric ...
AbstractIn this paper, we present a smoothing Gauss–Newton method for solving the generalized horizo...
We consider a class of quadratic programs with linear complementarity constraints (QPLCC) which belo...
In this paper, general linear complementarity problems (LCPs) are studied via global optimization pr...
AbstractThe extended linear complementarity problem (XLCP) has been introduced in a recent paper by ...
summary:In the paper we consider EPCCs with convex quadratic objective functions and one set of comp...
In this paper we consider the class of mathematical programs with complementarity constraints (MPCC)...
One shows that different formulations of the linear complementarity problem (LCP), such as the horiz...
Recent improvements in the capabilities of complementarity solvers have led to an increased interest...