Sequence relaxation methods for stiff optimization problems

Simulations of Computer, Telecommunications, Control and Social Systems

New sequence relaxation methods are discussed. In contrast to the classical relaxation procedures, the methods retain the convergence and efficiency for non-convex nonlinear programming problems under conditions of high stiffness of target functionals.