No abstract uploaded!

Recently there have two different effective methods proposed by Kanzow et al. in (Kanzow, 2001 [8]) and (Kanzow and Petra, 2004 [9]), respectively, which commonly use the FischerBurmeister (FB) function to recast the mixed complementarity problem (MCP) as a constrained minimization problem and a nonlinear system of equations, respectively. They all remark that their algorithms may be improved if the FB function is replaced by other NCP functions. Accordingly, in this paper, we employ the generalized FischerBurmeister (GFB) where the 2-norm in the FB function is relaxed to a general p-norm (p> 1) for the two methods and investigate how much the improvement is by changing the parameter p as well as which method is influenced more when we do so, by the performance profiles of iterations and function evaluations for the two methods with different p on MCPLIB collection.

The goal of this chapter is an attempt to relate some ideas of Grothendieck in his Esquisse dun programme [10] and some of the recent results on 2-dimensional topology and geometry. Especially, we shall discuss Teichmller theory, the mapping class groups, the SL (2, C) representation variety of surface groups, and Thurstons theory of measured laminations.

We study a one-dimensional transport equation with nonlocal velocity which was recently considered in the work of Crdoba, Crdoba and Fontelos [A. Crdoba, D. Crdoba, MA Fontelos, Formation of singularities for a transport equation with nonlocal velocity, Ann. of Math.(2) 162 (3)(2005) 13771389]. We show that in the subcritical and critical cases the problem is globally well-posed with arbitrary initial data in H max {3/2 , 0}. While in the supercritical case, the problem is locally well-posed with initial data in H 3/2 , and is globally well-posed under a smallness assumption. Some polynomial-in-time decay estimates are also discussed. These results improve some previous results in [A. Crdoba, D. Crdoba, MA Fontelos, Formation of singularities for a transport equation with nonlocal velocity, Ann. of Math.(2) 162 (3)(2005) 13771389].

Analogous to the nonlinear complementarity problem and the semi-definite complementarity problem, a popular approach to solving the second-order cone complementarity problem (SOCCP) is to reformulate it as an unconstrained minimization of a certain merit function over R n. In this paper, we present a descent method for solving the unconstrained minimization reformulation of the SOCCP which is based on the FischerBurmeister merit function (FBMF) associated with second-order cone [J.-S. Chen, P. Tseng, An unconstrained smooth minimization reformulation of the second-order cone complementarity problem, Math. Programming 104 (2005) 293327], and prove its global convergence. Particularly, we compare the numerical performance of the method for the symmetric affine SOCCP generated randomly with the FBMF approach [J.-S. Chen, P. Tseng, An unconstrained smooth minimization reformulation