In this paper we present the convergence analysis of the inexact infeasible path-following (IIPF) interior point algorithm. In this algorithm the preconditioned conjugate gradient method is used to solve the reduced KKT system (the augmented system). The augmented system is preconditioned by using a block triangular matrix. The KKT system is solved approximately. Therefore, it becomes necessary...

This thesis presents a technique to improve the precision of data-flow analyses on objectoriented programs in the presence of correlated calls. We say that two method calls are correlated if they are polymorphic (have multiple targets) and are invoked on the same object. Correlated calls are problematic because they can make existing data-flow analyses consider certain infeasible data-flow path...

This paper presents a knowledge-based method for identifying infeasible assembly operations in the context of assembly sequence planning. In addition the reasons for the infeasibility are identified and these can guide product designers towards the necessary design changes to make a preferred assembly sequence feasible, or guarantee that an assembly sequence includes a specific partial assembly...

In this paper, a combinational optimization algorithm is introduced to obtain the best size and location of Static Compensator (STATCOM) in power systems. Its main contribution is considering contingency analysis where lines outages may lead to infeasible solutions especially at peak loads and it commonly can be vanished by load-shedding. The objective of the proposed algorithm is firstly to pr...

Some of the strongest polynomial-time relaxations to NP-hard combinatorial optimization problems are semidefinite programs (SDPs), but their solution complexity of up to O(nL) time and O(n) memory for L accurate digits limits their use in all but the smallest problems. Given that combinatorial SDP relaxations are often sparse, a technique known as chordal conversion can sometimes reduce complex...

A slack-based feasible interior point method is described which can be derived as a modification of infeasible methods. The modification is minor for most line search methods, but trust region methods require special attention. It is shown how the Cauchy point, which is often computed in trust region methods, must be modified so that the feasible method is effective for problems containing both...

This papers studies the performance of several interior-point and activeset methods on bound constrained optimization problems. The numerical tests show that the sequential linear-quadratic programming (SLQP) method is robust, but is not as effective as gradient projection at identifying the optimal active set. Interiorpoint methods are robust and require a small number of iterations and functi...

Statically estimating the worst case execution time (WCET) of a program is important for real-time software. This is difficult even in the programming language level due to the inherent difficulty in detecting and exploiting infeasible paths in a program’s control flow graph. In this paper, we propose an efficient method to exploit infeasible path information for WCET estimation of a loop witho...