We investigate the use of piecewise linear systems, whose coefficient matrix is a piecewise constant function of the solution itself. Such systems arise, for example, from the numerical solution of linear complementarity problems and in the numerical solution of free-surface problems. In particular, we here study their application to the numerical solution of both the (linear) parabolic obstacl...

The symmetric cone complementarity problem (denoted by SCCP) is a class of equilibrium optimization problems, and it contains the standard linear/nonlinear complementarity problem (LCP/NCP), the second-order cone complementarity problem (SOCCP) and the semidefinite complementarity problem (SDCP) as special cases. In this paper, we present a regularized smoothing Newton algorithm for SCCP by mak...

We discuss a nonlinear multigrid method for a linear complementarity problem. The convergence is improved by a recombination of iterants. The problem under consideration deals with option pricing from mathematical finance. Linear complementarity problems arise from so-called American-style options. A 2D convectiondiffusion type operator is discretized with the help of second order upwind discre...

In this paper, we first present a brief review about the feasible interior-point algorithm for P∗(κ)-horizontal linear complementarity problems (HLCPs) based on new directions. Then we present a new infeasible interior-point algorithm for these problems. The algorithm uses two types of full-Newton steps which are called feasibility steps and centering steps. The algorithm starts from strictly f...

Many fundamental problems in the max-plus-algebraic system theory for discrete event systems — among which the minimal state space realization problem — can be solved using an Extended Linear Complementarity Problem (ELCP). We present some new, more efficient methods to solve the ELCP. We show that an ELCP with a bounded feasible set can be recast as a standard Linear Complementarity Problem (L...

Many fundamental problems in the max-plus-algebraic system theory for discrete event systems — among which the minimal state space realization problem — can be solved using an Extended Linear Complementarity Problem (ELCP). We present some new, more efficient methods to solve the ELCP. We show that an ELCP with a bounded feasible set can be recast as a standard Linear Complementarity Problem (L...

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...

Abstract The Linear Complementarity Problem ) , ( q M LCP is to find a vector x in n IR satisfying 0  x , 0   q Mx and x T (Mx+q)=0, where M as a matrix and q as a vector, are given data. In this paper we show that the linear complementarity problem is completely equivalent to finding the fixed point of the map x = max (0, (I-M)x-q); to find an approximation solution to the second problem, w...

We introduce a new class of dynamical systems that we call "linear complementarity systerns". The evolution of these systems typically consists of a series of continuous phases separated by "events" which cause a change in dynamics and possibly a jump in the state vector. The occurrence of events is governed by certain inequalities similar to those appearing in the Linear Complementarity Proble...