The complexity of minimizing the difference of two Mb-convex set functions

被引：2
|
作者：
Kobayashi, Yusuke [1 ]
机构：
[1] Univ Tsukuba, Tsukuba, Ibaraki 3058573, Japan
来源：
OPERATIONS RESEARCH LETTERS | 2015年 / 43卷 / 06期
关键词：
M-b-convex set functions; DC programming; Matroid; NP-hardness;
D O I：
10.1016/j.orl.2015.08.011
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In the context of discrete DC programming, Maehara and Murota (2015) posed the problem of determining the complexity of minimizing the difference of two M-b-convex set functions. In this paper, we show the NP-hardness of this minimization problem by proving a stronger result: maximizing the difference of two matroid rank functions is NP-hard. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码：573 / 574
页数：2
相关论文
共 50 条
  • [1] Minimizing functionals on a set of convex functions
    LachandRobert, T
    Peletier, MA
    [J]. COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1997, 325 (08): : 851 - 855
  • [2] AN OUTCOME SPACE ALGORITHM FOR MINIMIZING THE PRODUCT OF TWO CONVEX FUNCTIONS OVER A CONVEX SET
    Nguyen Thi Bach Kim
    Nguyen Canh Nam
    Le Quang Thuy
    [J]. JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2013, 9 (01) : 243 - 253
  • [3] Minimizing the difference of two quasiconvex functions
    Dempe, S.
    Gadhi, N.
    Hamdaoui, K.
    [J]. OPTIMIZATION LETTERS, 2020, 14 (07) : 1765 - 1779
  • [4] Minimizing the difference of two quasiconvex functions
    S. Dempe
    N. Gadhi
    K. Hamdaoui
    [J]. Optimization Letters, 2020, 14 : 1765 - 1779
  • [5] Minimizing the Difference of Dual Functions of Two Coradiant Functions
    Mohebi, A.
    Mohebi, H.
    [J]. NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION, 2019, 40 (03) : 280 - 302
  • [6] Subdifferentials for the Difference of Two Convex Functions
    Polovinkin E.S.
    [J]. Journal of Mathematical Sciences, 2016, 218 (5) : 664 - 677
  • [7] AN OUTER APPROXIMATION METHOD FOR MINIMIZING THE PRODUCT OF SEVERAL CONVEX-FUNCTIONS ON A CONVEX SET
    KUNO, T
    YAJIMA, Y
    KONNO, H
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 1993, 3 (03) : 325 - 335
  • [8] An interior-point method for minimizing convex functions on the convex hull of a point set
    Stoer, Josef
    Botkin, Nikolai D.
    Pykhteev, Oleg A.
    [J]. OPTIMIZATION, 2007, 56 (04) : 515 - 524
  • [9] On the Problem of Minimizing a Difference of Polyhedral Convex Functions Under Linear Constraints
    Nguyen Thi Van Hang
    Nguyen Dong Yen
    [J]. Journal of Optimization Theory and Applications, 2016, 171 : 617 - 642
  • [10] Higher-order tensor methods for minimizing difference of convex functions
    Automatic Control and Systems Engineering Department, National University of Science and Technology Politehnica Bucharest, Spl. Independentei 313, Bucharest
    060042, Romania
    不详
    050711, Romania
    [J]. arXiv,
12345