Ji-Ming Peng

Learn More
The variational inequality problem (VIP) can be reformulated as an unconstrained minimization problem through the D-gap function. It is proved that the D-gap function has bounded level sets for the strongly monotone VIP. A hybrid Newton-type method is proposed for minimizing the D-gap function. Under some conditions, it is shown that the algorithm is(More)
In this paper, we propose a non-interior continuation method for solving generalized linear complementarity problems (GLCP) introduced by Cottle and Dantzig. The method is based on a smoothing function derived from the exponential penalty function first introduced by Kort and Bertsekas for constrained minimization. This smoothing function can also be viewed(More)
The Karush-Kuhn-Tucker (KKT) conditions can be regarded as optimality conditions for both variational inequalities and constrained optimization problems. In order to overcome some drawbacks of recently proposed reformulations of KKT systems, we propose to cast KKT systems as a minimization problem with nonnegativity constraints on some of the variables. We(More)
A box constrained variational inequality problem can be reformulated as an unconstrained minimization problem through the D-gap function. Some basic properties of the aane variational inequality subproblems in the classical Josephy-Newton method are studied. A hybrid Josephy-Newton method is then proposed for minimizing the D-gap function. Under suitable(More)
AIM AND OBJECTIVES To explore the underlying theoretical framework for the role adaptation of family caregivers for ventilator-dependent patients after transferring from respiratory care ward to home. BACKGROUND The number of ventilator-dependent patients has been increasing worldwide. Under Taiwan's National Health Insurance policy, if(More)
A box constrained variational inequality problem can be reformulated as an unconstrained minimization problem through the D-gap function. A hybrid Newton-type method is proposed for minimizing the D-gap function. Under suitable conditions, the algorithm is shown to be globally convergent and locally quadratically convergent. Some numerical results are also(More)
  • 1