3. page 13, lines 12–13: Insert a phrase to stress that we consider only monotone LCP in this book, though the qualifier ”monotone” is often omitted. Replace the sentence preceding the formula (1.21) by The monotone LCP—the qualifier ”monotone” is implicit throughout this book—is the problem of finding vectors x and s in I R that satisfy the following conditions: 4. page 13, line −12: delete “o...

We formulated a discrete time model in order to study optimal control strategies for single influenza outbreak. In our model, we divided the population into four classes: susceptible, infectious, treated, and recovered individuals. The total population was divided into subgroups according to activity or susceptibility levels. The goal was to determine how treatment doses should be distributed i...

This paper presents a methodology for the classification of power system voltage stability, the trajectory of which to instability is monotonic, using an interior point method based support vector machine (IPMSVM). The SVM based voltage stability classifier can provide real-time stability identification only using the local measurement data, without the topological information conventionally used.

In each iteration of the interior point method (IPM) at least one linear system has to be solved. The main computational effort of IPMs consists in the computation of these linear systems. Solving the corresponding linear systems with a direct method becomes very expensive for large scale problems. In this thesis, we have been concerned with using an iterative method for solving the reduced KKT...

We formulate a discrete time model to identify and evaluate the role of optimal control strategies on influenza transmission. We divide the population in two subgroups defined according to the contact activity or susceptibility levels. The individuals are identified as susceptible, infectious, treated, and recovered. The potential effect of antiviral treatment considering unlimited and limited ...

A new IPM (Interior Point Method) for LPs has been discussed in [9, 10] based on a centering step that attempts to maximize the radius of the inscribed sphere with center on the current objective plane, and using descent directions derived without using matrix inversions. The method is a descent method and may be called the sphere method for LP. In contrast to all the existing IPMs which involv...

A modiied predictor-corrector algorithm is proposed for solving monotone linear complementarity problems from infeasible starting points. The algorithm terminates in O(nL) steps either by nding a solution or by determining that the problem is not solvable. The complexity of the algorithm depends on the quality of the starting point. If the problem is solvable and if a certain measure of feasibi...

We present a new full Nesterov and Todd step infeasible interior-point algorithm for semi-definite optimization. The algorithm decreases the duality gap and the feasibility residuals at the same rate. In the algorithm, we construct strictly feasible iterates for a sequence of perturbations of the given problem and its dual problem. Every main iteration of the algorithm consists of a feasibility...