{"id":"https://openalex.org/W3099619126","doi":"https://doi.org/10.1137/18m1234473","title":"Nonlinear Eigenvector Methods for Convex Minimization over the Numerical Range","display_name":"Nonlinear Eigenvector Methods for Convex Minimization over the Numerical Range","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3099619126","doi":"https://doi.org/10.1137/18m1234473","mag":"3099619126"},"language":"en","primary_location":{"id":"doi:10.1137/18m1234473","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1234473","pdf_url":null,"source":{"id":"https://openalex.org/S16958353","display_name":"SIAM Journal on Matrix Analysis and Applications","issn_l":"0895-4798","issn":["0895-4798","1095-7162"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Matrix Analysis and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102002819","display_name":"Ding Lu","orcid":"https://orcid.org/0009-0009-5493-0696"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ding Lu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5102002819"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1457,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.55738742,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"41","issue":"4","first_page":"1771","last_page":"1796"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11205","display_name":"Numerical methods in inverse problems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7400160431861877},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.6289303302764893},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.516105055809021},{"id":"https://openalex.org/keywords/conjugate-gradient-method","display_name":"Conjugate gradient method","score":0.506672203540802},{"id":"https://openalex.org/keywords/hermitian-matrix","display_name":"Hermitian matrix","score":0.48245078325271606},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.458503782749176},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44279342889785767},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4347270429134369},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.4323868453502655},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.426058292388916},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.363212913274765},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32406365871429443},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.1931692361831665}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7400160431861877},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.6289303302764893},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.516105055809021},{"id":"https://openalex.org/C81184566","wikidata":"https://www.wikidata.org/wiki/Q1191895","display_name":"Conjugate gradient method","level":2,"score":0.506672203540802},{"id":"https://openalex.org/C94940","wikidata":"https://www.wikidata.org/wiki/Q652941","display_name":"Hermitian matrix","level":2,"score":0.48245078325271606},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.458503782749176},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44279342889785767},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4347270429134369},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.4323868453502655},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.426058292388916},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.363212913274765},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32406365871429443},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.1931692361831665},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/18m1234473","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1234473","pdf_url":null,"source":{"id":"https://openalex.org/S16958353","display_name":"SIAM Journal on Matrix Analysis and Applications","issn_l":"0895-4798","issn":["0895-4798","1095-7162"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Matrix Analysis and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G868323961","display_name":"Robust and fast solvers for computing extremal quantities of structured pseudospectra","funder_award_id":"169115","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"}],"funders":[{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W1502316316","https://openalex.org/W1522512418","https://openalex.org/W1551360398","https://openalex.org/W1963865366","https://openalex.org/W1974888421","https://openalex.org/W1975648481","https://openalex.org/W1981044874","https://openalex.org/W1987589111","https://openalex.org/W1999009163","https://openalex.org/W2002497815","https://openalex.org/W2005783283","https://openalex.org/W2013183108","https://openalex.org/W2020818415","https://openalex.org/W2021195188","https://openalex.org/W2021525163","https://openalex.org/W2024364296","https://openalex.org/W2032875116","https://openalex.org/W2037064199","https://openalex.org/W2042138331","https://openalex.org/W2046434053","https://openalex.org/W2051142108","https://openalex.org/W2052171888","https://openalex.org/W2069705790","https://openalex.org/W2089121071","https://openalex.org/W2092344142","https://openalex.org/W2092679871","https://openalex.org/W2093229781","https://openalex.org/W2110442969","https://openalex.org/W2116901831","https://openalex.org/W2134792818","https://openalex.org/W2144787788","https://openalex.org/W2163052154","https://openalex.org/W2163989778","https://openalex.org/W2178909929","https://openalex.org/W2498996515","https://openalex.org/W2730407774","https://openalex.org/W2798766386","https://openalex.org/W2896604562","https://openalex.org/W2963601630","https://openalex.org/W3029645440","https://openalex.org/W3105381404","https://openalex.org/W3140025309"],"related_works":["https://openalex.org/W4324118942","https://openalex.org/W2913057782","https://openalex.org/W2734993473","https://openalex.org/W2185064329","https://openalex.org/W2187229407","https://openalex.org/W2059909660","https://openalex.org/W3030201206","https://openalex.org/W4302394465","https://openalex.org/W2734242255","https://openalex.org/W2977264569"],"abstract_inverted_index":{"We":[0,58],"consider":[1],"the":[2,16,56,62,66,102,105,131,150,163],"optimization":[3,36,67],"problem":[4,68,77],"in":[5,148],"which":[6,96],"a":[7,49,71,74,98],"continuous":[8],"convex":[9,35],"function":[10],"is":[11,46,97],"to":[12,47,54,70,101,127],"be":[13,38,123,142],"minimized":[14],"over":[15],"joint":[17],"numerical":[18],"range":[19],"of":[20,28,43,65,73,85,104,130,153,165],"two":[21],"Hermitian":[22,115],"matrices.":[23],"When":[24],"those":[25],"matrices":[26],"are":[27],"large":[29],"size,":[30],"solving":[31,158],"such":[32,135],"problems":[33],"by":[34],"can":[37,122],"computationally":[39],"expensive.":[40],"The":[41,82],"goal":[42],"this":[44,86],"paper":[45],"present":[48],"novel":[50],"nonlinear":[51,75,99],"eigenvector":[52,79,129],"method":[53],"accelerate":[55],"computation.":[57],"will":[59,141],"show":[60,162],"that":[61],"global":[63],"minimizer":[64],"corresponds":[69],"solution":[72],"eigenvalue":[76,117],"with":[78,146],"nonlinearity":[80],"(NEPv).":[81],"special":[83],"structure":[84],"NEPv":[87,103],"allows":[88],"for":[89,114],"an":[90,128],"efficient":[91],"sequential":[92],"subspace":[93],"search":[94],"algorithm,":[95],"analogue":[100],"commonly":[106],"applied":[107],"locally":[108],"optimal":[109],"conjugate":[110],"gradient":[111],"descent":[112],"methods":[113],"linear":[116],"problems.":[118],"Our":[119],"new":[120],"algorithm":[121],"proven":[124],"globally":[125],"convergent":[126],"NEPv.":[132],"Implementation":[133],"details":[134],"as":[136],"block":[137],"iteration":[138],"and":[139,157],"preconditioning":[140],"discussed.":[143],"Numerical":[144],"examples,":[145],"applications":[147],"computing":[149],"coercivity":[151],"constant":[152],"boundary":[154],"integral":[155],"operators":[156],"multicast":[159],"beamforming":[160],"problems,":[161],"effectiveness":[164],"our":[166],"approach.":[167]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-06-22T08:00:12.763002","created_date":"2025-10-10T00:00:00"}