On some universal methods of correction of the improper convex programming problems

被引：0

作者：

V. D. Skarin

机构：

[1] Russian Academy of Sciences,Institute of Mathematics and Mechanics, Ural Branch

来源：

Automation and Remote Control | 2012年 / 73卷

关键词：

Saddle Point; Remote Control; Lagrange Function; Normal Solution; Universal Method;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Consideration was given to the methods of optimal correction of the improper problems of convex programming based on the Lagrange function regularized in both variables. The methods are independent of the kind of impropriety of the original problem. Approximation precision was estimated, and the relation of this approach to the existing methods of regularization of the incorrect extremal problems was discussed.

引用

页码：300 / 309

页数：9

共 50 条

[41] IMPROPER MATHEMATICAL-PROGRAMMING PROBLEMS
EREMIN, II
VATOLIN, AA
PROBLEMS OF CONTROL AND INFORMATION THEORY-PROBLEMY UPRAVLENIYA I TEORII INFORMATSII, 1989, 18 (06): : 359 - 380
[42] The method of quasi-solutions based on barrier functions in the analysis of improper convex programming problems
Skarin, V. D.
TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2022, 28 (04): : 201 - 215
[43] On some connection between invex and convex problems in nonlinear programming
Galewski, M
CONTROL AND CYBERNETICS, 2001, 30 (01): : 11 - 22
[44] On the application of the quasisolution method to the correction of improper convex programs
Skarin, V. D.
TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2019, 25 (04): : 189 - 200
[45] Some saddle-function splitting methods for convex programming
Eckstein, Jonathan
Optimization Methods and Software, 1994, 4 (01) : 75 - 83
[46] SOME METHODS FOR SOLUTION OF STOCHASTIC PROGRAMMING PROBLEMS
KAPLINSKII, AI
POZNYAK, AS
PROPOI, AI
AUTOMATION AND REMOTE CONTROL, 1971, 32 (10) : 1609 - +
[47] ON ONE CLASS OF ITERATIONAL METHODS FOR SOLVING PROBLEMS OF CONVEX-PROGRAMMING
ZHADAN, VG
USSR COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1984, 24 (03): : 25 - 32
[48] Rounding of convex sets and efficient gradient methods for linear programming problems
Nesterov, Yu.
OPTIMIZATION METHODS & SOFTWARE, 2008, 23 (01): : 109 - 128
[49] θ-convex nonlinear programming problems
Emam, T.
NUOVO CIMENTO DELLA SOCIETA ITALIANA DI FISICA B-GENERAL PHYSICS RELATIVITY ASTRONOMY AND MATHEMATICAL PHYSICS AND METHODS, 2008, 123 (05): : 623 - 636
[50] ON THE CHOICE OF PARAMETERS IN THE QUASISOLUTION METHOD FOR THE CORRECTION OF IMPROPER CONVEX PROGRAMS
Skarin, V. D.
TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2020, 26 (03): : 187 - +

← 1 2 3 4 5 →