Mixed method for solving the general convex programming problem

被引:0
|
作者
B. N. Pshenichnyi
É. I. Nenakhov
V. N. Kuz’menko
机构
来源
Cybernetics and Systems Analysis | 1998年 / 34卷
关键词
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 条
  • [21] An algorithm for solving the problem of convex programming with several objective functions
    Moise Cocan
    Bogdana Pop
    Korean Journal of Computational and Applied Mathematics, 1999, 6 (1): : 79 - 88
  • [22] SOLVING THE PROBLEM OF CONVEX BLOCK PROGRAMMING IN A HYBRID COMPUTING SYSTEM
    KARPINSKAYA, NN
    AUTOMATION AND REMOTE CONTROL, 1980, 41 (08) : 1161 - 1168
  • [23] A neural network for solving a convex quadratic bilevel programming problem
    Lv, Yibing
    Chen, Zhong
    Wan, Zhongping
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2010, 234 (02) : 505 - 511
  • [24] NEWTON METHOD FOR SOLVING A CLASS OF SMOOTH CONVEX PROGRAMMING
    姚奕荣
    张连生
    韩伯顺
    Applied Mathematics and Mechanics(English Edition), 2005, (11) : 105 - 112
  • [25] Newton method for solving a class of smooth convex programming
    Yi-rong Yao
    Lian-sheng Zhang
    Bo-shun Han
    Applied Mathematics and Mechanics, 2005, 26 : 1491 - 1498
  • [26] Newton method for solving a class of smooth convex programming
    Yao, YR
    Zhang, LS
    Han, BS
    APPLIED MATHEMATICS AND MECHANICS-ENGLISH EDITION, 2005, 26 (11) : 1491 - 1498
  • [27] Solving the volumetric modulated arc therapy (VMAT) problem using a sequential convex programming method
    Dursun, Pinar
    Zarepisheh, Masoud
    Jhanwar, Gourav
    Deasy, Joseph O.
    PHYSICS IN MEDICINE AND BIOLOGY, 2021, 66 (08):
  • [28] A Cutting-Plane Method with Internal Iteration Points for the General Convex Programming Problem
    Zabotin, I. Ya.
    Kazaeva, K. E.
    Shulgina, O. N.
    UCHENYE ZAPISKI KAZANSKOGO UNIVERSITETA-SERIYA FIZIKO-MATEMATICHESKIE NAUKI, 2023, 165 (03): : 208 - 218
  • [29] Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
    Zhang, Huizhen
    Beltran-Royo, Cesar
    Ma, Liang
    ANNALS OF OPERATIONS RESEARCH, 2013, 207 (01) : 261 - 278
  • [30] Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
    Huizhen Zhang
    Cesar Beltran-Royo
    Liang Ma
    Annals of Operations Research, 2013, 207 : 261 - 278