in restructured power systems and in a wholesale power market, a distribution company as a market player intends to maximize its profit by utilizing its options. hence determining an optimal energy acquisition strategy for a distribution company is vital, for attaining to this goal. however an important challenge for determining these strategies is forecasting other competitors and generation c...

QPCOMP is an extremely robust algorithm for solving mixed nonlinear complementarity problems that has fast local convergence behavior. Based in part on the NE/SQP method of Pang and Gabriell14], this algorithm represents a signiicant advance in robustness at no cost in eeciency. In particular, the algorithm is shown to solve any solvable Lipschitz continuous, continuously diierentiable, pseudo-...

In this paper, we introduce a new P -type condition for nonlinear functions defined over Euclidean Jordan algebras, and study a continuation method for nonlinear complementarity problems over symmetric cones. This new P -type condition represents a new class of nonmonotone nonlinear complementarity problems that can be solved numerically.

In this paper, we introduce a new P -type condition for nonlinear functions defined over Euclidean Jordan algebras, and study a continuation method for nonlinear complementarity problems over symmetric cones. This new P -type condition represents a new class of nonmonotone nonlinear complementarity problems that can be solved numerically.

The paper presents a Jacobian smoothing nonlinear complementarity method for solving large nonlinear optimal power flow (OPF) problems. By using (smooth or non-smooth) nonlinear complementarity (NC) functions we reformulate the OPF problem as a (smooth or non-smooth) nonlinear system of equations, which, in turn, can be solved by well-known methods. The Jacobian smoothing method computes the se...

In this paper, we first give a new equivalent optimization form to nonlinear complementarity problems and then establish a damped Newton method in which penalty technique is used. The subproblems of the method are lower-dimensional linear complementarity problems. We prove that the algorithm converges globally for strongly monotone complementarity problems. Under certain conditions, the method ...