On Quadratic Programming with a Ratio Objective

被引:0
|
作者
Bhaskara, Aditya [1 ]
Charikar, Moses [1 ]
Manokaran, Rajsekar [1 ]
Vijayaraghavan, Aravindan [1 ]
机构
[1] Princeton Univ, Dept Comp Sci, Ctr Computat Intractabil, Princeton, NJ 08544 USA
关键词
MAX-CUT; INAPPROXIMABILITY; APPROXIMATION; ALGORITHMS;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Quadratic Programming (QP) is the well-studied problem of maximizing over {-1, 1} values the quadratic form Sigma(aijxixj)(i not equal j). QP captures many known combinatorial optimization problems, and assuming the Unique Games conjecture, Semidefinite Programming (SDP) techniques give optimal approximation algorithms. We extend this body of work by initiating the study of Quadratic Programming problems where the variables take values in the domain {-1, 0, 1}. The specific problem we study is QP-Ratio : max ({-1,0,1}n) Sigma(aijxixj)(i not equal j)/Sigma x1(i)(2) This is a natural relative of several well studied problems (in fact Trevisan introduced a normalized variant as a stepping stone towards a spectral algorithm for Max Cut Gain). Quadratic ratio problems are good testbeds for both algorithms and complexity because the techniques used for quadratic problems for the {-1, 1} and {0, 1} domains do not seem to carry over to the {-1, 0, 1} domain. We give approximation algorithms and evidence for the hardness of approximating these problems. We consider an SDP relaxation obtained by adding constraints to the natural eigenvalue (or SDP) relaxation for this problem. Using this, we obtain an (O) over tilde (n(1/3)) approximation algorithm for QP-ratio. We also give a (O) over tilde (n(1/4)) approximation for bipartite graphs, and better algorithms for special cases. As with other problems with ratio objectives (e.g. uniform sparsest cut), it seems difficult to obtain inapproximability results based on P not equal NP. We give two results that indicate that QP-Ratio is hard to approximate to within any constant factor: one is based on the assumption that random instances of Max k-AND are hard to approximate, and the other makes a connection to a ratio version of Unique Games. We also give a natural distribution on instances of QP-Ratio for which an n(epsilon) approximation (for epsilon roughly 1/10) seems out of reach of current techniques.
引用
收藏
页码:109 / 120
页数:12
相关论文
共 50 条
  • [21] Fuzzy goal programming approach to solve fully fuzzy multi-objective quadratic programming problem
    Tadesse, Admasu
    Acharya, M. M.
    Acharya, Srikumar
    Sahoo, Manoranjan
    [J]. INTERNATIONAL JOURNAL OF SYSTEM ASSURANCE ENGINEERING AND MANAGEMENT, 2024, 15 (02) : 705 - 712
  • [22] Fuzzy goal programming approach to solve fully fuzzy multi-objective quadratic programming problem
    Admasu Tadesse
    M. M. Acharya
    Srikumar Acharya
    Manoranjan Sahoo
    [J]. International Journal of System Assurance Engineering and Management, 2024, 15 : 705 - 712
  • [23] DOUBLY NONNEGATIVE RELAXATION METHOD FOR SOLVING MULTIPLE OBJECTIVE QUADRATIC PROGRAMMING PROBLEMS
    Bai, Yanqin
    Guo, Chuanhao
    [J]. JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2014, 10 (02) : 543 - 556
  • [24] Experiments on Local Search for Bi-objective Unconstrained Binary Quadratic Programming
    Liefooghe, Arnaud
    Verel, Sebastien
    Paquete, Luis
    Hao, Jin-Kao
    [J]. EVOLUTIONARY MULTI-CRITERION OPTIMIZATION, PT I, 2015, 9018 : 171 - 186
  • [25] Solving Multi-objective Chance Constraint Quadratic Fractional Programming Problem
    Belay, Berhanu
    Abebaw, Adane
    [J]. MATHEMATICS AND COMPUTING, ICMC 2022, 2022, 415 : 441 - 451
  • [26] A Sequential Quadratic Programming Method for Constrained Multi-objective Optimization Problems
    Md Abu Talhamainuddin Ansary
    Geetanjali Panda
    [J]. Journal of Applied Mathematics and Computing, 2020, 64 : 379 - 397
  • [27] A Sequential Quadratic Programming Method for Constrained Multi-objective Optimization Problems
    Ansary, Md Abu Talhamainuddin
    Panda, Geetanjali
    [J]. JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2020, 64 (1-2) : 379 - 397
  • [28] A ranking algorithm for bi-objective quadratic fractional integer programming problems
    Sharma, Vikas
    Dahiya, Kalpana
    Verma, Vanita
    [J]. OPTIMIZATION, 2017, 66 (11) : 1913 - 1929
  • [29] Multi-Objective Trajectory Optimization for Freight Trains Based on Quadratic Programming
    Bai, Baoxue
    Xiao, Zhuang
    Wang, Qingyuan
    Sun, Pengfei
    Feng, Xiaoyun
    [J]. TRANSPORTATION RESEARCH RECORD, 2020, 2674 (11) : 466 - 477
  • [30] Optimal Multi-Objective Cell Balancing for Battery Packs with Quadratic Programming
    Chen, Hao
    Fan, Xiaodong
    Zheng, Jian
    Fu, Yuan
    Chen, Jian
    [J]. 2019 IEEE 28TH INTERNATIONAL SYMPOSIUM ON INDUSTRIAL ELECTRONICS (ISIE), 2019, : 1989 - 1994