Suchergebnisse - "Difference of convex functions programming problem"

  • Treffer 1 - 6 von 6
Treffer weiter einschränken
  1. 1

    Difference of Convex Functions Programming With Machine-Learning Prior for the Imaging Problem in Electrical Capacitance Tomography von Lei, Jing, Liu, Qibin

    ISSN: 2168-2267, 2168-2275, 2168-2275
    Veröffentlicht: United States IEEE 01.12.2023
    Veröffentlicht in IEEE transactions on cybernetics (01.12.2023)
    “… To address this problem, this study introduces the data-guided prior and combines it with the electrical measurement mechanism and the sparsity prior to produce a new difference of convex functions …”
    Volltext
    Journal Article
  2. 2

    Scheduling of steelmaking-continuous casting process using deflected surrogate Lagrangian relaxation approach and DC algorithm von Cui, Haijuan, Luo, Xiaochuan, Wang, Yuan

    ISSN: 0360-8352, 1879-0550
    Veröffentlicht: Elsevier Ltd 01.02.2020
    Veröffentlicht in Computers & industrial engineering (01.02.2020)
    “… (difference of convex functions) programming problem, which can solved by using DC algorithm …”
    Volltext
    Journal Article
  3. 3

    Joint Spectrum and Power Allocation for NOMA Enhanced Relaying Networks von Wang, Qiang, Zhao, Feng

    ISSN: 2169-3536, 2169-3536
    Veröffentlicht: Piscataway IEEE 2019
    Veröffentlicht in IEEE access (2019)
    “… In this paper, we investigate the joint resource allocation for the non-orthogonal multiple access (NOMA)-enhanced relaying networks involving the subcarrier …”
    Volltext
    Journal Article
  4. 4

    Maximal Lifetime Rate and Power Allocation for Sensor Networks with Data Distortion Constraints von Li, J.C.F., Dey, S., Evans, J.

    ISBN: 9781424403530, 1424403537
    ISSN: 1550-3607
    Veröffentlicht: IEEE 01.06.2007
    “… We address a lifetime maximization problem for a single-hop wireless sensor network where multiple sensors encode and communicate their measurements of a …”
    Volltext
    Tagungsbericht
  5. 5

    On the Optimal Precoding for MIMO Gaussian Wire-Tap Channels von Khabbazibasmenj, Arash, Girnyk, Maksym, Vorobyov, Sergiy, Vehkaperä, Mikko, Rasmussen, Lars K.

    ISBN: 3800735296, 9783800735297
    Veröffentlicht: 2013
    “… The problem formulation is shown to be equivalentto a difference of convex functions programming problem andan efficient algorithm for addressing this problem is developed …”
    Volltext
    Tagungsbericht
  6. 6

    On the Optimal Precoding for MIMO Gaussian Wire-Tap Channels von Khabbazibasmenj, Arash, Girnyk, Maksym A, Vorobyov, Sergiy A, Vehkaperä, Mikko, Rasmussen, Lars K

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 01.11.2014
    Veröffentlicht in arXiv.org (01.11.2014)
    “… The problem formulation is shown to be equivalent to a difference of convex functions programming problem and an efficient algorithm for addressing this problem is developed …”
    Volltext
    Paper