Mixed Monotonic Programming for Fast Global Optimization

While globally optimal solutions to many convex programs can be computed efficiently in polynomial time, this is, in general, not possible for nonconvex optimization problems. Therefore, locally optimal approaches or other efficient suboptimal heuristics are usually applied for practical implementat...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on signal processing Ročník 68; s. 2529 - 2544
Hlavní autoři:	Matthiesen, Bho, Hellings, Christoph, Jorswieck, Eduard A., Utschick, Wolfgang
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms branch-and-bound Clean energy Communications systems Computer simulation Convergence Energy conversion efficiency Global optimization Interference interference networks Linear programming monotonic optimization Nonlinear programming Optimization Polynomials Programming Quality of service architectures Resource allocation Resource management Signal processing Signal processing algorithms
ISSN:	1053-587X, 1941-0476
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!