{"id":"https://openalex.org/W2233439009","doi":"https://doi.org/10.1080/10556788.2015.1040156","title":"The second-order cone eigenvalue complementarity problem","display_name":"The second-order cone eigenvalue complementarity problem","publication_year":2015,"publication_date":"2015-05-29","ids":{"openalex":"https://openalex.org/W2233439009","doi":"https://doi.org/10.1080/10556788.2015.1040156","mag":"2233439009"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2015.1040156","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2015.1040156","pdf_url":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057585042","display_name":"Lu\u00eds M. Fernandes","orcid":"https://orcid.org/0000-0002-4792-9410"},"institutions":[{"id":"https://openalex.org/I4210120471","display_name":"Instituto de Telecomunica\u00e7\u00f5es","ror":"https://ror.org/02ht4fk33","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I4210120471"]},{"id":"https://openalex.org/I4210126619","display_name":"Instituto Polit\u00e9cnico de Tomar","ror":"https://ror.org/03gsfpp62","country_code":"PT","type":"education","lineage":["https://openalex.org/I4210126619"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"Lu\u00eds M. Fernandes","raw_affiliation_strings":["Instituto Polit\u00e9cnico de Tomar and Instituto de Telecomunica\u00e7\u00f5es, Tomar, Portugal"],"affiliations":[{"raw_affiliation_string":"Instituto Polit\u00e9cnico de Tomar and Instituto de Telecomunica\u00e7\u00f5es, Tomar, Portugal","institution_ids":["https://openalex.org/I4210126619","https://openalex.org/I4210120471"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058813836","display_name":"Masao Fukushima","orcid":"https://orcid.org/0000-0002-4372-6376"},"institutions":[{"id":"https://openalex.org/I119031078","display_name":"Nanzan University","ror":"https://ror.org/042b6j696","country_code":"JP","type":"education","lineage":["https://openalex.org/I119031078"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Masao Fukushima","raw_affiliation_strings":["Faculty of Science and Technology, Nanzan University, Seto, Aichi 489-0863, Japan"],"affiliations":[{"raw_affiliation_string":"Faculty of Science and Technology, Nanzan University, Seto, Aichi 489-0863, Japan","institution_ids":["https://openalex.org/I119031078"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066766041","display_name":"Joaqu\u00edm J. J\u00fadice","orcid":"https://orcid.org/0000-0001-9441-4877"},"institutions":[{"id":"https://openalex.org/I4210120471","display_name":"Instituto de Telecomunica\u00e7\u00f5es","ror":"https://ror.org/02ht4fk33","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I4210120471"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Joaquim J. J\u00fadice","raw_affiliation_strings":["Instituto de Telecomunica\u00e7\u00f5es, Coimbra, Portugal"],"affiliations":[{"raw_affiliation_string":"Instituto de Telecomunica\u00e7\u00f5es, Coimbra, Portugal","institution_ids":["https://openalex.org/I4210120471"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043357545","display_name":"Hanif D. Sherali","orcid":null},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hanif D. Sherali","raw_affiliation_strings":["Grado Department of Industrial & Systems Engineering, Virginia Tech, Blacksburg, VA, USA"],"affiliations":[{"raw_affiliation_string":"Grado Department of Industrial & Systems Engineering, Virginia Tech, Blacksburg, VA, USA","institution_ids":["https://openalex.org/I859038795"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5057585042"],"corresponding_institution_ids":["https://openalex.org/I4210120471","https://openalex.org/I4210126619"],"apc_list":null,"apc_paid":null,"fwci":2.4658,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.89174944,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"31","issue":"1","first_page":"24","last_page":"52"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9995999932289124,"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"}},{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9965000152587891,"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/T11115","display_name":"Topology Optimization in Engineering","score":0.9435999989509583,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"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.8020755052566528},{"id":"https://openalex.org/keywords/complementarity-theory","display_name":"Complementarity theory","score":0.7441184520721436},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.598416268825531},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.584854781627655},{"id":"https://openalex.org/keywords/variational-inequality","display_name":"Variational inequality","score":0.581676721572876},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.5068474411964417},{"id":"https://openalex.org/keywords/solution-set","display_name":"Solution set","score":0.4794718027114868},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4719124138355255},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.46289318799972534},{"id":"https://openalex.org/keywords/cone","display_name":"Cone (formal languages)","score":0.4299100935459137},{"id":"https://openalex.org/keywords/complementarity","display_name":"Complementarity (molecular biology)","score":0.41817522048950195},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3996818959712982},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.36297607421875},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34665706753730774},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.2560204267501831},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12947657704353333},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11185827851295471}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8020755052566528},{"id":"https://openalex.org/C85404239","wikidata":"https://www.wikidata.org/wiki/Q5156417","display_name":"Complementarity theory","level":3,"score":0.7441184520721436},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.598416268825531},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.584854781627655},{"id":"https://openalex.org/C161999928","wikidata":"https://www.wikidata.org/wiki/Q4556320","display_name":"Variational inequality","level":2,"score":0.581676721572876},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5068474411964417},{"id":"https://openalex.org/C60033838","wikidata":"https://www.wikidata.org/wiki/Q1751685","display_name":"Solution set","level":3,"score":0.4794718027114868},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4719124138355255},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.46289318799972534},{"id":"https://openalex.org/C30014739","wikidata":"https://www.wikidata.org/wiki/Q5159445","display_name":"Cone (formal languages)","level":2,"score":0.4299100935459137},{"id":"https://openalex.org/C202269582","wikidata":"https://www.wikidata.org/wiki/Q2644277","display_name":"Complementarity (molecular biology)","level":2,"score":0.41817522048950195},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3996818959712982},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.36297607421875},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34665706753730774},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2560204267501831},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12947657704353333},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11185827851295471},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2015.1040156","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2015.1040156","pdf_url":null,"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":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.46000000834465027,"display_name":"Reduced inequalities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321837","display_name":"Ministerio de Econom\u00eda y Competitividad","ror":"https://ror.org/034900433"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1551360398","https://openalex.org/W1571070457","https://openalex.org/W1597988518","https://openalex.org/W1963789989","https://openalex.org/W1967926151","https://openalex.org/W1973281249","https://openalex.org/W1979570165","https://openalex.org/W1983312722","https://openalex.org/W1992688650","https://openalex.org/W2007456075","https://openalex.org/W2009923109","https://openalex.org/W2010798167","https://openalex.org/W2012068834","https://openalex.org/W2015120655","https://openalex.org/W2020573560","https://openalex.org/W2022144657","https://openalex.org/W2029590768","https://openalex.org/W2053678650","https://openalex.org/W2055390480","https://openalex.org/W2057932996","https://openalex.org/W2058845227","https://openalex.org/W2059991078","https://openalex.org/W2063190731","https://openalex.org/W2065195435","https://openalex.org/W2123871098","https://openalex.org/W2160824757","https://openalex.org/W2163296482","https://openalex.org/W2165289170","https://openalex.org/W2341428240","https://openalex.org/W2787523326","https://openalex.org/W4234534407","https://openalex.org/W4240362650","https://openalex.org/W4292175028","https://openalex.org/W4301014524","https://openalex.org/W4301791716"],"related_works":["https://openalex.org/W2167187187","https://openalex.org/W2792506125","https://openalex.org/W68625828","https://openalex.org/W3080193815","https://openalex.org/W1964710958","https://openalex.org/W4220978233","https://openalex.org/W4311904575","https://openalex.org/W4205776337","https://openalex.org/W2100458162","https://openalex.org/W2233439009"],"abstract_inverted_index":{"The":[0,101],"eigenvalue":[1,9],"complementarity":[2,33],"problem":[3,10],"(EiCP)":[4],"differs":[5],"from":[6],"the":[7,13,40,43,51,58,118,138,145,149,170,173],"traditional":[8],"in":[11,176],"that":[12,57,80,131],"primal":[14],"and":[15,22,26,30,74,87],"dual":[16],"variables":[17],"belong":[18],"to":[19,61,98,161],"a":[20,32,62,68,75,88,96,107,121,127],"closed":[21],"convex":[23],"cone":[24,45],"K":[25,49,73],"its":[27,163],"dual,":[28],"respectively,":[29],"satisfy":[31],"condition.":[34],"In":[35],"this":[36,99,158],"paper":[37],"we":[38],"investigate":[39],"solution":[41,97],"of":[42,110,117,137,141,172],"second-order":[44],"EiCP":[46],"(SOCEiCP)":[47],"where":[48],"is":[50,92,103,155],"Lorentz":[52],"cone.":[53],"We":[54],"first":[55],"show":[56],"SOCEiCP":[59,81,119],"reduces":[60],"special":[63,122],"Variational":[64],"Inequality":[65],"Problem":[66],"on":[67,105,135],"compact":[69],"set":[70],"defined":[71],"by":[72,148],"normalization":[76],"constraint.":[77],"This":[78],"guarantees":[79],"has":[82],"at":[83],"least":[84],"one":[85],"solution,":[86],"new":[89],"enumerative":[90,159],"algorithm":[91,160],"introduced":[93],"for":[94],"finding":[95,106],"problem.":[100],"method":[102,154],"based":[104],"global":[108],"minimum":[109],"an":[111],"appropriate":[112],"nonlinear":[113,129],"programming":[114],"(NLP)":[115],"formulation":[116],"using":[120],"branching":[123],"scheme":[124],"along":[125],"with":[126,144,157],"local":[128],"optimizer":[130],"computes":[132],"stationary":[133],"points":[134],"subsets":[136],"feasible":[139],"region":[140],"NLP":[142],"associated":[143],"nodes":[146],"generated":[147],"algorithm.":[150],"A":[151],"semi-smooth":[152],"Newton's":[153],"combined":[156],"enhance":[162],"numerical":[164],"performance.":[165],"Our":[166],"computational":[167],"experience":[168],"illustrates":[169],"efficacy":[171],"proposed":[174],"techniques":[175],"practice.":[177]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}