论文信息 - A relaxation method for solving problems of non-linear programming

A relaxation method for solving problems of non-linear programming

Abstract A RELAXATION method is described for finding the local extrema in the general problem of non-linear programming. The convergence is proved, the convergence rate of the continuous and discrete versions of the method is investigated, and an extension to the case of finding saddle-points is given. The results of numerical computations are quoted.

Vitali G. Zhadan | Yu. G. Evtushenko

[1] James G. Taylor. A squared‐variable transformation approach to nonlinear programming optimality conditions , 1973 .

[2] Yu. G. Evtushenko,et al. Numerical methods for solving problems of non-linear programming , 1976 .

[3] J. B. Rosen. The gradient projection method for nonlinear programming: Part II , 1961 .

[4] B. V. Dean,et al. Studies in Linear and Non-Linear Programming. , 1959 .

[5] J. B. Rosen. The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints , 1960 .

[6] Guy L. Curry,et al. Classical Derivation of the Necessary and Sufficient Conditions for Optimal Linear Programs , 1971, Oper. Res..