{"id":"https://openalex.org/W4377140088","doi":"https://doi.org/10.1080/10556788.2023.2198769","title":"A branch and bound method solving the max\u2013min linear discriminant analysis problem","display_name":"A branch and bound method solving the max\u2013min linear discriminant analysis problem","publication_year":2023,"publication_date":"2023-05-19","ids":{"openalex":"https://openalex.org/W4377140088","doi":"https://doi.org/10.1080/10556788.2023.2198769"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2023.2198769","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1080/10556788.2023.2198769","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/10556788.2023.2198769?needAccess=true&role=button","source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.tandfonline.com/doi/pdf/10.1080/10556788.2023.2198769?needAccess=true&role=button","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069363394","display_name":"Amir Beck","orcid":"https://orcid.org/0000-0003-1493-291X"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Amir Beck","raw_affiliation_strings":["School of Mathematical Sciences, Tel Aviv University, Tel Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112919539","display_name":"Raz Sharon","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Raz Sharon","raw_affiliation_strings":["School of Mathematical Sciences, Tel Aviv University, Tel Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5069363394"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":0.1607,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.35669187,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"38","issue":"5","first_page":"1031","last_page":"1057"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.9847000241279602,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9843999743461609,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/linear-discriminant-analysis","display_name":"Linear discriminant analysis","score":0.8464636206626892},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8284162282943726},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6426727771759033},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.637976884841919},{"id":"https://openalex.org/keywords/dimensionality-reduction","display_name":"Dimensionality reduction","score":0.6191906929016113},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5863866209983826},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5765997171401978},{"id":"https://openalex.org/keywords/discriminant-function-analysis","display_name":"Discriminant function analysis","score":0.47846719622612},{"id":"https://openalex.org/keywords/optimal-discriminant-analysis","display_name":"Optimal discriminant analysis","score":0.4781659245491028},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.452208012342453},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.42913079261779785},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4236871600151062},{"id":"https://openalex.org/keywords/discriminant","display_name":"Discriminant","score":0.4219900071620941},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2925463318824768},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2755167484283447},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1994660496711731},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1458449363708496}],"concepts":[{"id":"https://openalex.org/C69738355","wikidata":"https://www.wikidata.org/wiki/Q1228929","display_name":"Linear discriminant analysis","level":2,"score":0.8464636206626892},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8284162282943726},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6426727771759033},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.637976884841919},{"id":"https://openalex.org/C70518039","wikidata":"https://www.wikidata.org/wiki/Q16000077","display_name":"Dimensionality reduction","level":2,"score":0.6191906929016113},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5863866209983826},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5765997171401978},{"id":"https://openalex.org/C41771347","wikidata":"https://www.wikidata.org/wiki/Q1228929","display_name":"Discriminant function analysis","level":2,"score":0.47846719622612},{"id":"https://openalex.org/C104500394","wikidata":"https://www.wikidata.org/wiki/Q17104912","display_name":"Optimal discriminant analysis","level":3,"score":0.4781659245491028},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.452208012342453},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.42913079261779785},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4236871600151062},{"id":"https://openalex.org/C78397625","wikidata":"https://www.wikidata.org/wiki/Q192487","display_name":"Discriminant","level":2,"score":0.4219900071620941},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2925463318824768},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2755167484283447},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1994660496711731},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1458449363708496},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2023.2198769","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1080/10556788.2023.2198769","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/10556788.2023.2198769?needAccess=true&role=button","source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1080/10556788.2023.2198769","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1080/10556788.2023.2198769","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/10556788.2023.2198769?needAccess=true&role=button","source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.75}],"awards":[{"id":"https://openalex.org/G2595038944","display_name":null,"funder_award_id":"926/21","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4377140088.pdf"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1875533481","https://openalex.org/W1977806565","https://openalex.org/W1983905049","https://openalex.org/W2001619934","https://openalex.org/W2027982384","https://openalex.org/W2069323107","https://openalex.org/W2091850740","https://openalex.org/W2093781566","https://openalex.org/W2118807841","https://openalex.org/W2123157895","https://openalex.org/W2128202699","https://openalex.org/W2137199074","https://openalex.org/W2144931885","https://openalex.org/W2495457432","https://openalex.org/W2799148064","https://openalex.org/W4210963865","https://openalex.org/W4212863985","https://openalex.org/W4213174622","https://openalex.org/W6678385540"],"related_works":["https://openalex.org/W1964119535","https://openalex.org/W2483483979","https://openalex.org/W1534459252","https://openalex.org/W4238888834","https://openalex.org/W2939502838","https://openalex.org/W2025089370","https://openalex.org/W2146026567","https://openalex.org/W2021817983","https://openalex.org/W2368666353","https://openalex.org/W2752731235"],"abstract_inverted_index":{"Fisher":[0,24],"linear":[1],"discriminant":[2],"analysis":[3],"(FLDA":[4],"or":[5],"LDA)":[6],"is":[7,96],"a":[8,39,75,82],"well-known":[9],"technique":[10],"for":[11,87],"dimension":[12],"reduction":[13,95],"and":[14,84],"classification.":[15],"The":[16],"method":[17,86],"was":[18],"first":[19],"formulated":[20],"in":[21,25,90],"1936":[22],"by":[23],"the":[26,35,46,63,88,91,94,98],"one-dimensional":[27,99],"setting.":[28],"In":[29],"this":[30],"paper,":[31],"we":[32,54],"will":[33,55,61],"examine":[34],"LDA":[36],"problem":[37,89],"using":[38],"different":[40],"objective":[41,58],"function.":[42],"Instead":[43],"of":[44,48],"maximizing":[45],"sum":[47],"all":[49,52,67,70],"distances":[50,68],"between":[51,69],"classes,":[53],"define":[56],"an":[57],"function":[59],"that":[60],"maximize":[62],"minimum":[64],"separation":[65],"among":[66],"classes.":[71],"This":[72],"leads":[73],"to":[74,97],"difficult":[76],"nonconvex":[77],"optimization":[78],"problem.":[79],"We":[80],"present":[81],"branch":[83],"bound":[85],"case":[92],"where":[93],"space.":[100]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}