ИСТИНА

We discuss the links between multidimensional matrices and some optimization problems, especially the so called singular problems where the classical Newton method cannot be applied. In particular, we show how some algorithms with quadratic convergence can be constructed in the singular case and how the constructions are related with the triviality of the quadratic kernel of some matrix subspaces.