A primal-dual interior point method for optimal zero-forcing beamformer design under per-antenna power constraints
Abstract In this paper, we consider an optimal zero-forcing beamformer design problem in multi-user multiple-input multiple-output broadcast channel. The minimum user rate is maximized subject to zero-forcing constraints and power constraint on each base station antenna array element. The natural fo...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Li, Bin [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2013 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer-Verlag Berlin Heidelberg 2013 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Optimization letters - Springer Berlin Heidelberg, 2007, 8(2013), 6 vom: 23. Juli, Seite 1829-1843 |
|---|---|
| Übergeordnetes Werk: |
volume:8 ; year:2013 ; number:6 ; day:23 ; month:07 ; pages:1829-1843 |
| Links: |
|---|
| DOI / URN: |
10.1007/s11590-013-0673-y |
|---|
| Katalog-ID: |
OLC2055611194 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2055611194 | ||
| 003 | DE-627 | ||
| 005 | 20230401113855.0 | ||
| 007 | tu | ||
| 008 | 200819s2013 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s11590-013-0673-y |2 doi | |
| 035 | |a (DE-627)OLC2055611194 | ||
| 035 | |a (DE-He213)s11590-013-0673-y-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 510 |q VZ |
| 082 | 0 | 4 | |a 510 |q VZ |
| 084 | |a 31.48$jVariationsrechnung |2 bkl | ||
| 084 | |a 31.80$jAngewandte Mathematik |2 bkl | ||
| 100 | 1 | |a Li, Bin |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a A primal-dual interior point method for optimal zero-forcing beamformer design under per-antenna power constraints |
| 264 | 1 | |c 2013 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer-Verlag Berlin Heidelberg 2013 | ||
| 520 | |a Abstract In this paper, we consider an optimal zero-forcing beamformer design problem in multi-user multiple-input multiple-output broadcast channel. The minimum user rate is maximized subject to zero-forcing constraints and power constraint on each base station antenna array element. The natural formulation leads to a nonconvex optimization problem. This problem is shown to be equivalent to a convex optimization problem with linear objective function, linear equality and inequality constraints and quadratic inequality constraints. Here, the indirect elimination method is applied to reduce the convex optimization problem into an equivalent convex optimization problem of lower dimension with only inequality constraints. The primal-dual interior point method is utilized to develop an effective algorithm (in terms of computational efficiency) via solving the modified KKT equations with Newton method. Numerical simulations are carried out. Compared to algorithms based on a trust region interior point method and sequential quadratic programming method, it is observed that the method proposed is much superior in terms of computational efficiency. | ||
| 650 | 4 | |a Zero-forcing beamforming | |
| 650 | 4 | |a Per-antenna power constraints | |
| 650 | 4 | |a Primal-dual interior point method | |
| 650 | 4 | |a Newton method | |
| 700 | 1 | |a Dam, Hai Huyen |4 aut | |
| 700 | 1 | |a Cantoni, Antonio |4 aut | |
| 700 | 1 | |a Teo, Kok Lay |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Optimization letters |d Springer Berlin Heidelberg, 2007 |g 8(2013), 6 vom: 23. Juli, Seite 1829-1843 |w (DE-627)527562920 |w (DE-600)2274663-8 |w (DE-576)272713724 |x 1862-4472 |7 nnns |
| 773 | 1 | 8 | |g volume:8 |g year:2013 |g number:6 |g day:23 |g month:07 |g pages:1829-1843 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s11590-013-0673-y |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-WIW | ||
| 912 | |a GBV_ILN_26 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_267 | ||
| 912 | |a GBV_ILN_2018 | ||
| 936 | b | k | |a 31.48$jVariationsrechnung |q VZ |0 106408143 |0 (DE-625)106408143 |
| 936 | b | k | |a 31.80$jAngewandte Mathematik |q VZ |0 106419005 |0 (DE-625)106419005 |
| 951 | |a AR | ||
| 952 | |d 8 |j 2013 |e 6 |b 23 |c 07 |h 1829-1843 | ||
| author_variant |
b l bl h h d hh hhd a c ac k l t kl klt |
|---|---|
| matchkey_str |
article:18624472:2013----::piadaitropitehdootmleoocnbafredsgudr |
| hierarchy_sort_str |
2013 |
| bklnumber |
31.48$jVariationsrechnung 31.80$jAngewandte Mathematik |
| publishDate |
2013 |
| allfields |
10.1007/s11590-013-0673-y doi (DE-627)OLC2055611194 (DE-He213)s11590-013-0673-y-p DE-627 ger DE-627 rakwb eng 510 VZ 510 VZ 31.48$jVariationsrechnung bkl 31.80$jAngewandte Mathematik bkl Li, Bin verfasserin aut A primal-dual interior point method for optimal zero-forcing beamformer design under per-antenna power constraints 2013 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag Berlin Heidelberg 2013 Abstract In this paper, we consider an optimal zero-forcing beamformer design problem in multi-user multiple-input multiple-output broadcast channel. The minimum user rate is maximized subject to zero-forcing constraints and power constraint on each base station antenna array element. The natural formulation leads to a nonconvex optimization problem. This problem is shown to be equivalent to a convex optimization problem with linear objective function, linear equality and inequality constraints and quadratic inequality constraints. Here, the indirect elimination method is applied to reduce the convex optimization problem into an equivalent convex optimization problem of lower dimension with only inequality constraints. The primal-dual interior point method is utilized to develop an effective algorithm (in terms of computational efficiency) via solving the modified KKT equations with Newton method. Numerical simulations are carried out. Compared to algorithms based on a trust region interior point method and sequential quadratic programming method, it is observed that the method proposed is much superior in terms of computational efficiency. Zero-forcing beamforming Per-antenna power constraints Primal-dual interior point method Newton method Dam, Hai Huyen aut Cantoni, Antonio aut Teo, Kok Lay aut Enthalten in Optimization letters Springer Berlin Heidelberg, 2007 8(2013), 6 vom: 23. Juli, Seite 1829-1843 (DE-627)527562920 (DE-600)2274663-8 (DE-576)272713724 1862-4472 nnns volume:8 year:2013 number:6 day:23 month:07 pages:1829-1843 https://doi.org/10.1007/s11590-013-0673-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW GBV_ILN_26 GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 31.48$jVariationsrechnung VZ 106408143 (DE-625)106408143 31.80$jAngewandte Mathematik VZ 106419005 (DE-625)106419005 AR 8 2013 6 23 07 1829-1843 |
| spelling |
10.1007/s11590-013-0673-y doi (DE-627)OLC2055611194 (DE-He213)s11590-013-0673-y-p DE-627 ger DE-627 rakwb eng 510 VZ 510 VZ 31.48$jVariationsrechnung bkl 31.80$jAngewandte Mathematik bkl Li, Bin verfasserin aut A primal-dual interior point method for optimal zero-forcing beamformer design under per-antenna power constraints 2013 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag Berlin Heidelberg 2013 Abstract In this paper, we consider an optimal zero-forcing beamformer design problem in multi-user multiple-input multiple-output broadcast channel. The minimum user rate is maximized subject to zero-forcing constraints and power constraint on each base station antenna array element. The natural formulation leads to a nonconvex optimization problem. This problem is shown to be equivalent to a convex optimization problem with linear objective function, linear equality and inequality constraints and quadratic inequality constraints. Here, the indirect elimination method is applied to reduce the convex optimization problem into an equivalent convex optimization problem of lower dimension with only inequality constraints. The primal-dual interior point method is utilized to develop an effective algorithm (in terms of computational efficiency) via solving the modified KKT equations with Newton method. Numerical simulations are carried out. Compared to algorithms based on a trust region interior point method and sequential quadratic programming method, it is observed that the method proposed is much superior in terms of computational efficiency. Zero-forcing beamforming Per-antenna power constraints Primal-dual interior point method Newton method Dam, Hai Huyen aut Cantoni, Antonio aut Teo, Kok Lay aut Enthalten in Optimization letters Springer Berlin Heidelberg, 2007 8(2013), 6 vom: 23. Juli, Seite 1829-1843 (DE-627)527562920 (DE-600)2274663-8 (DE-576)272713724 1862-4472 nnns volume:8 year:2013 number:6 day:23 month:07 pages:1829-1843 https://doi.org/10.1007/s11590-013-0673-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW GBV_ILN_26 GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 31.48$jVariationsrechnung VZ 106408143 (DE-625)106408143 31.80$jAngewandte Mathematik VZ 106419005 (DE-625)106419005 AR 8 2013 6 23 07 1829-1843 |
| allfields_unstemmed |
10.1007/s11590-013-0673-y doi (DE-627)OLC2055611194 (DE-He213)s11590-013-0673-y-p DE-627 ger DE-627 rakwb eng 510 VZ 510 VZ 31.48$jVariationsrechnung bkl 31.80$jAngewandte Mathematik bkl Li, Bin verfasserin aut A primal-dual interior point method for optimal zero-forcing beamformer design under per-antenna power constraints 2013 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag Berlin Heidelberg 2013 Abstract In this paper, we consider an optimal zero-forcing beamformer design problem in multi-user multiple-input multiple-output broadcast channel. The minimum user rate is maximized subject to zero-forcing constraints and power constraint on each base station antenna array element. The natural formulation leads to a nonconvex optimization problem. This problem is shown to be equivalent to a convex optimization problem with linear objective function, linear equality and inequality constraints and quadratic inequality constraints. Here, the indirect elimination method is applied to reduce the convex optimization problem into an equivalent convex optimization problem of lower dimension with only inequality constraints. The primal-dual interior point method is utilized to develop an effective algorithm (in terms of computational efficiency) via solving the modified KKT equations with Newton method. Numerical simulations are carried out. Compared to algorithms based on a trust region interior point method and sequential quadratic programming method, it is observed that the method proposed is much superior in terms of computational efficiency. Zero-forcing beamforming Per-antenna power constraints Primal-dual interior point method Newton method Dam, Hai Huyen aut Cantoni, Antonio aut Teo, Kok Lay aut Enthalten in Optimization letters Springer Berlin Heidelberg, 2007 8(2013), 6 vom: 23. Juli, Seite 1829-1843 (DE-627)527562920 (DE-600)2274663-8 (DE-576)272713724 1862-4472 nnns volume:8 year:2013 number:6 day:23 month:07 pages:1829-1843 https://doi.org/10.1007/s11590-013-0673-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW GBV_ILN_26 GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 31.48$jVariationsrechnung VZ 106408143 (DE-625)106408143 31.80$jAngewandte Mathematik VZ 106419005 (DE-625)106419005 AR 8 2013 6 23 07 1829-1843 |
| allfieldsGer |
10.1007/s11590-013-0673-y doi (DE-627)OLC2055611194 (DE-He213)s11590-013-0673-y-p DE-627 ger DE-627 rakwb eng 510 VZ 510 VZ 31.48$jVariationsrechnung bkl 31.80$jAngewandte Mathematik bkl Li, Bin verfasserin aut A primal-dual interior point method for optimal zero-forcing beamformer design under per-antenna power constraints 2013 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag Berlin Heidelberg 2013 Abstract In this paper, we consider an optimal zero-forcing beamformer design problem in multi-user multiple-input multiple-output broadcast channel. The minimum user rate is maximized subject to zero-forcing constraints and power constraint on each base station antenna array element. The natural formulation leads to a nonconvex optimization problem. This problem is shown to be equivalent to a convex optimization problem with linear objective function, linear equality and inequality constraints and quadratic inequality constraints. Here, the indirect elimination method is applied to reduce the convex optimization problem into an equivalent convex optimization problem of lower dimension with only inequality constraints. The primal-dual interior point method is utilized to develop an effective algorithm (in terms of computational efficiency) via solving the modified KKT equations with Newton method. Numerical simulations are carried out. Compared to algorithms based on a trust region interior point method and sequential quadratic programming method, it is observed that the method proposed is much superior in terms of computational efficiency. Zero-forcing beamforming Per-antenna power constraints Primal-dual interior point method Newton method Dam, Hai Huyen aut Cantoni, Antonio aut Teo, Kok Lay aut Enthalten in Optimization letters Springer Berlin Heidelberg, 2007 8(2013), 6 vom: 23. Juli, Seite 1829-1843 (DE-627)527562920 (DE-600)2274663-8 (DE-576)272713724 1862-4472 nnns volume:8 year:2013 number:6 day:23 month:07 pages:1829-1843 https://doi.org/10.1007/s11590-013-0673-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW GBV_ILN_26 GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 31.48$jVariationsrechnung VZ 106408143 (DE-625)106408143 31.80$jAngewandte Mathematik VZ 106419005 (DE-625)106419005 AR 8 2013 6 23 07 1829-1843 |
| allfieldsSound |
10.1007/s11590-013-0673-y doi (DE-627)OLC2055611194 (DE-He213)s11590-013-0673-y-p DE-627 ger DE-627 rakwb eng 510 VZ 510 VZ 31.48$jVariationsrechnung bkl 31.80$jAngewandte Mathematik bkl Li, Bin verfasserin aut A primal-dual interior point method for optimal zero-forcing beamformer design under per-antenna power constraints 2013 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag Berlin Heidelberg 2013 Abstract In this paper, we consider an optimal zero-forcing beamformer design problem in multi-user multiple-input multiple-output broadcast channel. The minimum user rate is maximized subject to zero-forcing constraints and power constraint on each base station antenna array element. The natural formulation leads to a nonconvex optimization problem. This problem is shown to be equivalent to a convex optimization problem with linear objective function, linear equality and inequality constraints and quadratic inequality constraints. Here, the indirect elimination method is applied to reduce the convex optimization problem into an equivalent convex optimization problem of lower dimension with only inequality constraints. The primal-dual interior point method is utilized to develop an effective algorithm (in terms of computational efficiency) via solving the modified KKT equations with Newton method. Numerical simulations are carried out. Compared to algorithms based on a trust region interior point method and sequential quadratic programming method, it is observed that the method proposed is much superior in terms of computational efficiency. Zero-forcing beamforming Per-antenna power constraints Primal-dual interior point method Newton method Dam, Hai Huyen aut Cantoni, Antonio aut Teo, Kok Lay aut Enthalten in Optimization letters Springer Berlin Heidelberg, 2007 8(2013), 6 vom: 23. Juli, Seite 1829-1843 (DE-627)527562920 (DE-600)2274663-8 (DE-576)272713724 1862-4472 nnns volume:8 year:2013 number:6 day:23 month:07 pages:1829-1843 https://doi.org/10.1007/s11590-013-0673-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW GBV_ILN_26 GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 31.48$jVariationsrechnung VZ 106408143 (DE-625)106408143 31.80$jAngewandte Mathematik VZ 106419005 (DE-625)106419005 AR 8 2013 6 23 07 1829-1843 |
| language |
English |
| source |
Enthalten in Optimization letters 8(2013), 6 vom: 23. Juli, Seite 1829-1843 volume:8 year:2013 number:6 day:23 month:07 pages:1829-1843 |
| sourceStr |
Enthalten in Optimization letters 8(2013), 6 vom: 23. Juli, Seite 1829-1843 volume:8 year:2013 number:6 day:23 month:07 pages:1829-1843 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Zero-forcing beamforming Per-antenna power constraints Primal-dual interior point method Newton method |
| dewey-raw |
510 |
| isfreeaccess_bool |
false |
| container_title |
Optimization letters |
| authorswithroles_txt_mv |
Li, Bin @@aut@@ Dam, Hai Huyen @@aut@@ Cantoni, Antonio @@aut@@ Teo, Kok Lay @@aut@@ |
| publishDateDaySort_date |
2013-07-23T00:00:00Z |
| hierarchy_top_id |
527562920 |
| dewey-sort |
3510 |
| id |
OLC2055611194 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2055611194</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230401113855.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2013 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11590-013-0673-y</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2055611194</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11590-013-0673-y-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.48$jVariationsrechnung</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.80$jAngewandte Mathematik</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Li, Bin</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A primal-dual interior point method for optimal zero-forcing beamformer design under per-antenna power constraints</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2013</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag Berlin Heidelberg 2013</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In this paper, we consider an optimal zero-forcing beamformer design problem in multi-user multiple-input multiple-output broadcast channel. The minimum user rate is maximized subject to zero-forcing constraints and power constraint on each base station antenna array element. The natural formulation leads to a nonconvex optimization problem. This problem is shown to be equivalent to a convex optimization problem with linear objective function, linear equality and inequality constraints and quadratic inequality constraints. Here, the indirect elimination method is applied to reduce the convex optimization problem into an equivalent convex optimization problem of lower dimension with only inequality constraints. The primal-dual interior point method is utilized to develop an effective algorithm (in terms of computational efficiency) via solving the modified KKT equations with Newton method. Numerical simulations are carried out. Compared to algorithms based on a trust region interior point method and sequential quadratic programming method, it is observed that the method proposed is much superior in terms of computational efficiency.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Zero-forcing beamforming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Per-antenna power constraints</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Primal-dual interior point method</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Newton method</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Dam, Hai Huyen</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Cantoni, Antonio</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Teo, Kok Lay</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Optimization letters</subfield><subfield code="d">Springer Berlin Heidelberg, 2007</subfield><subfield code="g">8(2013), 6 vom: 23. Juli, Seite 1829-1843</subfield><subfield code="w">(DE-627)527562920</subfield><subfield code="w">(DE-600)2274663-8</subfield><subfield code="w">(DE-576)272713724</subfield><subfield code="x">1862-4472</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:8</subfield><subfield code="g">year:2013</subfield><subfield code="g">number:6</subfield><subfield code="g">day:23</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:1829-1843</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11590-013-0673-y</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">31.48$jVariationsrechnung</subfield><subfield code="q">VZ</subfield><subfield code="0">106408143</subfield><subfield code="0">(DE-625)106408143</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">31.80$jAngewandte Mathematik</subfield><subfield code="q">VZ</subfield><subfield code="0">106419005</subfield><subfield code="0">(DE-625)106419005</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">8</subfield><subfield code="j">2013</subfield><subfield code="e">6</subfield><subfield code="b">23</subfield><subfield code="c">07</subfield><subfield code="h">1829-1843</subfield></datafield></record></collection>
|
| author |
Li, Bin |
| spellingShingle |
Li, Bin ddc 510 bkl 31.48$jVariationsrechnung bkl 31.80$jAngewandte Mathematik misc Zero-forcing beamforming misc Per-antenna power constraints misc Primal-dual interior point method misc Newton method A primal-dual interior point method for optimal zero-forcing beamformer design under per-antenna power constraints |
| authorStr |
Li, Bin |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)527562920 |
| format |
Article |
| dewey-ones |
510 - Mathematics |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1862-4472 |
| topic_title |
510 VZ 31.48$jVariationsrechnung bkl 31.80$jAngewandte Mathematik bkl A primal-dual interior point method for optimal zero-forcing beamformer design under per-antenna power constraints Zero-forcing beamforming Per-antenna power constraints Primal-dual interior point method Newton method |
| topic |
ddc 510 bkl 31.48$jVariationsrechnung bkl 31.80$jAngewandte Mathematik misc Zero-forcing beamforming misc Per-antenna power constraints misc Primal-dual interior point method misc Newton method |
| topic_unstemmed |
ddc 510 bkl 31.48$jVariationsrechnung bkl 31.80$jAngewandte Mathematik misc Zero-forcing beamforming misc Per-antenna power constraints misc Primal-dual interior point method misc Newton method |
| topic_browse |
ddc 510 bkl 31.48$jVariationsrechnung bkl 31.80$jAngewandte Mathematik misc Zero-forcing beamforming misc Per-antenna power constraints misc Primal-dual interior point method misc Newton method |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Optimization letters |
| hierarchy_parent_id |
527562920 |
| dewey-tens |
510 - Mathematics |
| hierarchy_top_title |
Optimization letters |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)527562920 (DE-600)2274663-8 (DE-576)272713724 |
| title |
A primal-dual interior point method for optimal zero-forcing beamformer design under per-antenna power constraints |
| ctrlnum |
(DE-627)OLC2055611194 (DE-He213)s11590-013-0673-y-p |
| title_full |
A primal-dual interior point method for optimal zero-forcing beamformer design under per-antenna power constraints |
| author_sort |
Li, Bin |
| journal |
Optimization letters |
| journalStr |
Optimization letters |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
500 - Science |
| recordtype |
marc |
| publishDateSort |
2013 |
| contenttype_str_mv |
txt |
| container_start_page |
1829 |
| author_browse |
Li, Bin Dam, Hai Huyen Cantoni, Antonio Teo, Kok Lay |
| container_volume |
8 |
| class |
510 VZ 31.48$jVariationsrechnung bkl 31.80$jAngewandte Mathematik bkl |
| format_se |
Aufsätze |
| author-letter |
Li, Bin |
| doi_str_mv |
10.1007/s11590-013-0673-y |
| normlink |
106408143 106419005 |
| normlink_prefix_str_mv |
106408143 (DE-625)106408143 106419005 (DE-625)106419005 |
| dewey-full |
510 |
| title_sort |
a primal-dual interior point method for optimal zero-forcing beamformer design under per-antenna power constraints |
| title_auth |
A primal-dual interior point method for optimal zero-forcing beamformer design under per-antenna power constraints |
| abstract |
Abstract In this paper, we consider an optimal zero-forcing beamformer design problem in multi-user multiple-input multiple-output broadcast channel. The minimum user rate is maximized subject to zero-forcing constraints and power constraint on each base station antenna array element. The natural formulation leads to a nonconvex optimization problem. This problem is shown to be equivalent to a convex optimization problem with linear objective function, linear equality and inequality constraints and quadratic inequality constraints. Here, the indirect elimination method is applied to reduce the convex optimization problem into an equivalent convex optimization problem of lower dimension with only inequality constraints. The primal-dual interior point method is utilized to develop an effective algorithm (in terms of computational efficiency) via solving the modified KKT equations with Newton method. Numerical simulations are carried out. Compared to algorithms based on a trust region interior point method and sequential quadratic programming method, it is observed that the method proposed is much superior in terms of computational efficiency. © Springer-Verlag Berlin Heidelberg 2013 |
| abstractGer |
Abstract In this paper, we consider an optimal zero-forcing beamformer design problem in multi-user multiple-input multiple-output broadcast channel. The minimum user rate is maximized subject to zero-forcing constraints and power constraint on each base station antenna array element. The natural formulation leads to a nonconvex optimization problem. This problem is shown to be equivalent to a convex optimization problem with linear objective function, linear equality and inequality constraints and quadratic inequality constraints. Here, the indirect elimination method is applied to reduce the convex optimization problem into an equivalent convex optimization problem of lower dimension with only inequality constraints. The primal-dual interior point method is utilized to develop an effective algorithm (in terms of computational efficiency) via solving the modified KKT equations with Newton method. Numerical simulations are carried out. Compared to algorithms based on a trust region interior point method and sequential quadratic programming method, it is observed that the method proposed is much superior in terms of computational efficiency. © Springer-Verlag Berlin Heidelberg 2013 |
| abstract_unstemmed |
Abstract In this paper, we consider an optimal zero-forcing beamformer design problem in multi-user multiple-input multiple-output broadcast channel. The minimum user rate is maximized subject to zero-forcing constraints and power constraint on each base station antenna array element. The natural formulation leads to a nonconvex optimization problem. This problem is shown to be equivalent to a convex optimization problem with linear objective function, linear equality and inequality constraints and quadratic inequality constraints. Here, the indirect elimination method is applied to reduce the convex optimization problem into an equivalent convex optimization problem of lower dimension with only inequality constraints. The primal-dual interior point method is utilized to develop an effective algorithm (in terms of computational efficiency) via solving the modified KKT equations with Newton method. Numerical simulations are carried out. Compared to algorithms based on a trust region interior point method and sequential quadratic programming method, it is observed that the method proposed is much superior in terms of computational efficiency. © Springer-Verlag Berlin Heidelberg 2013 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW GBV_ILN_26 GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 |
| container_issue |
6 |
| title_short |
A primal-dual interior point method for optimal zero-forcing beamformer design under per-antenna power constraints |
| url |
https://doi.org/10.1007/s11590-013-0673-y |
| remote_bool |
false |
| author2 |
Dam, Hai Huyen Cantoni, Antonio Teo, Kok Lay |
| author2Str |
Dam, Hai Huyen Cantoni, Antonio Teo, Kok Lay |
| ppnlink |
527562920 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s11590-013-0673-y |
| up_date |
2024-07-04T02:37:41.332Z |
| _version_ |
1803614328018960384 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2055611194</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230401113855.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2013 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11590-013-0673-y</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2055611194</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11590-013-0673-y-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.48$jVariationsrechnung</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.80$jAngewandte Mathematik</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Li, Bin</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A primal-dual interior point method for optimal zero-forcing beamformer design under per-antenna power constraints</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2013</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag Berlin Heidelberg 2013</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In this paper, we consider an optimal zero-forcing beamformer design problem in multi-user multiple-input multiple-output broadcast channel. The minimum user rate is maximized subject to zero-forcing constraints and power constraint on each base station antenna array element. The natural formulation leads to a nonconvex optimization problem. This problem is shown to be equivalent to a convex optimization problem with linear objective function, linear equality and inequality constraints and quadratic inequality constraints. Here, the indirect elimination method is applied to reduce the convex optimization problem into an equivalent convex optimization problem of lower dimension with only inequality constraints. The primal-dual interior point method is utilized to develop an effective algorithm (in terms of computational efficiency) via solving the modified KKT equations with Newton method. Numerical simulations are carried out. Compared to algorithms based on a trust region interior point method and sequential quadratic programming method, it is observed that the method proposed is much superior in terms of computational efficiency.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Zero-forcing beamforming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Per-antenna power constraints</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Primal-dual interior point method</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Newton method</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Dam, Hai Huyen</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Cantoni, Antonio</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Teo, Kok Lay</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Optimization letters</subfield><subfield code="d">Springer Berlin Heidelberg, 2007</subfield><subfield code="g">8(2013), 6 vom: 23. Juli, Seite 1829-1843</subfield><subfield code="w">(DE-627)527562920</subfield><subfield code="w">(DE-600)2274663-8</subfield><subfield code="w">(DE-576)272713724</subfield><subfield code="x">1862-4472</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:8</subfield><subfield code="g">year:2013</subfield><subfield code="g">number:6</subfield><subfield code="g">day:23</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:1829-1843</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11590-013-0673-y</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">31.48$jVariationsrechnung</subfield><subfield code="q">VZ</subfield><subfield code="0">106408143</subfield><subfield code="0">(DE-625)106408143</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">31.80$jAngewandte Mathematik</subfield><subfield code="q">VZ</subfield><subfield code="0">106419005</subfield><subfield code="0">(DE-625)106419005</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">8</subfield><subfield code="j">2013</subfield><subfield code="e">6</subfield><subfield code="b">23</subfield><subfield code="c">07</subfield><subfield code="h">1829-1843</subfield></datafield></record></collection>
|
| score |
7.4021845 |