Mixed method for solving the general convex programming problem

被引:0
|
作者
B. N. Pshenichnyi
É. I. Nenakhov
V. N. Kuz’menko
机构
来源
关键词
Mixed Method; Auxiliary Problem; Bundle Method; Convex Programming Problem; Slater Condition;
D O I
暂无
中图分类号
学科分类号
摘要
Let us return to the claim that we made at the beginning: given the existing level of computers, computational mathematics must not ignore new opportunities for finding results that have been impossible until very recently. In our view, the proposed mixed method is consistent with technological progress: all known problems have been solved in acceptable time, and not in a single case has the method failed to produce a solution.
引用
收藏
页码:577 / 587
页数:10
相关论文
共 50 条