We propose a new nonmonotone filter method to promote global and fast local convergence for sequential quadratic programming algorithms. Our method uses two filters: a standard, global g-filter for global convergence, and a local nonmonotone l-filter that allows us to establish fast local convergence. We show how to switch between the two filters efficiently, and we prove global and superlinear local convergence. A special feature of the proposed method is that it does not require second-order correction steps. We present preliminary numerical results comparing our implementation with a classical filter SQP method.

No abstract uploaded!

No abstract uploaded!

Representations of the sl (n+ 1, C) Lie algebras are constructed with the help of canonical (boson) realisations of these algebras. For every weight Lambda on the standard Cartan subalgebra of sl (n+ 1, C) the authors obtain a representation rho Lambda (n+ 1)(called the maximal representation) which contains an irreducible subrepresentation with Lambda as the highest weight. It is shown that for a major part of the weights Lambda the representations rho Lambda (n+ 1) themselves are irreducible. The standard construction of the highest-weight representations of semi-simple Lie algebras is based on the so-called elementary representations; comparing with them, the authors maximal representations are given in the explicit form.

No abstract uploaded!