Proximal algorithms:
Gespeichert in:
Beteiligte Personen: | , |
---|---|
Format: | Buch |
Sprache: | Englisch |
Veröffentlicht: |
Boston ; Delft
Now
2014
|
Schriftenreihe: | Foundations and trends in optimization
Vol. 1, no. 3 (2014) |
Abstract: | Proximal Algorithms discusses different interpretations of proximal operators and algorithms, looks at their connections to many other topics in optimization and applied mathematics, surveys some popular algorithms, and provides a large number of examples of proximal operators that commonly arise in practice |
Umfang: | 118 pages |
ISBN: | 9781601987167 |
Internformat
MARC
LEADER | 00000nam a22000001cb4500 | ||
---|---|---|---|
001 | BV047873334 | ||
003 | DE-604 | ||
005 | 20220419 | ||
007 | t| | ||
008 | 220308s2014 xx |||| 00||| eng d | ||
020 | |a 9781601987167 |9 978-1-60198-716-7 | ||
035 | |a (OCoLC)1312697454 | ||
035 | |a (DE-599)BVBBV047873334 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-91 | ||
084 | |a DAT 530 |2 stub | ||
100 | 1 | |a Parikh, Neal |e Verfasser |4 aut | |
245 | 1 | 0 | |a Proximal algorithms |c Neal Parikh (Department of Computer Science, Stanford University), Stephen Boyd (Department of Electrical Engineering, Stanford University) |
264 | 1 | |a Boston ; Delft |b Now |c 2014 | |
300 | |a 118 pages | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Foundations and trends in optimization |v Vol. 1, no. 3 (2014) | |
520 | 3 | |a Proximal Algorithms discusses different interpretations of proximal operators and algorithms, looks at their connections to many other topics in optimization and applied mathematics, surveys some popular algorithms, and provides a large number of examples of proximal operators that commonly arise in practice | |
700 | 1 | |a Boyd, Stephen P. |d 1958- |e Verfasser |0 (DE-588)129723177 |4 aut | |
776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-1-60198-717-4 |
830 | 0 | |a Foundations and trends in optimization |v Vol. 1, no. 3 (2014) |w (DE-604)BV047944410 |9 1,3 | |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-033255805 |
Datensatz im Suchindex
DE-BY-TUM_call_number | 0002 DAT 530 2022 A 1803 |
---|---|
DE-BY-TUM_katkey | 2614727 |
DE-BY-TUM_location | 00 |
DE-BY-TUM_media_number | 040009533191 |
_version_ | 1821936260368826368 |
any_adam_object | |
author | Parikh, Neal Boyd, Stephen P. 1958- |
author_GND | (DE-588)129723177 |
author_facet | Parikh, Neal Boyd, Stephen P. 1958- |
author_role | aut aut |
author_sort | Parikh, Neal |
author_variant | n p np s p b sp spb |
building | Verbundindex |
bvnumber | BV047873334 |
classification_tum | DAT 530 |
ctrlnum | (OCoLC)1312697454 (DE-599)BVBBV047873334 |
discipline | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01478nam a22003251cb4500</leader><controlfield tag="001">BV047873334</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220419 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">220308s2014 xx |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781601987167</subfield><subfield code="9">978-1-60198-716-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1312697454</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047873334</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Parikh, Neal</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proximal algorithms</subfield><subfield code="c">Neal Parikh (Department of Computer Science, Stanford University), Stephen Boyd (Department of Electrical Engineering, Stanford University)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston ; Delft</subfield><subfield code="b">Now</subfield><subfield code="c">2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">118 pages</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Foundations and trends in optimization</subfield><subfield code="v">Vol. 1, no. 3 (2014)</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Proximal Algorithms discusses different interpretations of proximal operators and algorithms, looks at their connections to many other topics in optimization and applied mathematics, surveys some popular algorithms, and provides a large number of examples of proximal operators that commonly arise in practice</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Boyd, Stephen P.</subfield><subfield code="d">1958-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)129723177</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-1-60198-717-4</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Foundations and trends in optimization</subfield><subfield code="v">Vol. 1, no. 3 (2014)</subfield><subfield code="w">(DE-604)BV047944410</subfield><subfield code="9">1,3</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-033255805</subfield></datafield></record></collection> |
id | DE-604.BV047873334 |
illustrated | Not Illustrated |
indexdate | 2024-12-20T19:30:56Z |
institution | BVB |
isbn | 9781601987167 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-033255805 |
oclc_num | 1312697454 |
open_access_boolean | |
owner | DE-91 DE-BY-TUM |
owner_facet | DE-91 DE-BY-TUM |
physical | 118 pages |
publishDate | 2014 |
publishDateSearch | 2014 |
publishDateSort | 2014 |
publisher | Now |
record_format | marc |
series | Foundations and trends in optimization |
series2 | Foundations and trends in optimization |
spellingShingle | Parikh, Neal Boyd, Stephen P. 1958- Proximal algorithms Foundations and trends in optimization |
title | Proximal algorithms |
title_auth | Proximal algorithms |
title_exact_search | Proximal algorithms |
title_full | Proximal algorithms Neal Parikh (Department of Computer Science, Stanford University), Stephen Boyd (Department of Electrical Engineering, Stanford University) |
title_fullStr | Proximal algorithms Neal Parikh (Department of Computer Science, Stanford University), Stephen Boyd (Department of Electrical Engineering, Stanford University) |
title_full_unstemmed | Proximal algorithms Neal Parikh (Department of Computer Science, Stanford University), Stephen Boyd (Department of Electrical Engineering, Stanford University) |
title_short | Proximal algorithms |
title_sort | proximal algorithms |
volume_link | (DE-604)BV047944410 |
work_keys_str_mv | AT parikhneal proximalalgorithms AT boydstephenp proximalalgorithms |
Paper/Kapitel scannen lassen
Teilbibliothek Stammgelände
Signatur: |
0002 DAT 530 2022 A 1803 Lageplan |
---|---|
Exemplar 1 | Ausleihbar Am Standort |