A unified formulation and a numerical approach are presented for twoand three-dimensional incremental quasi-static problems with unilateral frictional contact. Under the assumptions of small rotations and small strains, a Second-Order Cone Linear Complementarity Problem (SOCLCP) is formulated, which consists of complementarity conditions defined by bilinear functions and second-order cone const...

A new formulation is presented for the three-dimensional incremental quasi-static problems with unilateral frictional contact. Under the assumptions of small rotations and small strains, a second-order cone linear complementarity problem is formulated, which consists of complementarity conditions defined by bilinear functions and second-order cone constraints. The equilibrium configurations are...

In this article, we consider an unconstrained minimization formulation of the nonlinear complementarity problem NCP(f) when the underlying functions are H-differentiable but not necessarily locally Lipschitzian or directionally differentiable. We show how, under appropriate regularity conditions on an H-differential of f , minimizing the merit function corresponding to f leads to a solution of ...

In this paper, we propose a Big-? smoothing method for solving the P 0 matrix linear complementarity problem. We study the trajectory deened by the augmented smoothing equations and global convergence of the method under an assumption that the original P 0 matrix linear complementarity problem has a solution. The method has been tested on the P 0 matrix linear complementarity problem with unbou...

This report gives an overview of the linear complementarity problem, as a special case of mathematical programming with equilibrium constraints. The interior point method and two versions of Lemke’s method are reviewed, as methods for solving the linear complementarity problem. The report concludes with a description of the Stackelberg game and the bimatrix game as possible applications of math...

This paper extends the regularized smoothing Newton method in vector optimization to symmetric cone optimization, which provide a unified framework for dealing with the nonlinear complementarity problem, the second-order cone complementarity problem, and the semidefinite complementarity problem (SCCP). In particular, we study strong semismoothness and Jacobian nonsingularity of the total natura...

Several papers have appeared recently establishing the analyticity of the central path at the boundary point for both linear programming (LP) and linear complementarity problems (LCP). While the proofs for LP are long, proceeding from limiting properties of the corresponding derivatives, the proofs for LCP are very simple, consisting of an application of the implicit function theorem to a certa...

We address the issue of when software development methods are complementary, i.e., determining when a method is capable of a task that another method cannot perform. Our intent is to examine complementarity in order to help determine when to carry out method integration. We propose some factors for method complementarity, and suggest that contextdependent criteria, such as real-world domain and...

In this paper, a sequential system of linear equations (SSLE) algorithm for solving mathematical problem with linear complementarity constraints is introduced, which uses Fischer-Burmeister (F-B) function and smoothing technique to rewrite CONG ZHANG et al. 150 the complementarity constraints ”. “ 0 0 ≥ ⊥ ≤ w y Under some suitable conditions without upper level complementarity, the proposed met...