A convex optimization model for finding non-negative polynomials
This paper presents a convex optimization model for the problem of finding some polynomials for which certain linear combinations are non-negative polynomials. This model is then applied to solve several filter design problems. We first reformulate some low-pass filter design problems, with finite o...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Le, Thanh Hieu [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2016transfer abstract |
|---|
| Schlagwörter: |
|---|
| Umfang: |
14 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Dielectric relaxation and microwave dielectric properties of low temperature sintering LiMnPO4 ceramics - Hu, Xing ELSEVIER, 2015transfer abstract, Amsterdam [u.a.] |
|---|---|
| Übergeordnetes Werk: |
volume:301 ; year:2016 ; day:1 ; month:08 ; pages:121-134 ; extent:14 |
| Links: |
|---|
| DOI / URN: |
10.1016/j.cam.2016.01.018 |
|---|
| Katalog-ID: |
ELV024520772 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | ELV024520772 | ||
| 003 | DE-627 | ||
| 005 | 20230625143017.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 180603s2016 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1016/j.cam.2016.01.018 |2 doi | |
| 028 | 5 | 2 | |a GBV00000000000151A.pica |
| 035 | |a (DE-627)ELV024520772 | ||
| 035 | |a (ELSEVIER)S0377-0427(16)00029-7 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | |a 510 | |
| 082 | 0 | 4 | |a 510 |q DE-600 |
| 082 | 0 | 4 | |a 670 |q VZ |
| 082 | 0 | 4 | |a 540 |q VZ |
| 082 | 0 | 4 | |a 630 |q VZ |
| 100 | 1 | |a Le, Thanh Hieu |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a A convex optimization model for finding non-negative polynomials |
| 264 | 1 | |c 2016transfer abstract | |
| 300 | |a 14 | ||
| 336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
| 337 | |a nicht spezifiziert |b z |2 rdamedia | ||
| 338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
| 520 | |a This paper presents a convex optimization model for the problem of finding some polynomials for which certain linear combinations are non-negative polynomials. This model is then applied to solve several filter design problems. We first reformulate some low-pass filter design problems, with finite or infinite impulse response, as optimization problems over non-negative (real or complex) polynomials whose feasibility problems can be solved by applying our model. The whole optimization problems are then solved by using a combination of a bisection search procedure on an appropriate parameter and our convex optimization model to solve the feasibility problems. Some numerical examples illustrate the method. | ||
| 520 | |a This paper presents a convex optimization model for the problem of finding some polynomials for which certain linear combinations are non-negative polynomials. This model is then applied to solve several filter design problems. We first reformulate some low-pass filter design problems, with finite or infinite impulse response, as optimization problems over non-negative (real or complex) polynomials whose feasibility problems can be solved by applying our model. The whole optimization problems are then solved by using a combination of a bisection search procedure on an appropriate parameter and our convex optimization model to solve the feasibility problems. Some numerical examples illustrate the method. | ||
| 650 | 7 | |a Non-negative polynomial |2 Elsevier | |
| 650 | 7 | |a Sum of squares |2 Elsevier | |
| 650 | 7 | |a Sum of square magnitudes of polynomials |2 Elsevier | |
| 650 | 7 | |a Filter design problem |2 Elsevier | |
| 700 | 1 | |a Van Barel, Marc |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |n North-Holland |a Hu, Xing ELSEVIER |t Dielectric relaxation and microwave dielectric properties of low temperature sintering LiMnPO4 ceramics |d 2015transfer abstract |g Amsterdam [u.a.] |w (DE-627)ELV013217658 |
| 773 | 1 | 8 | |g volume:301 |g year:2016 |g day:1 |g month:08 |g pages:121-134 |g extent:14 |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.cam.2016.01.018 |3 Volltext |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a GBV_ELV | ||
| 912 | |a SYSFLAG_U | ||
| 912 | |a SSG-OLC-PHA | ||
| 951 | |a AR | ||
| 952 | |d 301 |j 2016 |b 1 |c 0801 |h 121-134 |g 14 | ||
| 953 | |2 045F |a 510 | ||
| author_variant |
t h l th thl |
|---|---|
| matchkey_str |
lethanhhieuvanbarelmarc:2016----:cneotmztomdlofnigongt |
| hierarchy_sort_str |
2016transfer abstract |
| publishDate |
2016 |
| allfields |
10.1016/j.cam.2016.01.018 doi GBV00000000000151A.pica (DE-627)ELV024520772 (ELSEVIER)S0377-0427(16)00029-7 DE-627 ger DE-627 rakwb eng 510 510 DE-600 670 VZ 540 VZ 630 VZ Le, Thanh Hieu verfasserin aut A convex optimization model for finding non-negative polynomials 2016transfer abstract 14 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier This paper presents a convex optimization model for the problem of finding some polynomials for which certain linear combinations are non-negative polynomials. This model is then applied to solve several filter design problems. We first reformulate some low-pass filter design problems, with finite or infinite impulse response, as optimization problems over non-negative (real or complex) polynomials whose feasibility problems can be solved by applying our model. The whole optimization problems are then solved by using a combination of a bisection search procedure on an appropriate parameter and our convex optimization model to solve the feasibility problems. Some numerical examples illustrate the method. This paper presents a convex optimization model for the problem of finding some polynomials for which certain linear combinations are non-negative polynomials. This model is then applied to solve several filter design problems. We first reformulate some low-pass filter design problems, with finite or infinite impulse response, as optimization problems over non-negative (real or complex) polynomials whose feasibility problems can be solved by applying our model. The whole optimization problems are then solved by using a combination of a bisection search procedure on an appropriate parameter and our convex optimization model to solve the feasibility problems. Some numerical examples illustrate the method. Non-negative polynomial Elsevier Sum of squares Elsevier Sum of square magnitudes of polynomials Elsevier Filter design problem Elsevier Van Barel, Marc oth Enthalten in North-Holland Hu, Xing ELSEVIER Dielectric relaxation and microwave dielectric properties of low temperature sintering LiMnPO4 ceramics 2015transfer abstract Amsterdam [u.a.] (DE-627)ELV013217658 volume:301 year:2016 day:1 month:08 pages:121-134 extent:14 https://doi.org/10.1016/j.cam.2016.01.018 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA AR 301 2016 1 0801 121-134 14 045F 510 |
| spelling |
10.1016/j.cam.2016.01.018 doi GBV00000000000151A.pica (DE-627)ELV024520772 (ELSEVIER)S0377-0427(16)00029-7 DE-627 ger DE-627 rakwb eng 510 510 DE-600 670 VZ 540 VZ 630 VZ Le, Thanh Hieu verfasserin aut A convex optimization model for finding non-negative polynomials 2016transfer abstract 14 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier This paper presents a convex optimization model for the problem of finding some polynomials for which certain linear combinations are non-negative polynomials. This model is then applied to solve several filter design problems. We first reformulate some low-pass filter design problems, with finite or infinite impulse response, as optimization problems over non-negative (real or complex) polynomials whose feasibility problems can be solved by applying our model. The whole optimization problems are then solved by using a combination of a bisection search procedure on an appropriate parameter and our convex optimization model to solve the feasibility problems. Some numerical examples illustrate the method. This paper presents a convex optimization model for the problem of finding some polynomials for which certain linear combinations are non-negative polynomials. This model is then applied to solve several filter design problems. We first reformulate some low-pass filter design problems, with finite or infinite impulse response, as optimization problems over non-negative (real or complex) polynomials whose feasibility problems can be solved by applying our model. The whole optimization problems are then solved by using a combination of a bisection search procedure on an appropriate parameter and our convex optimization model to solve the feasibility problems. Some numerical examples illustrate the method. Non-negative polynomial Elsevier Sum of squares Elsevier Sum of square magnitudes of polynomials Elsevier Filter design problem Elsevier Van Barel, Marc oth Enthalten in North-Holland Hu, Xing ELSEVIER Dielectric relaxation and microwave dielectric properties of low temperature sintering LiMnPO4 ceramics 2015transfer abstract Amsterdam [u.a.] (DE-627)ELV013217658 volume:301 year:2016 day:1 month:08 pages:121-134 extent:14 https://doi.org/10.1016/j.cam.2016.01.018 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA AR 301 2016 1 0801 121-134 14 045F 510 |
| allfields_unstemmed |
10.1016/j.cam.2016.01.018 doi GBV00000000000151A.pica (DE-627)ELV024520772 (ELSEVIER)S0377-0427(16)00029-7 DE-627 ger DE-627 rakwb eng 510 510 DE-600 670 VZ 540 VZ 630 VZ Le, Thanh Hieu verfasserin aut A convex optimization model for finding non-negative polynomials 2016transfer abstract 14 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier This paper presents a convex optimization model for the problem of finding some polynomials for which certain linear combinations are non-negative polynomials. This model is then applied to solve several filter design problems. We first reformulate some low-pass filter design problems, with finite or infinite impulse response, as optimization problems over non-negative (real or complex) polynomials whose feasibility problems can be solved by applying our model. The whole optimization problems are then solved by using a combination of a bisection search procedure on an appropriate parameter and our convex optimization model to solve the feasibility problems. Some numerical examples illustrate the method. This paper presents a convex optimization model for the problem of finding some polynomials for which certain linear combinations are non-negative polynomials. This model is then applied to solve several filter design problems. We first reformulate some low-pass filter design problems, with finite or infinite impulse response, as optimization problems over non-negative (real or complex) polynomials whose feasibility problems can be solved by applying our model. The whole optimization problems are then solved by using a combination of a bisection search procedure on an appropriate parameter and our convex optimization model to solve the feasibility problems. Some numerical examples illustrate the method. Non-negative polynomial Elsevier Sum of squares Elsevier Sum of square magnitudes of polynomials Elsevier Filter design problem Elsevier Van Barel, Marc oth Enthalten in North-Holland Hu, Xing ELSEVIER Dielectric relaxation and microwave dielectric properties of low temperature sintering LiMnPO4 ceramics 2015transfer abstract Amsterdam [u.a.] (DE-627)ELV013217658 volume:301 year:2016 day:1 month:08 pages:121-134 extent:14 https://doi.org/10.1016/j.cam.2016.01.018 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA AR 301 2016 1 0801 121-134 14 045F 510 |
| allfieldsGer |
10.1016/j.cam.2016.01.018 doi GBV00000000000151A.pica (DE-627)ELV024520772 (ELSEVIER)S0377-0427(16)00029-7 DE-627 ger DE-627 rakwb eng 510 510 DE-600 670 VZ 540 VZ 630 VZ Le, Thanh Hieu verfasserin aut A convex optimization model for finding non-negative polynomials 2016transfer abstract 14 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier This paper presents a convex optimization model for the problem of finding some polynomials for which certain linear combinations are non-negative polynomials. This model is then applied to solve several filter design problems. We first reformulate some low-pass filter design problems, with finite or infinite impulse response, as optimization problems over non-negative (real or complex) polynomials whose feasibility problems can be solved by applying our model. The whole optimization problems are then solved by using a combination of a bisection search procedure on an appropriate parameter and our convex optimization model to solve the feasibility problems. Some numerical examples illustrate the method. This paper presents a convex optimization model for the problem of finding some polynomials for which certain linear combinations are non-negative polynomials. This model is then applied to solve several filter design problems. We first reformulate some low-pass filter design problems, with finite or infinite impulse response, as optimization problems over non-negative (real or complex) polynomials whose feasibility problems can be solved by applying our model. The whole optimization problems are then solved by using a combination of a bisection search procedure on an appropriate parameter and our convex optimization model to solve the feasibility problems. Some numerical examples illustrate the method. Non-negative polynomial Elsevier Sum of squares Elsevier Sum of square magnitudes of polynomials Elsevier Filter design problem Elsevier Van Barel, Marc oth Enthalten in North-Holland Hu, Xing ELSEVIER Dielectric relaxation and microwave dielectric properties of low temperature sintering LiMnPO4 ceramics 2015transfer abstract Amsterdam [u.a.] (DE-627)ELV013217658 volume:301 year:2016 day:1 month:08 pages:121-134 extent:14 https://doi.org/10.1016/j.cam.2016.01.018 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA AR 301 2016 1 0801 121-134 14 045F 510 |
| allfieldsSound |
10.1016/j.cam.2016.01.018 doi GBV00000000000151A.pica (DE-627)ELV024520772 (ELSEVIER)S0377-0427(16)00029-7 DE-627 ger DE-627 rakwb eng 510 510 DE-600 670 VZ 540 VZ 630 VZ Le, Thanh Hieu verfasserin aut A convex optimization model for finding non-negative polynomials 2016transfer abstract 14 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier This paper presents a convex optimization model for the problem of finding some polynomials for which certain linear combinations are non-negative polynomials. This model is then applied to solve several filter design problems. We first reformulate some low-pass filter design problems, with finite or infinite impulse response, as optimization problems over non-negative (real or complex) polynomials whose feasibility problems can be solved by applying our model. The whole optimization problems are then solved by using a combination of a bisection search procedure on an appropriate parameter and our convex optimization model to solve the feasibility problems. Some numerical examples illustrate the method. This paper presents a convex optimization model for the problem of finding some polynomials for which certain linear combinations are non-negative polynomials. This model is then applied to solve several filter design problems. We first reformulate some low-pass filter design problems, with finite or infinite impulse response, as optimization problems over non-negative (real or complex) polynomials whose feasibility problems can be solved by applying our model. The whole optimization problems are then solved by using a combination of a bisection search procedure on an appropriate parameter and our convex optimization model to solve the feasibility problems. Some numerical examples illustrate the method. Non-negative polynomial Elsevier Sum of squares Elsevier Sum of square magnitudes of polynomials Elsevier Filter design problem Elsevier Van Barel, Marc oth Enthalten in North-Holland Hu, Xing ELSEVIER Dielectric relaxation and microwave dielectric properties of low temperature sintering LiMnPO4 ceramics 2015transfer abstract Amsterdam [u.a.] (DE-627)ELV013217658 volume:301 year:2016 day:1 month:08 pages:121-134 extent:14 https://doi.org/10.1016/j.cam.2016.01.018 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA AR 301 2016 1 0801 121-134 14 045F 510 |
| language |
English |
| source |
Enthalten in Dielectric relaxation and microwave dielectric properties of low temperature sintering LiMnPO4 ceramics Amsterdam [u.a.] volume:301 year:2016 day:1 month:08 pages:121-134 extent:14 |
| sourceStr |
Enthalten in Dielectric relaxation and microwave dielectric properties of low temperature sintering LiMnPO4 ceramics Amsterdam [u.a.] volume:301 year:2016 day:1 month:08 pages:121-134 extent:14 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Non-negative polynomial Sum of squares Sum of square magnitudes of polynomials Filter design problem |
| dewey-raw |
510 |
| isfreeaccess_bool |
false |
| container_title |
Dielectric relaxation and microwave dielectric properties of low temperature sintering LiMnPO4 ceramics |
| authorswithroles_txt_mv |
Le, Thanh Hieu @@aut@@ Van Barel, Marc @@oth@@ |
| publishDateDaySort_date |
2016-01-01T00:00:00Z |
| hierarchy_top_id |
ELV013217658 |
| dewey-sort |
3510 |
| id |
ELV024520772 |
| 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">ELV024520772</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230625143017.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2016 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.cam.2016.01.018</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBV00000000000151A.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV024520772</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0377-0427(16)00029-7</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=" "><subfield code="a">510</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">670</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">540</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">630</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Le, Thanh Hieu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A convex optimization model for finding non-negative polynomials</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">14</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This paper presents a convex optimization model for the problem of finding some polynomials for which certain linear combinations are non-negative polynomials. This model is then applied to solve several filter design problems. We first reformulate some low-pass filter design problems, with finite or infinite impulse response, as optimization problems over non-negative (real or complex) polynomials whose feasibility problems can be solved by applying our model. The whole optimization problems are then solved by using a combination of a bisection search procedure on an appropriate parameter and our convex optimization model to solve the feasibility problems. Some numerical examples illustrate the method.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This paper presents a convex optimization model for the problem of finding some polynomials for which certain linear combinations are non-negative polynomials. This model is then applied to solve several filter design problems. We first reformulate some low-pass filter design problems, with finite or infinite impulse response, as optimization problems over non-negative (real or complex) polynomials whose feasibility problems can be solved by applying our model. The whole optimization problems are then solved by using a combination of a bisection search procedure on an appropriate parameter and our convex optimization model to solve the feasibility problems. Some numerical examples illustrate the method.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Non-negative polynomial</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Sum of squares</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Sum of square magnitudes of polynomials</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Filter design problem</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Van Barel, Marc</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">North-Holland</subfield><subfield code="a">Hu, Xing ELSEVIER</subfield><subfield code="t">Dielectric relaxation and microwave dielectric properties of low temperature sintering LiMnPO4 ceramics</subfield><subfield code="d">2015transfer abstract</subfield><subfield code="g">Amsterdam [u.a.]</subfield><subfield code="w">(DE-627)ELV013217658</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:301</subfield><subfield code="g">year:2016</subfield><subfield code="g">day:1</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:121-134</subfield><subfield code="g">extent:14</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.cam.2016.01.018</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">301</subfield><subfield code="j">2016</subfield><subfield code="b">1</subfield><subfield code="c">0801</subfield><subfield code="h">121-134</subfield><subfield code="g">14</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">510</subfield></datafield></record></collection>
|
| author |
Le, Thanh Hieu |
| spellingShingle |
Le, Thanh Hieu ddc 510 ddc 670 ddc 540 ddc 630 Elsevier Non-negative polynomial Elsevier Sum of squares Elsevier Sum of square magnitudes of polynomials Elsevier Filter design problem A convex optimization model for finding non-negative polynomials |
| authorStr |
Le, Thanh Hieu |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)ELV013217658 |
| format |
electronic Article |
| dewey-ones |
510 - Mathematics 670 - Manufacturing 540 - Chemistry & allied sciences 630 - Agriculture & related technologies |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
elsevier |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
510 510 DE-600 670 VZ 540 VZ 630 VZ A convex optimization model for finding non-negative polynomials Non-negative polynomial Elsevier Sum of squares Elsevier Sum of square magnitudes of polynomials Elsevier Filter design problem Elsevier |
| topic |
ddc 510 ddc 670 ddc 540 ddc 630 Elsevier Non-negative polynomial Elsevier Sum of squares Elsevier Sum of square magnitudes of polynomials Elsevier Filter design problem |
| topic_unstemmed |
ddc 510 ddc 670 ddc 540 ddc 630 Elsevier Non-negative polynomial Elsevier Sum of squares Elsevier Sum of square magnitudes of polynomials Elsevier Filter design problem |
| topic_browse |
ddc 510 ddc 670 ddc 540 ddc 630 Elsevier Non-negative polynomial Elsevier Sum of squares Elsevier Sum of square magnitudes of polynomials Elsevier Filter design problem |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
b m v bm bmv |
| hierarchy_parent_title |
Dielectric relaxation and microwave dielectric properties of low temperature sintering LiMnPO4 ceramics |
| hierarchy_parent_id |
ELV013217658 |
| dewey-tens |
510 - Mathematics 670 - Manufacturing 540 - Chemistry 630 - Agriculture |
| hierarchy_top_title |
Dielectric relaxation and microwave dielectric properties of low temperature sintering LiMnPO4 ceramics |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)ELV013217658 |
| title |
A convex optimization model for finding non-negative polynomials |
| ctrlnum |
(DE-627)ELV024520772 (ELSEVIER)S0377-0427(16)00029-7 |
| title_full |
A convex optimization model for finding non-negative polynomials |
| author_sort |
Le, Thanh Hieu |
| journal |
Dielectric relaxation and microwave dielectric properties of low temperature sintering LiMnPO4 ceramics |
| journalStr |
Dielectric relaxation and microwave dielectric properties of low temperature sintering LiMnPO4 ceramics |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
500 - Science 600 - Technology |
| recordtype |
marc |
| publishDateSort |
2016 |
| contenttype_str_mv |
zzz |
| container_start_page |
121 |
| author_browse |
Le, Thanh Hieu |
| container_volume |
301 |
| physical |
14 |
| class |
510 510 DE-600 670 VZ 540 VZ 630 VZ |
| format_se |
Elektronische Aufsätze |
| author-letter |
Le, Thanh Hieu |
| doi_str_mv |
10.1016/j.cam.2016.01.018 |
| dewey-full |
510 670 540 630 |
| title_sort |
a convex optimization model for finding non-negative polynomials |
| title_auth |
A convex optimization model for finding non-negative polynomials |
| abstract |
This paper presents a convex optimization model for the problem of finding some polynomials for which certain linear combinations are non-negative polynomials. This model is then applied to solve several filter design problems. We first reformulate some low-pass filter design problems, with finite or infinite impulse response, as optimization problems over non-negative (real or complex) polynomials whose feasibility problems can be solved by applying our model. The whole optimization problems are then solved by using a combination of a bisection search procedure on an appropriate parameter and our convex optimization model to solve the feasibility problems. Some numerical examples illustrate the method. |
| abstractGer |
This paper presents a convex optimization model for the problem of finding some polynomials for which certain linear combinations are non-negative polynomials. This model is then applied to solve several filter design problems. We first reformulate some low-pass filter design problems, with finite or infinite impulse response, as optimization problems over non-negative (real or complex) polynomials whose feasibility problems can be solved by applying our model. The whole optimization problems are then solved by using a combination of a bisection search procedure on an appropriate parameter and our convex optimization model to solve the feasibility problems. Some numerical examples illustrate the method. |
| abstract_unstemmed |
This paper presents a convex optimization model for the problem of finding some polynomials for which certain linear combinations are non-negative polynomials. This model is then applied to solve several filter design problems. We first reformulate some low-pass filter design problems, with finite or infinite impulse response, as optimization problems over non-negative (real or complex) polynomials whose feasibility problems can be solved by applying our model. The whole optimization problems are then solved by using a combination of a bisection search procedure on an appropriate parameter and our convex optimization model to solve the feasibility problems. Some numerical examples illustrate the method. |
| collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA |
| title_short |
A convex optimization model for finding non-negative polynomials |
| url |
https://doi.org/10.1016/j.cam.2016.01.018 |
| remote_bool |
true |
| author2 |
Van Barel, Marc |
| author2Str |
Van Barel, Marc |
| ppnlink |
ELV013217658 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth |
| doi_str |
10.1016/j.cam.2016.01.018 |
| up_date |
2024-07-06T21:39:19.044Z |
| _version_ |
1803867347008618496 |
| 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">ELV024520772</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230625143017.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2016 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.cam.2016.01.018</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBV00000000000151A.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV024520772</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0377-0427(16)00029-7</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=" "><subfield code="a">510</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">670</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">540</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">630</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Le, Thanh Hieu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A convex optimization model for finding non-negative polynomials</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">14</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This paper presents a convex optimization model for the problem of finding some polynomials for which certain linear combinations are non-negative polynomials. This model is then applied to solve several filter design problems. We first reformulate some low-pass filter design problems, with finite or infinite impulse response, as optimization problems over non-negative (real or complex) polynomials whose feasibility problems can be solved by applying our model. The whole optimization problems are then solved by using a combination of a bisection search procedure on an appropriate parameter and our convex optimization model to solve the feasibility problems. Some numerical examples illustrate the method.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This paper presents a convex optimization model for the problem of finding some polynomials for which certain linear combinations are non-negative polynomials. This model is then applied to solve several filter design problems. We first reformulate some low-pass filter design problems, with finite or infinite impulse response, as optimization problems over non-negative (real or complex) polynomials whose feasibility problems can be solved by applying our model. The whole optimization problems are then solved by using a combination of a bisection search procedure on an appropriate parameter and our convex optimization model to solve the feasibility problems. Some numerical examples illustrate the method.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Non-negative polynomial</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Sum of squares</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Sum of square magnitudes of polynomials</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Filter design problem</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Van Barel, Marc</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">North-Holland</subfield><subfield code="a">Hu, Xing ELSEVIER</subfield><subfield code="t">Dielectric relaxation and microwave dielectric properties of low temperature sintering LiMnPO4 ceramics</subfield><subfield code="d">2015transfer abstract</subfield><subfield code="g">Amsterdam [u.a.]</subfield><subfield code="w">(DE-627)ELV013217658</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:301</subfield><subfield code="g">year:2016</subfield><subfield code="g">day:1</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:121-134</subfield><subfield code="g">extent:14</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.cam.2016.01.018</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">301</subfield><subfield code="j">2016</subfield><subfield code="b">1</subfield><subfield code="c">0801</subfield><subfield code="h">121-134</subfield><subfield code="g">14</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">510</subfield></datafield></record></collection>
|
| score |
7.398514 |