<?xml version="1.0" encoding="UTF-8" standalone="no" ?>
<rss version="2.0">
  <channel>
    <title>Fang, S.-C.</title>
    <link>http://repub.eur.nl/res/aut/5264/</link>
    <description>List of Publications</description>
    <language>en</language>
    <image>
      <url>http://repub.eur.nl/static-eur/img/logo.png</url>
      <title>RePub, Erasmus University Rotterdam</title>
      <link>http://repub.eur.nl</link>
    </image>
    <item>
      <title>Entropic regularization approach for mathematical programs with equilibrium constraints (Research Paper)</title>
      <link>http://repub.eur.nl/res/pub/525/</link>
      <pubDate>2002-12-31T00:00:00Z</pubDate>
      <description>A new smoothing approach based on entropic perturbation is proposed for solving mathematical 
programs with equilibrium constraints. Some of the desirable properties of the smoothing 
function are shown. The viability of the proposed approach is supported by a computational 
study on a set of well-known test problems.</description>
    </item> <item>
      <title>Solving variational inequalities defined on a domain with infinitely many linear constraints (Research Paper)</title>
      <link>http://repub.eur.nl/res/pub/526/</link>
      <pubDate>2002-12-31T00:00:00Z</pubDate>
      <description>We study a variational inequality problem whose domain is defined by infinitely many linear 
inequalities. A discretization method and an analytic center based inexact cutting plane 
method are proposed. Under proper assumptions, the convergence results for both methods are 
given. We  also provide numerical examples for the proposed methods.</description>
    </item> <item>
      <title>On the finite termination of an entropy function based smoothing Newton method for vertical linear complementarity problems (Research Paper)</title>
      <link>http://repub.eur.nl/res/pub/527/</link>
      <pubDate>2002-12-31T00:00:00Z</pubDate>
      <description>By using a smooth entropy function to approximate the non-smooth max-type function, a 
vertical linear complementarity problem (VLCP) can be treated as a family of parameterized 
smooth equations. A Newton-type method with a testing procedure is proposed to solve such 
a system. We show that the proposed algorithm finds an exact solution of VLCP in a finite 
number of iterations, under some conditions milder than those assumed in literature. 
Some computational results are included to illustrate the potential of this approach.</description>
    </item>
  </channel>
</rss>