This paper proposes an infeasible interior-point algorithm for the convex optimization problem using arc-search techniques. The proposed simultaneously selects centering parameter and step size, aiming at optimizing performance in every iteration. Analytic formulas are provided to make method very efficient. convergence of is proved a polynomial bound established. preliminary numerical test res...

In the field of single crystal plasticity, different algorithms exist for solution constitutive equations. They can be grouped into rate independent and dependent approaches, where both classes are governed by inherent shortcomings, as discussed in, e.g., [3]. This contribution outlines an algorithmic formulation plasticity at small strains case relying on infeasible primal-dual interior point ...

During the last decade interior-point methods have become an eecient alternative to the simplex algorithm for solution of large-scale linear programming (LP) problems. However, in many practical applications of LP, interior-point methods have the drawback that they do not generate an optimal basic and nonbasic partition of the variables. This partition is required in the traditional sensitivity...