Pattern separation by convex programming:
It is shown that the pattern separation problem can be formulated and solved as a convex pro gramming problem, i.e., the minimization of a convex function subject to linear constraints. A number of previous investigators have proposed iterative methods for the construction of one or more hyperplanes...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Stanford, California
1963
|
| Series: | Applied Mathematics and Statistics Laboratory <Stanford, Calif.>: Technical report
30 |
| Subjects: | |
| Summary: | It is shown that the pattern separation problem can be formulated and solved as a convex pro gramming problem, i.e., the minimization of a convex function subject to linear constraints. A number of previous investigators have proposed iterative methods for the construction of one or more hyperplanes in order s solve pattern recognition problems. It was apparently not recognized that these iterative methods were, in fact, ining a feasible solution to a mathematical programming problem. Very effi cient computer methods have been developed for such programming problems and can be used to advantage for the pattern recognition problem. (Author). |
| Physical Description: | 20 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009931156 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 941202s1963 |||| 00||| engod | ||
| 035 | |a (OCoLC)227317745 | ||
| 035 | |a (DE-599)BVBBV009931156 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Rosen, J. B. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Pattern separation by convex programming |
| 264 | 1 | |a Stanford, California |c 1963 | |
| 300 | |a 20 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Applied Mathematics and Statistics Laboratory <Stanford, Calif.>: Technical report |v 30 | |
| 520 | 3 | |a It is shown that the pattern separation problem can be formulated and solved as a convex pro gramming problem, i.e., the minimization of a convex function subject to linear constraints. A number of previous investigators have proposed iterative methods for the construction of one or more hyperplanes in order s solve pattern recognition problems. It was apparently not recognized that these iterative methods were, in fact, ining a feasible solution to a mathematical programming problem. Very effi cient computer methods have been developed for such programming problems and can be used to advantage for the pattern recognition problem. (Author). | |
| 650 | 7 | |a Convex sets |2 dtict | |
| 650 | 7 | |a Geometry |2 dtict | |
| 650 | 7 | |a Sequences(mathematics) |2 dtict | |
| 830 | 0 | |a Applied Mathematics and Statistics Laboratory <Stanford, Calif.>: Technical report |v 30 |w (DE-604)BV006665053 |9 30 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006578955 | ||
Record in the Search Index
| _version_ | 1804124297160032256 |
|---|---|
| any_adam_object | |
| author | Rosen, J. B. |
| author_facet | Rosen, J. B. |
| author_role | aut |
| author_sort | Rosen, J. B. |
| author_variant | j b r jb jbr |
| building | Verbundindex |
| bvnumber | BV009931156 |
| ctrlnum | (OCoLC)227317745 (DE-599)BVBBV009931156 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01636nam a2200313 cb4500</leader><controlfield tag="001">BV009931156</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">941202s1963 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227317745</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009931156</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rosen, J. B.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Pattern separation by convex programming</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, California</subfield><subfield code="c">1963</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">20 S.</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">Applied Mathematics and Statistics Laboratory <Stanford, Calif.>: Technical report</subfield><subfield code="v">30</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">It is shown that the pattern separation problem can be formulated and solved as a convex pro gramming problem, i.e., the minimization of a convex function subject to linear constraints. A number of previous investigators have proposed iterative methods for the construction of one or more hyperplanes in order s solve pattern recognition problems. It was apparently not recognized that these iterative methods were, in fact, ining a feasible solution to a mathematical programming problem. Very effi cient computer methods have been developed for such programming problems and can be used to advantage for the pattern recognition problem. (Author).</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Convex sets</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Geometry</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Sequences(mathematics)</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Applied Mathematics and Statistics Laboratory <Stanford, Calif.>: Technical report</subfield><subfield code="v">30</subfield><subfield code="w">(DE-604)BV006665053</subfield><subfield code="9">30</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006578955</subfield></datafield></record></collection> |
| id | DE-604.BV009931156 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:43:25Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006578955 |
| oclc_num | 227317745 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 20 S. |
| publishDate | 1963 |
| publishDateSearch | 1963 |
| publishDateSort | 1963 |
| record_format | marc |
| series | Applied Mathematics and Statistics Laboratory <Stanford, Calif.>: Technical report |
| series2 | Applied Mathematics and Statistics Laboratory <Stanford, Calif.>: Technical report |
| spelling | Rosen, J. B. Verfasser aut Pattern separation by convex programming Stanford, California 1963 20 S. txt rdacontent n rdamedia nc rdacarrier Applied Mathematics and Statistics Laboratory <Stanford, Calif.>: Technical report 30 It is shown that the pattern separation problem can be formulated and solved as a convex pro gramming problem, i.e., the minimization of a convex function subject to linear constraints. A number of previous investigators have proposed iterative methods for the construction of one or more hyperplanes in order s solve pattern recognition problems. It was apparently not recognized that these iterative methods were, in fact, ining a feasible solution to a mathematical programming problem. Very effi cient computer methods have been developed for such programming problems and can be used to advantage for the pattern recognition problem. (Author). Convex sets dtict Geometry dtict Sequences(mathematics) dtict Applied Mathematics and Statistics Laboratory <Stanford, Calif.>: Technical report 30 (DE-604)BV006665053 30 |
| spellingShingle | Rosen, J. B. Pattern separation by convex programming Applied Mathematics and Statistics Laboratory <Stanford, Calif.>: Technical report Convex sets dtict Geometry dtict Sequences(mathematics) dtict |
| title | Pattern separation by convex programming |
| title_auth | Pattern separation by convex programming |
| title_exact_search | Pattern separation by convex programming |
| title_full | Pattern separation by convex programming |
| title_fullStr | Pattern separation by convex programming |
| title_full_unstemmed | Pattern separation by convex programming |
| title_short | Pattern separation by convex programming |
| title_sort | pattern separation by convex programming |
| topic | Convex sets dtict Geometry dtict Sequences(mathematics) dtict |
| topic_facet | Convex sets Geometry Sequences(mathematics) |
| volume_link | (DE-604)BV006665053 |
| work_keys_str_mv | AT rosenjb patternseparationbyconvexprogramming |