Linearization method

被引:2
作者
Antipin A.S.
机构
关键词
Mathematical Modeling; Computational Mathematic; Programming Problem; Industrial Mathematic; Function Method;
D O I
10.1007/BF02404060
中图分类号
学科分类号
摘要
The linearization method is considered in continuous and iterative forms. Its convergence to the solution of the convex programming problem is proved. Rate of convergence bounds are derived. A relationship with modified Lagrange function methods is established. © 1997 Plenum Publishing Corporation.
引用
收藏
页码:1 / 15
页数:14
相关论文
共 12 条
[1]  
Rybashev M.V., Stability of gradient systems, Avtomat. Telemekh., 9, pp. 12-18, (1974)
[2]  
Venets V.I., Differential inclusions in convex problems, Avtomat. Telemekh., 9, pp. 5-14, (1979)
[3]  
Evtushenko Y.G., Zhadan V.G., Application of the Lyapunov function method for convergence analysis of numerical methods, Zh. Vychisl. Matem, i Mat. Fiziki, 15, 1, pp. 101-112, (1975)
[4]  
Vasil'ev F.P., Numerical Methods for Solving Extremal Problems [in Russian], (1988)
[5]  
Brown A.A., Bartholomew-Biggs M.C., Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations, J. Optim. Theory Appl., 62, 2, pp. 25-39, (1989)
[6]  
Antipin A.S., Continuous and iterative processes with projection operators and projection type operators, Topics in Cybernetics. Computational Issues in the Analysis of Large Systems [in Russian], pp. 5-43, (1989)
[7]  
Pshenichnyi B.N., Danilin Y.M., Numerical Methods in Extremal Problems [in Russian], (1975)
[8]  
Fedorenko R.P., Approximate Solution of Optimal Control Problems [in Russian], (1978)
[9]  
Antipin A.S., Nonlinear Programming Methods Based on Primal and Dual Modifications of the Lagrange Function [in Russian], (1979)
[10]  
Golikov A.I., Modified Lagrange Functions in Nonlinear Programming [in Russian], (1988)