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 条
  • [11] METHOD FOR MIXED INTEGER CONVEX PROGRAMMING
    BURKARD, RE
    ENGE, H
    COMPUTING, 1975, 14 (04) : 389 - 396
  • [12] The Neural Network for Solving Convex Nonlinear Programming Problem
    Yang, Yongqing
    Xu, Xianyun
    Zhu, Daqi
    INTELLIGENT COMPUTING, PART I: INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING, ICIC 2006, PART I, 2006, 4113 : 494 - 499
  • [13] Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems
    Eronen, Ville-Pekka
    Kronqvist, Jan
    Westerlund, Tapio
    Makela, Marko M.
    Karmitsa, Napsu
    JOURNAL OF GLOBAL OPTIMIZATION, 2017, 69 (02) : 443 - 459
  • [14] Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems
    Ville-Pekka Eronen
    Jan Kronqvist
    Tapio Westerlund
    Marko M. Mäkelä
    Napsu Karmitsa
    Journal of Global Optimization, 2017, 69 : 443 - 459
  • [15] AN ALGORITHM FOR SOLVING THE GENERAL BILEVEL PROGRAMMING PROBLEM
    BARD, JF
    MATHEMATICS OF OPERATIONS RESEARCH, 1983, 8 (02) : 260 - 272
  • [16] Solving Max-cut Problem with a mixed penalization method for Semidefinite Programming
    Orkia, Derkaoui
    Ahmed, Lehireche
    Abdelkader, Khobzaoui
    INTERNATIONAL JOURNAL OF COMBINATORIAL OPTIMIZATION PROBLEMS AND INFORMATICS, 2024, 15 (03): : 171 - 182
  • [17] General method for solving multi-objective de novo programming problem
    Banik, Susanta
    Bhattacharya, Debasish
    OPTIMIZATION, 2023, 72 (12) : 3063 - 3080
  • [18] A method for solving a problem of possibilistic programming
    Gordeev, R. N.
    Yazenin, A. V.
    JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 2006, 45 (03) : 442 - 449
  • [19] A method for solving a problem of possibilistic programming
    R. N. Gordeev
    A. V. Yazenin
    Journal of Computer and Systems Sciences International, 2006, 45 : 442 - 449
  • [20] An algorithm for solving the problem of convex programming with several objective functions
    Faculty of Sciences, Transilvania University of Brasov, str. Iuliu Maniu 50, 2200 Brasov, Romania
    J. Appl. Math. Comp., 1 (79-88):
12345