{"id":"https://openalex.org/W2079550254","doi":"https://doi.org/10.1007/s11590-013-0618-5","title":"A new interior-point algorithm based on modified Nesterov\u2013Todd direction for symmetric cone linear complementarity problem","display_name":"A new interior-point algorithm based on modified Nesterov\u2013Todd direction for symmetric cone linear complementarity problem","publication_year":2013,"publication_date":"2013-02-19","ids":{"openalex":"https://openalex.org/W2079550254","doi":"https://doi.org/10.1007/s11590-013-0618-5","mag":"2079550254"},"language":"en","primary_location":{"id":"doi:10.1007/s11590-013-0618-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11590-013-0618-5","pdf_url":null,"source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","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/A5039136332","display_name":"B\u200e. \u200eKheirfam","orcid":null},"institutions":[{"id":"https://openalex.org/I51301133","display_name":"Azarbaijan Shahid Madani University","ror":"https://ror.org/05pg2cw06","country_code":"IR","type":"education","lineage":["https://openalex.org/I51301133"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"B. Kheirfam","raw_affiliation_strings":["Department of Applied Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran","Azarbaijan Shahid Madani university"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran","institution_ids":["https://openalex.org/I51301133"]},{"raw_affiliation_string":"Azarbaijan Shahid Madani university","institution_ids":["https://openalex.org/I51301133"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062019109","display_name":"Nezam Mahdavi\u2010Amiri","orcid":"https://orcid.org/0000-0002-2763-4279"},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"N. Mahdavi-Amiri","raw_affiliation_strings":["Department of Mathematical Sciences, Sharif University of Technology, Tehran, Iran","Sharif University of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Sharif University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]},{"raw_affiliation_string":"Sharif University of Technology","institution_ids":["https://openalex.org/I133529467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":4.6998,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.95029181,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"8","issue":"3","first_page":"1017","last_page":"1029"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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.9958000183105469,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9904000163078308,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.9296083450317383},{"id":"https://openalex.org/keywords/linear-complementarity-problem","display_name":"Linear complementarity problem","score":0.7679973840713501},{"id":"https://openalex.org/keywords/complementarity","display_name":"Complementarity (molecular biology)","score":0.7167137861251831},{"id":"https://openalex.org/keywords/computational-intelligence","display_name":"Computational intelligence","score":0.6180298924446106},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6011415719985962},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5870775580406189},{"id":"https://openalex.org/keywords/complementarity-theory","display_name":"Complementarity theory","score":0.493948757648468},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4830094575881958},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4735540449619293},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45883554220199585},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4421539902687073},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.43457329273223877},{"id":"https://openalex.org/keywords/cone","display_name":"Cone (formal languages)","score":0.4241946339607239},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.31570345163345337},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1579853892326355},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.15696489810943604},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.1416052281856537},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.13136601448059082},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11629778146743774},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.05524328351020813}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.9296083450317383},{"id":"https://openalex.org/C34320192","wikidata":"https://www.wikidata.org/wiki/Q783105","display_name":"Linear complementarity problem","level":3,"score":0.7679973840713501},{"id":"https://openalex.org/C202269582","wikidata":"https://www.wikidata.org/wiki/Q2644277","display_name":"Complementarity (molecular biology)","level":2,"score":0.7167137861251831},{"id":"https://openalex.org/C139502532","wikidata":"https://www.wikidata.org/wiki/Q1122090","display_name":"Computational intelligence","level":2,"score":0.6180298924446106},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6011415719985962},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5870775580406189},{"id":"https://openalex.org/C85404239","wikidata":"https://www.wikidata.org/wiki/Q5156417","display_name":"Complementarity theory","level":3,"score":0.493948757648468},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4830094575881958},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4735540449619293},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45883554220199585},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4421539902687073},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.43457329273223877},{"id":"https://openalex.org/C30014739","wikidata":"https://www.wikidata.org/wiki/Q5159445","display_name":"Cone (formal languages)","level":2,"score":0.4241946339607239},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31570345163345337},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1579853892326355},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.15696489810943604},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.1416052281856537},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.13136601448059082},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11629778146743774},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.05524328351020813},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s11590-013-0618-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11590-013-0618-5","pdf_url":null,"source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W10800830","https://openalex.org/W82689443","https://openalex.org/W1582916799","https://openalex.org/W1981027849","https://openalex.org/W1996045511","https://openalex.org/W2000151369","https://openalex.org/W2000798143","https://openalex.org/W2006980285","https://openalex.org/W2008774137","https://openalex.org/W2016700492","https://openalex.org/W2022266190","https://openalex.org/W2042388020","https://openalex.org/W2042592476","https://openalex.org/W2075379600","https://openalex.org/W2077274614","https://openalex.org/W2093249882","https://openalex.org/W2112332902","https://openalex.org/W2122341846","https://openalex.org/W2168253253","https://openalex.org/W2174236941","https://openalex.org/W2282475954","https://openalex.org/W2611147814","https://openalex.org/W4378195498"],"related_works":["https://openalex.org/W2052366866","https://openalex.org/W4220847489","https://openalex.org/W2038257044","https://openalex.org/W1992200282","https://openalex.org/W2376125925","https://openalex.org/W2382148394","https://openalex.org/W1659710326","https://openalex.org/W2117973746","https://openalex.org/W2068649881","https://openalex.org/W2340400710"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}