{"id":"https://openalex.org/W2115992951","doi":"https://doi.org/10.1080/10556780500095009","title":"New criss-cross type algorithms for linear complementarity problems with sufficient matrices","display_name":"New criss-cross type algorithms for linear complementarity problems with sufficient matrices","publication_year":2005,"publication_date":"2005-11-29","ids":{"openalex":"https://openalex.org/W2115992951","doi":"https://doi.org/10.1080/10556780500095009","mag":"2115992951"},"language":"en","primary_location":{"id":"doi:10.1080/10556780500095009","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780500095009","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/A5051539509","display_name":"Zsolt Csizmadia","orcid":null},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Zsolt Csizmadia","raw_affiliation_strings":["Department of Operations Research , E\u00f6tv\u00f6s Lor\u00e1nd University of Sciences , P\u00e1zm\u00e1ny P\u00e9ter S\u00e9t\u00e1ny 1/C, H-1117, Budapest, Hungary"],"affiliations":[{"raw_affiliation_string":"Department of Operations Research , E\u00f6tv\u00f6s Lor\u00e1nd University of Sciences , P\u00e1zm\u00e1ny P\u00e9ter S\u00e9t\u00e1ny 1/C, H-1117, Budapest, Hungary","institution_ids":["https://openalex.org/I106118109"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072919774","display_name":"Tibor Ill\u00e9s","orcid":"https://orcid.org/0000-0002-8789-6211"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Tibor Ill\u00e9s","raw_affiliation_strings":["Department of Operations Research , E\u00f6tv\u00f6s Lor\u00e1nd University of Sciences , P\u00e1zm\u00e1ny P\u00e9ter S\u00e9t\u00e1ny 1/C, H-1117, Budapest, Hungary"],"affiliations":[{"raw_affiliation_string":"Department of Operations Research , E\u00f6tv\u00f6s Lor\u00e1nd University of Sciences , P\u00e1zm\u00e1ny P\u00e9ter S\u00e9t\u00e1ny 1/C, H-1117, Budapest, Hungary","institution_ids":["https://openalex.org/I106118109"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5072919774"],"corresponding_institution_ids":["https://openalex.org/I106118109"],"apc_list":null,"apc_paid":null,"fwci":1.01,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.78331413,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"21","issue":"2","first_page":"247","last_page":"266"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9990000128746033,"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.9990000128746033,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9948999881744385,"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/T11673","display_name":"Advanced Topics in Algebra","score":0.9688000082969666,"subfield":{"id":"https://openalex.org/subfields/2602","display_name":"Algebra and Number Theory"},"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-complementarity-problem","display_name":"Linear complementarity problem","score":0.6972100138664246},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.677038311958313},{"id":"https://openalex.org/keywords/complementarity","display_name":"Complementarity (molecular biology)","score":0.598313570022583},{"id":"https://openalex.org/keywords/positive-definiteness","display_name":"Positive definiteness","score":0.5863528251647949},{"id":"https://openalex.org/keywords/complementarity-theory","display_name":"Complementarity theory","score":0.558671236038208},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5560666918754578},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5264859199523926},{"id":"https://openalex.org/keywords/constructive-proof","display_name":"Constructive proof","score":0.5178242325782776},{"id":"https://openalex.org/keywords/mixed-complementarity-problem","display_name":"Mixed complementarity problem","score":0.4463393986225128},{"id":"https://openalex.org/keywords/criss-cross-algorithm","display_name":"Criss-cross algorithm","score":0.442507803440094},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.44094669818878174},{"id":"https://openalex.org/keywords/invertible-matrix","display_name":"Invertible matrix","score":0.4188501238822937},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.4131550192832947},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3816930055618286},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32511240243911743},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20815613865852356},{"id":"https://openalex.org/keywords/positive-definite-matrix","display_name":"Positive-definite matrix","score":0.19448938965797424},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.11564266681671143},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.10267341136932373},{"id":"https://openalex.org/keywords/linear-fractional-programming","display_name":"Linear-fractional programming","score":0.08220499753952026}],"concepts":[{"id":"https://openalex.org/C34320192","wikidata":"https://www.wikidata.org/wiki/Q783105","display_name":"Linear complementarity problem","level":3,"score":0.6972100138664246},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.677038311958313},{"id":"https://openalex.org/C202269582","wikidata":"https://www.wikidata.org/wiki/Q2644277","display_name":"Complementarity (molecular biology)","level":2,"score":0.598313570022583},{"id":"https://openalex.org/C2778265155","wikidata":"https://www.wikidata.org/wiki/Q7233276","display_name":"Positive definiteness","level":4,"score":0.5863528251647949},{"id":"https://openalex.org/C85404239","wikidata":"https://www.wikidata.org/wiki/Q5156417","display_name":"Complementarity theory","level":3,"score":0.558671236038208},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5560666918754578},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5264859199523926},{"id":"https://openalex.org/C202854965","wikidata":"https://www.wikidata.org/wiki/Q3044470","display_name":"Constructive proof","level":2,"score":0.5178242325782776},{"id":"https://openalex.org/C77196050","wikidata":"https://www.wikidata.org/wiki/Q6883962","display_name":"Mixed complementarity problem","level":3,"score":0.4463393986225128},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.442507803440094},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.44094669818878174},{"id":"https://openalex.org/C96442724","wikidata":"https://www.wikidata.org/wiki/Q242188","display_name":"Invertible matrix","level":2,"score":0.4188501238822937},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.4131550192832947},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3816930055618286},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32511240243911743},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20815613865852356},{"id":"https://openalex.org/C49712288","wikidata":"https://www.wikidata.org/wiki/Q77601250","display_name":"Positive-definite matrix","level":3,"score":0.19448938965797424},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.11564266681671143},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.10267341136932373},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.08220499753952026},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/10556780500095009","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780500095009","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"},{"id":"pmh:oai:strathprints.strath.ac.uk:28221","is_oa":false,"landing_page_url":"https://strathprints.strath.ac.uk/28221/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402226","display_name":"Strathprints: The University of Strathclyde institutional repository (University of Strathclyde)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I181647926","host_organization_name":"University of Strathclyde","host_organization_lineage":["https://openalex.org/I181647926"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322192","display_name":"Magyar Tudom\u00e1nyos Akad\u00e9mia","ror":"https://ror.org/02ks8qq67"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1570961610","https://openalex.org/W1964825436","https://openalex.org/W1970000960","https://openalex.org/W1982002079","https://openalex.org/W1982749624","https://openalex.org/W1988949476","https://openalex.org/W2015893008","https://openalex.org/W2032083477","https://openalex.org/W2074947226","https://openalex.org/W2117350831","https://openalex.org/W2128226814","https://openalex.org/W2404213135","https://openalex.org/W2561675875","https://openalex.org/W4253785454","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4289075993","https://openalex.org/W1979597395","https://openalex.org/W2994981659","https://openalex.org/W2043587525","https://openalex.org/W2349445207","https://openalex.org/W2571013927","https://openalex.org/W2038257044","https://openalex.org/W2046380970","https://openalex.org/W1985553727","https://openalex.org/W1808511149"],"abstract_inverted_index":{"We":[0,61],"generalize":[1],"new":[2],"criss-cross":[3,55],"type":[4,56],"algorithms":[5],"for":[6,58],"linear":[7,48],"complementarity":[8],"problems":[9],"(LCPs)":[10],"given":[11],"with":[12,74,102],"sufficient":[13],"matrices.":[14],"Most":[15],"LCP":[16,117,175],"solvers":[17],"require":[18],"a":[19,29,68,109,127,167],"priori":[20],"information":[21,81],"about":[22,82],"the":[23,83,86,105,116,130,153,160],"input":[24,131],"matrix.":[25],"The":[26],"sufficiency":[27],"of":[28,85,104,112,148,163],"matrix":[30,76,87,132],"is":[31,40,44,133,143],"hard":[32],"to":[33,46,171],"be":[34],"checked":[35],"(no":[36],"polynomial":[37],"time":[38],"method":[39],"known).":[41],"Our":[42],"algorithm":[43,57,65,100,142,165],"similar":[45],"Zhang's":[47],"programming":[49],"and":[50,53,151,173],"Akkeles\u00b8,":[51,149],"Balogh":[52,150],"Ill\u00e9s's":[54],"LCP-QP":[59],"problems.":[60],"modify":[62],"our":[63,99,141,164],"basic":[64],"in":[66,93,96,108],"such":[67],"way":[69],"that":[70,129,147],"it":[71,114,119,125],"can":[72,138],"start":[73],"any":[75,80],"M,":[77],"without":[78],"having":[79],"properties":[84],"(sufficiency,":[88],"bisymmetry,":[89],"positive":[90],"definiteness,":[91],"etc.)":[92],"advance.":[94],"Even":[95],"this":[97],"case,":[98],"terminates":[101],"one":[103],"following":[106],"cases":[107],"finite":[110],"number":[111],"steps:":[113],"solves":[115,120],"problem,":[118],"its":[121],"dual":[122],"problem":[123],"or":[124],"gives":[126,166],"certificate":[128],"not":[134],"sufficient,":[135],"thus":[136],"cycling":[137],"occur.":[139],"Although":[140],"more":[144],"general":[145],"than":[146],"Ill\u00e9s's,":[152],"finiteness":[154,161],"proof":[155,162,170],"has":[156],"been":[157],"simplified.":[158],"Furthermore,":[159],"new,":[168],"constructive":[169],"Fukuda":[172],"Terlaky's":[174],"duality":[176],"theorem":[177],"as":[178],"well.":[179]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}