Suchergebnisse - quadratically constrained quadratic binary programming

  1. 1

    Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint von Zheng, Xiaojin, Pan, Yutong, Cui, Xueting

    ISSN: 0925-5001, 1573-2916
    Veröffentlicht: New York Springer US 01.04.2018
    Veröffentlicht in Journal of global optimization (01.04.2018)
    “… We investigate in this paper nonconvex binary quadratically constrained quadratic programming (QCQP …”
    Volltext
    Journal Article
  2. 2

    Binary classification posed as a quadratically constrained quadratic programming and solved using particle swarm optimization von KUMAR, DEEPAK, RAMAKRISHNAN, A G

    ISSN: 0256-2499, 0973-7677
    Veröffentlicht: New Delhi Springer India 01.03.2016
    Veröffentlicht in Sadhana (Bangalore) (01.03.2016)
    “… Binary classification is posed as a quadratically constrained quadratic problem and solved using the proposed method …”
    Volltext
    Journal Article
  3. 3

    An evaluation of semidefinite programming based approaches for discrete lot-sizing problems von Gicquel, C., Lisser, A., Minoux, M.

    ISSN: 0377-2217, 1872-6860
    Veröffentlicht: Amsterdam Elsevier B.V 01.09.2014
    Veröffentlicht in European journal of operational research (01.09.2014)
    “… •This problem is formulated as a quadratically constrained quadratic binary program.•We compute lower bounds using a semidefinite rather than a linear relaxation …”
    Volltext
    Journal Article
  4. 4

    A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access von Adasme, Pablo, Lisser, Abdel, Soto, Ismael

    ISSN: 0028-3045, 1097-0037
    Veröffentlicht: Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.01.2012
    Veröffentlicht in Networks (01.01.2012)
    “… This paper proposes two binary quadratically constrained quadratic programs for minimizing power subject to bit rate and subcarrier allocation constraints over wireless orthogonal frequency division multiple access …”
    Volltext
    Journal Article
  5. 5

    Mining for diamonds—Matrix generation algorithms for binary quadratically constrained quadratic problems von Bettiol, Enrico, Bomze, Immanuel, Létocart, Lucas, Rinaldi, Francesco, Traversi, Emiliano

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Veröffentlicht: New York Elsevier Ltd 01.06.2022
    Veröffentlicht in Computers & operations research (01.06.2022)
    “… In this paper, we consider binary quadratically constrained quadratic problems and propose a new approach to generate stronger bounds than the ones obtained using the Semidefinite Programming relaxation …”
    Volltext
    Journal Article
  6. 6

    Semidefinite Approximation for Mixed Binary Quadratically Constrained Quadratic Programs von Xu, Zi, Hong, Mingyi, Luo, Zhi-Quan

    ISSN: 1052-6234, 1095-7189
    Veröffentlicht: Philadelphia Society for Industrial and Applied Mathematics 01.01.2014
    Veröffentlicht in SIAM journal on optimization (01.01.2014)
    “… ) relaxation techniques for some mixed binary quadratically constrained quadratic programs (MBQCQP) and analyzes their approximation performance …”
    Volltext
    Journal Article
  7. 7

    Semidefinite Relaxation for Two Mixed Binary Quadratically Constrained Quadratic Programs: Algorithms and Approximation Bounds von Xu, Zi, Hong, Ming-Yi

    ISSN: 2194-668X, 2194-6698
    Veröffentlicht: Beijing Operations Research Society of China 01.06.2016
    “… This paper develops new semidefinite programming (SDP) relaxation techniques for two classes of mixed binary quadratically constrained quadratic programs and analyzes their approximation performance …”
    Volltext
    Journal Article
  8. 8

    QPLIB: a library of quadratic programming instances von Furini, Fabio, Traversi, Emiliano, Belotti, Pietro, Frangioni, Antonio, Gleixner, Ambros, Gould, Nick, Liberti, Leo, Lodi, Andrea, Misener, Ruth, Mittelmann, Hans, Sahinidis, Nikolaos V., Vigerske, Stefan, Wiegele, Angelika

    ISSN: 1867-2949, 1867-2957
    Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2019
    Veröffentlicht in Mathematical programming computation (01.06.2019)
    “… This paper describes a new instance library for quadratic programming (QP), i.e., the family of continuous and (mixed …”
    Volltext
    Journal Article
  9. 9

    KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems von Lu, Cheng, Fang, Shu-Cherng, Jin, Qingwei, Wang, Zhenbo, Xing, Wenxun

    ISSN: 1052-6234, 1095-7189
    Veröffentlicht: Philadelphia Society for Industrial and Applied Mathematics 01.10.2011
    Veröffentlicht in SIAM journal on optimization (01.10.2011)
    “… To find a global optimal solution to the quadratically constrained quadratic programming problem, we explore the relationship between its Lagrangian multipliers and related linear conic programming problems …”
    Volltext
    Journal Article
  10. 10

    Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems von Castro, Pedro M., Liao, Qi, Liang, Yongtu

    ISSN: 1389-4420, 1573-2924
    Veröffentlicht: New York Springer US 01.06.2022
    Veröffentlicht in Optimization and engineering (01.06.2022)
    “… Piecewise relaxations are powerful techniques to compute strong dual bounds for (mixed-integer) quadratically constrained problems and provide starting points …”
    Volltext
    Journal Article
  11. 11

    Symmetry Detection for Quadratic Optimization Using Binary Layered Graphs von Kouyialis, Georgia, Wang, Xiaoyu, Misener, Ruth

    ISSN: 2227-9717, 2227-9717
    Veröffentlicht: Basel MDPI AG 01.11.2019
    Veröffentlicht in Processes (01.11.2019)
    “… , of branch-and-bound when symmetry induces many equivalent branches. This paper develops detection methods for symmetry groups in quadratically-constrained quadratic optimization problems …”
    Volltext
    Journal Article
  12. 12

    Semidefinite approximation for mixed binary quadratically constrained quadratic programs von Xu, Zi, Hong, Mingyi, Zhi-Quan Luo

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 17.03.2014
    Veröffentlicht in arXiv.org (17.03.2014)
    “… ) relaxation techniques for some mixed binary quadratically constrained quadratic programs (MBQCQP) and analyzes their approximation performance …”
    Volltext
    Paper
  13. 13

    Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming von Andrade, Tiago, Oliveira, Fabricio, Hamacher, Silvio, Eberhard, Andrew

    ISSN: 0925-5001, 1573-2916
    Veröffentlicht: New York Springer US 15.04.2019
    Veröffentlicht in Journal of global optimization (15.04.2019)
    “… ). These relaxations constitute a key component for some methods for solving nonconvex mixed-integer quadratically constrained quadratic programming (MIQCQP) problems …”
    Volltext
    Journal Article
  14. 14

    Convex Polar Second-Order Taylor Approximation of AC Power Flows: A Unit Commitment Study von Sepetanc, Karlo, Pandzic, Hrvoje

    ISSN: 0885-8950, 1558-0679
    Veröffentlicht: New York IEEE 01.07.2021
    Veröffentlicht in IEEE transactions on power systems (01.07.2021)
    “… Modern mixed-integer quadratic solvers generally handle binary variables more efficiently than nonlinear mixed-integer solvers …”
    Volltext
    Journal Article
  15. 15

    A Bi-Level Branch and Bound Method for Economic Dispatch With Disjoint Prohibited Zones Considering Network Losses von Ding, Tao, Bo, Rui, Li, Fangxing, Sun, Hongbin

    ISSN: 0885-8950, 1558-0679
    Veröffentlicht: New York IEEE 01.11.2015
    Veröffentlicht in IEEE transactions on power systems (01.11.2015)
    “… The approach employs binary variables for each prohibited zone and utilizes the B-coefficient for network losses, which can be transformed into a mixed-integer quadratically constrained quadratic programming (MIQCQP …”
    Volltext
    Journal Article
  16. 16

    Semidefinite Relaxation for Two Mixed Binary Quadratically Constrained Quadratic Programs: Algorithms and Approximation Bounds von Xu, Zi, Hong, Mingyi

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 17.03.2014
    Veröffentlicht in arXiv.org (17.03.2014)
    “… This paper develops new semidefinite programming (SDP) relaxation techniques for two classes of mixed binary quadratically constrained quadratic programs (MBQCQP …”
    Volltext
    Paper
  17. 17

    Joint multicast beamforming and user scheduling in large-scale antenna systems von Zhou, Longfei, Xu, Zi, Jiang, Wei, Luo, Wu

    ISSN: 1751-8628, 1751-8636
    Veröffentlicht: The Institution of Engineering and Technology 17.07.2018
    Veröffentlicht in IET communications (17.07.2018)
    “… channel and designing multicast beamformer for each channel. The problem of interest is formulated in two different optimisation problems, a mixed binary quadratically constrained quadratic program and a highly-structured non-smooth program …”
    Volltext
    Journal Article
  18. 18

    Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme von Adasme, Pablo, Lisser, Abdel, Soto, Ismael

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Veröffentlicht: Kidlington Elsevier Ltd 01.10.2011
    Veröffentlicht in Computers & operations research (01.10.2011)
    “… This paper proposes two robust binary quadratically constrained quadratic programs (BQCQP …”
    Volltext
    Journal Article
  19. 19

    A Quantum Approach for Stochastic Constrained Binary Optimization von Gupta, Sarthak, Kekatos, Vassilis

    ISSN: 2379-190X
    Veröffentlicht: IEEE 04.06.2023
    “… To this end, this work puts forth a quantum heuristic to cope with stochastic binary quadratically constrained quadratic programs (QCQP …”
    Volltext
    Tagungsbericht
  20. 20

    Computing tight bounds via piecewise linear functions through the example of circle cutting problems von Rebennack, Steffen

    ISSN: 1432-2994, 1432-5217
    Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2016
    “… Specifically, piecewise linear functions are employed to yield mixed-integer linear programming problems which provide lower and upper bounds on the original problem, the circle cutting problem …”
    Volltext
    Journal Article