This paper provides a theoretical foundation for efficient interior-point algorithms for nonlinear programming problems expressed in conic form, when the cone and its associated barrier are self-scaled. For such problems we devise long-step and symmetric primal-dual methods. Because of the...

In this paper we prove that every linear model with rational expectations can be transformed by means of an one-to-one mapping into another model which has one of the following properties: i) it is degenerated, ii) it is backward, iii) it has a Blanchard-Kahn form. In addition to some simple...