Algorithms for Sparsity-Constrained Optimization:
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
2014
|
| Series: | Springer Theses : Recognizing Outstanding Ph.D. Research
261 |
| Subjects: | |
| Online Access: | BTU01 FHA01 FHI01 FHN01 FHR01 FKE01 FRO01 FWS01 FWS02 UBY01 Volltext Inhaltsverzeichnis Abstract |
| Item Description: | This thesis demonstrates techniques that provide faster and more accurate solutions to a variety of problems in machine learning and signal processing. The author proposes a"greedy" algorithm, deriving sparse solutions with guarantees of optimality. The use of this algorithm removes many of the inaccuracies that occurred with the use of previous models |
| Physical Description: | 1 Online-Ressource (XXI, 107 p.) 13 illus., 12 illus. in color |
| ISBN: | 9783319018812 |
| DOI: | 10.1007/978-3-319-01881-2 |
Staff View
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV041470976 | ||
| 003 | DE-604 | ||
| 005 | 20140127 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 131210s2014 |||| o||u| ||||||eng d | ||
| 020 | |a 9783319018812 |9 978-3-319-01881-2 | ||
| 024 | 7 | |a 10.1007/978-3-319-01881-2 |2 doi | |
| 035 | |a (OCoLC)874381496 | ||
| 035 | |a (DE-599)BVBBV041470976 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-Aug4 |a DE-92 |a DE-634 |a DE-859 |a DE-898 |a DE-573 |a DE-861 |a DE-706 |a DE-863 |a DE-862 | ||
| 082 | 0 | |a 621.382 |2 23 | |
| 100 | 1 | |a Bahmani, Sohail |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Algorithms for Sparsity-Constrained Optimization |c by Sohail Bahmani |
| 264 | 1 | |c 2014 | |
| 300 | |a 1 Online-Ressource (XXI, 107 p.) |b 13 illus., 12 illus. in color | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Springer Theses : Recognizing Outstanding Ph.D. Research |v 261 | |
| 500 | |a This thesis demonstrates techniques that provide faster and more accurate solutions to a variety of problems in machine learning and signal processing. The author proposes a"greedy" algorithm, deriving sparse solutions with guarantees of optimality. The use of this algorithm removes many of the inaccuracies that occurred with the use of previous models | ||
| 505 | 0 | |a Introduction -- Preliminaries -- Sparsity-Constrained Optimization -- Background -- 1-bit Compressed Sensing -- Estimation Under Model-Based Sparsity -- Projected Gradient Descent for 'p-constrained Least Squares -- Conclusion and Future Work | |
| 650 | 4 | |a Engineering | |
| 650 | 4 | |a Computer vision | |
| 650 | 4 | |a Signal, Image and Speech Processing | |
| 650 | 4 | |a Mathematical Applications in Computer Science | |
| 650 | 4 | |a Image Processing and Computer Vision | |
| 650 | 4 | |a Ingenieurwissenschaften | |
| 810 | 2 | |a Springer Theses |t Recognizing Outstanding Ph.D. Research |v 261 |w (DE-604)BV040689160 |9 261 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-319-01881-2 |x Verlag |3 Volltext |
| 856 | 4 | 2 | |m Springer Fremddatenuebernahme |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=026917119&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 856 | 4 | 2 | |m Springer Fremddatenuebernahme |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=026917119&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA |3 Abstract |
| 912 | |a ZDB-2-ENG | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-026917119 | ||
| 966 | e | |u https://doi.org/10.1007/978-3-319-01881-2 |l BTU01 |p ZDB-2-ENG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-01881-2 |l FHA01 |p ZDB-2-ENG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-01881-2 |l FHI01 |p ZDB-2-ENG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-01881-2 |l FHN01 |p ZDB-2-ENG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-01881-2 |l FHR01 |p ZDB-2-ENG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-01881-2 |l FKE01 |p ZDB-2-ENG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-01881-2 |l FRO01 |p ZDB-2-ENG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-01881-2 |l FWS01 |p ZDB-2-ENG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-01881-2 |l FWS02 |p ZDB-2-ENG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-01881-2 |l UBY01 |p ZDB-2-ENG |x Verlag |3 Volltext | |
Record in the Search Index
| DE-BY-FWS_katkey | 1015324 |
|---|---|
| _version_ | 1824553635935158272 |
| adam_text | ALGORITHMS FOR SPARSITY-CONSTRAINED OPTIMIZATION
/ BAHMANI, SOHAIL
: 2014
TABLE OF CONTENTS / INHALTSVERZEICHNIS
INTRODUCTION
PRELIMINARIES
SPARSITY-CONSTRAINED OPTIMIZATION
BACKGROUND
1-BIT COMPRESSED SENSING
ESTIMATION UNDER MODEL-BASED SPARSITY
PROJECTED GRADIENT DESCENT FOR `P-CONSTRAINED LEAST SQUARES
CONCLUSION AND FUTURE WORK
DIESES SCHRIFTSTUECK WURDE MASCHINELL ERZEUGT.
ALGORITHMS FOR SPARSITY-CONSTRAINED OPTIMIZATION
/ BAHMANI, SOHAIL
: 2014
ABSTRACT / INHALTSTEXT
THIS THESIS DEMONSTRATES TECHNIQUES THAT PROVIDE FASTER AND MORE
ACCURATE SOLUTIONS TO A VARIETY OF PROBLEMS IN MACHINE LEARNING AND
SIGNAL PROCESSING. THE AUTHOR PROPOSES A GREEDY ALGORITHM, DERIVING
SPARSE SOLUTIONS WITH GUARANTEES OF OPTIMALITY. THE USE OF THIS
ALGORITHM REMOVES MANY OF THE INACCURACIES THAT OCCURRED WITH THE USE OF
PREVIOUS MODELS
DIESES SCHRIFTSTUECK WURDE MASCHINELL ERZEUGT.
|
| any_adam_object | 1 |
| author | Bahmani, Sohail |
| author_facet | Bahmani, Sohail |
| author_role | aut |
| author_sort | Bahmani, Sohail |
| author_variant | s b sb |
| building | Verbundindex |
| bvnumber | BV041470976 |
| collection | ZDB-2-ENG |
| contents | Introduction -- Preliminaries -- Sparsity-Constrained Optimization -- Background -- 1-bit Compressed Sensing -- Estimation Under Model-Based Sparsity -- Projected Gradient Descent for 'p-constrained Least Squares -- Conclusion and Future Work |
| ctrlnum | (OCoLC)874381496 (DE-599)BVBBV041470976 |
| dewey-full | 621.382 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 621 - Applied physics |
| dewey-raw | 621.382 |
| dewey-search | 621.382 |
| dewey-sort | 3621.382 |
| dewey-tens | 620 - Engineering and allied operations |
| discipline | Elektrotechnik / Elektronik / Nachrichtentechnik |
| doi_str_mv | 10.1007/978-3-319-01881-2 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03523nmm a2200565zcb4500</leader><controlfield tag="001">BV041470976</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20140127 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">131210s2014 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783319018812</subfield><subfield code="9">978-3-319-01881-2</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-319-01881-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)874381496</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV041470976</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-Aug4</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-861</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-863</subfield><subfield code="a">DE-862</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">621.382</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bahmani, Sohail</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms for Sparsity-Constrained Optimization</subfield><subfield code="c">by Sohail Bahmani</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XXI, 107 p.)</subfield><subfield code="b">13 illus., 12 illus. in color</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="1" ind2=" "><subfield code="a">Springer Theses : Recognizing Outstanding Ph.D. Research</subfield><subfield code="v">261</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">This thesis demonstrates techniques that provide faster and more accurate solutions to a variety of problems in machine learning and signal processing. The author proposes a"greedy" algorithm, deriving sparse solutions with guarantees of optimality. The use of this algorithm removes many of the inaccuracies that occurred with the use of previous models</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Introduction -- Preliminaries -- Sparsity-Constrained Optimization -- Background -- 1-bit Compressed Sensing -- Estimation Under Model-Based Sparsity -- Projected Gradient Descent for 'p-constrained Least Squares -- Conclusion and Future Work</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer vision</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Signal, Image and Speech Processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical Applications in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Image Processing and Computer Vision</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ingenieurwissenschaften</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Springer Theses </subfield><subfield code="t">Recognizing Outstanding Ph.D. Research</subfield><subfield code="v">261</subfield><subfield code="w">(DE-604)BV040689160</subfield><subfield code="9">261</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-319-01881-2</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Springer Fremddatenuebernahme</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=026917119&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Springer Fremddatenuebernahme</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=026917119&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Abstract</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-ENG</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-026917119</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-01881-2</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-ENG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-01881-2</subfield><subfield code="l">FHA01</subfield><subfield code="p">ZDB-2-ENG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-01881-2</subfield><subfield code="l">FHI01</subfield><subfield code="p">ZDB-2-ENG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-01881-2</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-2-ENG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-01881-2</subfield><subfield code="l">FHR01</subfield><subfield code="p">ZDB-2-ENG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-01881-2</subfield><subfield code="l">FKE01</subfield><subfield code="p">ZDB-2-ENG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-01881-2</subfield><subfield code="l">FRO01</subfield><subfield code="p">ZDB-2-ENG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-01881-2</subfield><subfield code="l">FWS01</subfield><subfield code="p">ZDB-2-ENG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-01881-2</subfield><subfield code="l">FWS02</subfield><subfield code="p">ZDB-2-ENG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-01881-2</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-ENG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV041470976 |
| illustrated | Illustrated |
| indexdate | 2025-02-20T06:39:01Z |
| institution | BVB |
| isbn | 9783319018812 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-026917119 |
| oclc_num | 874381496 |
| open_access_boolean | |
| owner | DE-Aug4 DE-92 DE-634 DE-859 DE-898 DE-BY-UBR DE-573 DE-861 DE-706 DE-863 DE-BY-FWS DE-862 DE-BY-FWS |
| owner_facet | DE-Aug4 DE-92 DE-634 DE-859 DE-898 DE-BY-UBR DE-573 DE-861 DE-706 DE-863 DE-BY-FWS DE-862 DE-BY-FWS |
| physical | 1 Online-Ressource (XXI, 107 p.) 13 illus., 12 illus. in color |
| psigel | ZDB-2-ENG |
| publishDate | 2014 |
| publishDateSearch | 2014 |
| publishDateSort | 2014 |
| record_format | marc |
| series2 | Springer Theses : Recognizing Outstanding Ph.D. Research |
| spellingShingle | Bahmani, Sohail Algorithms for Sparsity-Constrained Optimization Introduction -- Preliminaries -- Sparsity-Constrained Optimization -- Background -- 1-bit Compressed Sensing -- Estimation Under Model-Based Sparsity -- Projected Gradient Descent for 'p-constrained Least Squares -- Conclusion and Future Work Engineering Computer vision Signal, Image and Speech Processing Mathematical Applications in Computer Science Image Processing and Computer Vision Ingenieurwissenschaften |
| title | Algorithms for Sparsity-Constrained Optimization |
| title_auth | Algorithms for Sparsity-Constrained Optimization |
| title_exact_search | Algorithms for Sparsity-Constrained Optimization |
| title_full | Algorithms for Sparsity-Constrained Optimization by Sohail Bahmani |
| title_fullStr | Algorithms for Sparsity-Constrained Optimization by Sohail Bahmani |
| title_full_unstemmed | Algorithms for Sparsity-Constrained Optimization by Sohail Bahmani |
| title_short | Algorithms for Sparsity-Constrained Optimization |
| title_sort | algorithms for sparsity constrained optimization |
| topic | Engineering Computer vision Signal, Image and Speech Processing Mathematical Applications in Computer Science Image Processing and Computer Vision Ingenieurwissenschaften |
| topic_facet | Engineering Computer vision Signal, Image and Speech Processing Mathematical Applications in Computer Science Image Processing and Computer Vision Ingenieurwissenschaften |
| url | https://doi.org/10.1007/978-3-319-01881-2 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=026917119&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=026917119&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV040689160 |
| work_keys_str_mv | AT bahmanisohail algorithmsforsparsityconstrainedoptimization |