{"id":"https://openalex.org/W3095438095","doi":"https://doi.org/10.1007/s11075-020-01033-1","title":"An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood","display_name":"An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood","publication_year":2020,"publication_date":"2020-10-29","ids":{"openalex":"https://openalex.org/W3095438095","doi":"https://doi.org/10.1007/s11075-020-01033-1","mag":"3095438095"},"language":"en","primary_location":{"id":"doi:10.1007/s11075-020-01033-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11075-020-01033-1","pdf_url":null,"source":{"id":"https://openalex.org/S117494069","display_name":"Numerical Algorithms","issn_l":"1017-1398","issn":["1017-1398","1572-9265"],"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":"Numerical Algorithms","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/A5029506482","display_name":"Behrouz Kheirfam","orcid":"https://orcid.org/0000-0001-7928-2618"},"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":true,"raw_author_name":"Behrouz Kheirfam","raw_affiliation_strings":["Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran"],"raw_orcid":"https://orcid.org/0000-0001-7928-2618","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran","institution_ids":["https://openalex.org/I51301133"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033692068","display_name":"Naser Osmanpour","orcid":null},"institutions":[{"id":"https://openalex.org/I877176835","display_name":"University of Guilan","ror":"https://ror.org/01bdr6121","country_code":"IR","type":"education","lineage":["https://openalex.org/I877176835"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Naser Osmanpour","raw_affiliation_strings":["Faculty of Mathematical Sciences, University of Guilan, Rasht, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematical Sciences, University of Guilan, Rasht, Iran","institution_ids":["https://openalex.org/I877176835"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049738235","display_name":"Mohammad Keyanpour","orcid":"https://orcid.org/0000-0002-6499-2489"},"institutions":[{"id":"https://openalex.org/I877176835","display_name":"University of Guilan","ror":"https://ror.org/01bdr6121","country_code":"IR","type":"education","lineage":["https://openalex.org/I877176835"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mohammad Keyanpour","raw_affiliation_strings":["Faculty of Mathematical Sciences, University of Guilan, Rasht, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematical Sciences, University of Guilan, Rasht, Iran","institution_ids":["https://openalex.org/I877176835"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5029506482"],"corresponding_institution_ids":["https://openalex.org/I51301133"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.2956,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.54768519,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"88","issue":"1","first_page":"143","last_page":"163"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":1.0,"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":1.0,"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.9975000023841858,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9958999752998352,"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.8060750365257263},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.714790403842926},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6538997888565063},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5400420427322388},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.5362486243247986},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5258610248565674},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.48811158537864685},{"id":"https://openalex.org/keywords/infinity","display_name":"Infinity","score":0.46169599890708923},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44467049837112427},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.42043831944465637},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.41815757751464844},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4147638976573944},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.3853832483291626},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37318289279937744},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3388969302177429},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1580788791179657},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11091944575309753},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08711826801300049}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8060750365257263},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.714790403842926},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6538997888565063},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5400420427322388},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.5362486243247986},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5258610248565674},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.48811158537864685},{"id":"https://openalex.org/C7321624","wikidata":"https://www.wikidata.org/wiki/Q205","display_name":"Infinity","level":2,"score":0.46169599890708923},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44467049837112427},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42043831944465637},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.41815757751464844},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4147638976573944},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3853832483291626},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37318289279937744},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3388969302177429},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1580788791179657},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11091944575309753},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08711826801300049},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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.1007/s11075-020-01033-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11075-020-01033-1","pdf_url":null,"source":{"id":"https://openalex.org/S117494069","display_name":"Numerical Algorithms","issn_l":"1017-1398","issn":["1017-1398","1572-9265"],"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":"Numerical Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.6700000166893005}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W609648197","https://openalex.org/W1963753244","https://openalex.org/W1964730816","https://openalex.org/W1967184028","https://openalex.org/W1967344706","https://openalex.org/W1977327182","https://openalex.org/W1985984741","https://openalex.org/W1992596978","https://openalex.org/W1998493034","https://openalex.org/W1999913571","https://openalex.org/W2007157764","https://openalex.org/W2025486357","https://openalex.org/W2057898847","https://openalex.org/W2075379600","https://openalex.org/W2077274614","https://openalex.org/W2079466664","https://openalex.org/W2086397439","https://openalex.org/W2086867325","https://openalex.org/W2096247314","https://openalex.org/W2117065890","https://openalex.org/W2128202699","https://openalex.org/W2133184112","https://openalex.org/W2149454052","https://openalex.org/W2259408100","https://openalex.org/W2291100075","https://openalex.org/W2506277857","https://openalex.org/W2507505996","https://openalex.org/W2551338718","https://openalex.org/W2581419493","https://openalex.org/W2799378641","https://openalex.org/W2899684910","https://openalex.org/W2920774045","https://openalex.org/W3102461863","https://openalex.org/W3210839039"],"related_works":["https://openalex.org/W1997197201","https://openalex.org/W2269291726","https://openalex.org/W2185334956","https://openalex.org/W2392811087","https://openalex.org/W2013335138","https://openalex.org/W1999354768","https://openalex.org/W3172187730","https://openalex.org/W3199193613","https://openalex.org/W2289721777","https://openalex.org/W3095438095"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}