In the paper the definition of the regular stationary point (M. Altman) is extended to be embracing all the points to which the method of feasible directions can converge if used without respect to the regularity condition.
The system of equations is solved by means of iterative methods of minimization of the functions A) under the conditions , B) . These methods are derived from the Zoutendijk’s method of feasible directions. A good deal of attention is paid to their numerical aspects.
The algorithm described in the article is a modification of Gelfand-Cetlin's valley method of finding an unconstrained minimum of a function of complicated structure (with one-dimensional valleys). The modification is particularly suitable for use with high speed computers.
Page 1