Separable Programming: Theory and Methods
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Boston, MA
Springer US
2001
|
| Schriftenreihe: | Applied Optimization
53 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | In this book, the author considers separable programming and, in particular, one of its important cases - convex separable programming. Some general results are presented, techniques of approximating the separable problem by linear programming and dynamic programming are considered. Convex separable programs subject to inequality/ equality constraint(s) and bounds on variables are also studied and iterative algorithms of polynomial complexity are proposed. As an application, these algorithms are used in the implementation of stochastic quasigradient methods to some separable stochastic programs. Numerical approximation with respect to I1 and I4 norms, as a convex separable nonsmooth unconstrained minimization problem, is considered as well. Audience: Advanced undergraduate and graduate students, mathematical programming/ operations research specialists |
| Beschreibung: | 1 Online-Ressource (XIX, 314 p) |
| ISBN: | 9781475734171 9781441948519 |
| ISSN: | 1384-6485 |
| DOI: | 10.1007/978-1-4757-3417-1 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042421465 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s2001 |||| o||u| ||||||eng d | ||
| 020 | |a 9781475734171 |c Online |9 978-1-4757-3417-1 | ||
| 020 | |a 9781441948519 |c Print |9 978-1-4419-4851-9 | ||
| 024 | 7 | |a 10.1007/978-1-4757-3417-1 |2 doi | |
| 035 | |a (OCoLC)879623285 | ||
| 035 | |a (DE-599)BVBBV042421465 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 519.6 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Stefanov, Stefan M. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Separable Programming |b Theory and Methods |c by Stefan M. Stefanov |
| 264 | 1 | |a Boston, MA |b Springer US |c 2001 | |
| 300 | |a 1 Online-Ressource (XIX, 314 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Applied Optimization |v 53 |x 1384-6485 | |
| 500 | |a In this book, the author considers separable programming and, in particular, one of its important cases - convex separable programming. Some general results are presented, techniques of approximating the separable problem by linear programming and dynamic programming are considered. Convex separable programs subject to inequality/ equality constraint(s) and bounds on variables are also studied and iterative algorithms of polynomial complexity are proposed. As an application, these algorithms are used in the implementation of stochastic quasigradient methods to some separable stochastic programs. Numerical approximation with respect to I1 and I4 norms, as a convex separable nonsmooth unconstrained minimization problem, is considered as well. Audience: Advanced undergraduate and graduate students, mathematical programming/ operations research specialists | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Mathematical optimization | |
| 650 | 4 | |a Optimization | |
| 650 | 4 | |a Mathematik | |
| 650 | 0 | 7 | |a Separable Optimierung |0 (DE-588)4735512-8 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Separable Optimierung |0 (DE-588)4735512-8 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4757-3417-1 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027856882 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804153094737494016 |
|---|---|
| any_adam_object | |
| author | Stefanov, Stefan M. |
| author_facet | Stefanov, Stefan M. |
| author_role | aut |
| author_sort | Stefanov, Stefan M. |
| author_variant | s m s sm sms |
| building | Verbundindex |
| bvnumber | BV042421465 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)879623285 (DE-599)BVBBV042421465 |
| dewey-full | 519.6 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.6 |
| dewey-search | 519.6 |
| dewey-sort | 3519.6 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1007/978-1-4757-3417-1 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02389nmm a2200457zcb4500</leader><controlfield tag="001">BV042421465</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s2001 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781475734171</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-4757-3417-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781441948519</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-4419-4851-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4757-3417-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)879623285</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042421465</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.6</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Stefanov, Stefan M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Separable Programming</subfield><subfield code="b">Theory and Methods</subfield><subfield code="c">by Stefan M. Stefanov</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Springer US</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XIX, 314 p)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Applied Optimization</subfield><subfield code="v">53</subfield><subfield code="x">1384-6485</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">In this book, the author considers separable programming and, in particular, one of its important cases - convex separable programming. Some general results are presented, techniques of approximating the separable problem by linear programming and dynamic programming are considered. Convex separable programs subject to inequality/ equality constraint(s) and bounds on variables are also studied and iterative algorithms of polynomial complexity are proposed. As an application, these algorithms are used in the implementation of stochastic quasigradient methods to some separable stochastic programs. Numerical approximation with respect to I1 and I4 norms, as a convex separable nonsmooth unconstrained minimization problem, is considered as well. Audience: Advanced undergraduate and graduate students, mathematical programming/ operations research specialists</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Separable Optimierung</subfield><subfield code="0">(DE-588)4735512-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Separable Optimierung</subfield><subfield code="0">(DE-588)4735512-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4757-3417-1</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027856882</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV042421465 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:09Z |
| institution | BVB |
| isbn | 9781475734171 9781441948519 |
| issn | 1384-6485 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027856882 |
| oclc_num | 879623285 |
| open_access_boolean | |
| owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| physical | 1 Online-Ressource (XIX, 314 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 2001 |
| publishDateSearch | 2001 |
| publishDateSort | 2001 |
| publisher | Springer US |
| record_format | marc |
| series2 | Applied Optimization |
| spelling | Stefanov, Stefan M. Verfasser aut Separable Programming Theory and Methods by Stefan M. Stefanov Boston, MA Springer US 2001 1 Online-Ressource (XIX, 314 p) txt rdacontent c rdamedia cr rdacarrier Applied Optimization 53 1384-6485 In this book, the author considers separable programming and, in particular, one of its important cases - convex separable programming. Some general results are presented, techniques of approximating the separable problem by linear programming and dynamic programming are considered. Convex separable programs subject to inequality/ equality constraint(s) and bounds on variables are also studied and iterative algorithms of polynomial complexity are proposed. As an application, these algorithms are used in the implementation of stochastic quasigradient methods to some separable stochastic programs. Numerical approximation with respect to I1 and I4 norms, as a convex separable nonsmooth unconstrained minimization problem, is considered as well. Audience: Advanced undergraduate and graduate students, mathematical programming/ operations research specialists Mathematics Mathematical optimization Optimization Mathematik Separable Optimierung (DE-588)4735512-8 gnd rswk-swf Separable Optimierung (DE-588)4735512-8 s 1\p DE-604 https://doi.org/10.1007/978-1-4757-3417-1 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Stefanov, Stefan M. Separable Programming Theory and Methods Mathematics Mathematical optimization Optimization Mathematik Separable Optimierung (DE-588)4735512-8 gnd |
| subject_GND | (DE-588)4735512-8 |
| title | Separable Programming Theory and Methods |
| title_auth | Separable Programming Theory and Methods |
| title_exact_search | Separable Programming Theory and Methods |
| title_full | Separable Programming Theory and Methods by Stefan M. Stefanov |
| title_fullStr | Separable Programming Theory and Methods by Stefan M. Stefanov |
| title_full_unstemmed | Separable Programming Theory and Methods by Stefan M. Stefanov |
| title_short | Separable Programming |
| title_sort | separable programming theory and methods |
| title_sub | Theory and Methods |
| topic | Mathematics Mathematical optimization Optimization Mathematik Separable Optimierung (DE-588)4735512-8 gnd |
| topic_facet | Mathematics Mathematical optimization Optimization Mathematik Separable Optimierung |
| url | https://doi.org/10.1007/978-1-4757-3417-1 |
| work_keys_str_mv | AT stefanovstefanm separableprogrammingtheoryandmethods |