{"id":"https://openalex.org/W2898622871","doi":"https://doi.org/10.1080/10556788.2018.1528248","title":"A long-step feasible predictor\u2013corrector interior-point algorithm for symmetric cone optimization","display_name":"A long-step feasible predictor\u2013corrector interior-point algorithm for symmetric cone optimization","publication_year":2018,"publication_date":"2018-10-30","ids":{"openalex":"https://openalex.org/W2898622871","doi":"https://doi.org/10.1080/10556788.2018.1528248","mag":"2898622871"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2018.1528248","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2018.1528248","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/A5063915949","display_name":"Soodabeh Asadi","orcid":"https://orcid.org/0000-0002-8053-9043"},"institutions":[{"id":"https://openalex.org/I127908078","display_name":"Shahrekord University","ror":"https://ror.org/051rngw70","country_code":"IR","type":"education","lineage":["https://openalex.org/I127908078"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"S. Asadi","raw_affiliation_strings":["Department of Applied Mathematics, Faculty of Mathematical Sciences, Shahrekord University, Shahrekord, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Faculty of Mathematical Sciences, Shahrekord University, Shahrekord, Iran","institution_ids":["https://openalex.org/I127908078"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103222724","display_name":"H. Mansouri","orcid":"https://orcid.org/0000-0001-7921-8501"},"institutions":[{"id":"https://openalex.org/I127908078","display_name":"Shahrekord University","ror":"https://ror.org/051rngw70","country_code":"IR","type":"education","lineage":["https://openalex.org/I127908078"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"H. Mansouri","raw_affiliation_strings":["Department of Applied Mathematics, Faculty of Mathematical Sciences, Shahrekord University, Shahrekord, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Faculty of Mathematical Sciences, Shahrekord University, Shahrekord, Iran","institution_ids":["https://openalex.org/I127908078"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008992501","display_name":"Zsolt Darvay","orcid":"https://orcid.org/0000-0003-1094-9837"},"institutions":[{"id":"https://openalex.org/I3125347698","display_name":"Babe\u0219-Bolyai University","ror":"https://ror.org/02rmd1t30","country_code":"RO","type":"education","lineage":["https://openalex.org/I3125347698"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Zs. Darvay","raw_affiliation_strings":["Faculty of Mathematics and Computer Science, Babes-Bolyai University, Cluj-Napoca, Romania"],"raw_orcid":"https://orcid.org/0000-0003-1094-9837","affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Computer Science, Babes-Bolyai University, Cluj-Napoca, Romania","institution_ids":["https://openalex.org/I3125347698"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033947647","display_name":"Goran Le\u0161aja","orcid":"https://orcid.org/0000-0003-3840-4599"},"institutions":[{"id":"https://openalex.org/I39815113","display_name":"Georgia Southern University","ror":"https://ror.org/04agmb972","country_code":"US","type":"education","lineage":["https://openalex.org/I39815113"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"G. Lesaja","raw_affiliation_strings":["Department of Mathematical Sciences, Georgia Southern University, Statesboro, GA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Georgia Southern University, Statesboro, GA, USA","institution_ids":["https://openalex.org/I39815113"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066012035","display_name":"M. Zangiabadi","orcid":null},"institutions":[{"id":"https://openalex.org/I127908078","display_name":"Shahrekord University","ror":"https://ror.org/051rngw70","country_code":"IR","type":"education","lineage":["https://openalex.org/I127908078"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"M. Zangiabadi","raw_affiliation_strings":["Department of Applied Mathematics, Faculty of Mathematical Sciences, Shahrekord University, Shahrekord, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Faculty of Mathematical Sciences, Shahrekord University, Shahrekord, Iran","institution_ids":["https://openalex.org/I127908078"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5103222724"],"corresponding_institution_ids":["https://openalex.org/I127908078"],"apc_list":null,"apc_paid":null,"fwci":0.3411,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.57975035,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"34","issue":"2","first_page":"336","last_page":"362"},"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.9961000084877014,"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/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9886000156402588,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.7363467216491699},{"id":"https://openalex.org/keywords/predictor\u2013corrector-method","display_name":"Predictor\u2013corrector method","score":0.6210236549377441},{"id":"https://openalex.org/keywords/cone","display_name":"Cone (formal languages)","score":0.6119115948677063},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5742397308349609},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5676480531692505},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5234317779541016},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5204139351844788},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.47480905055999756},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4505591094493866},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.43529707193374634},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.43089157342910767},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.42072534561157227},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2778364419937134},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1797093152999878},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1475849449634552}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.7363467216491699},{"id":"https://openalex.org/C157977623","wikidata":"https://www.wikidata.org/wiki/Q2650267","display_name":"Predictor\u2013corrector method","level":2,"score":0.6210236549377441},{"id":"https://openalex.org/C30014739","wikidata":"https://www.wikidata.org/wiki/Q5159445","display_name":"Cone (formal languages)","level":2,"score":0.6119115948677063},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5742397308349609},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5676480531692505},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5234317779541016},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5204139351844788},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.47480905055999756},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4505591094493866},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.43529707193374634},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.43089157342910767},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.42072534561157227},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2778364419937134},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1797093152999878},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1475849449634552},{"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.2018.1528248","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2018.1528248","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":[{"display_name":"Sustainable cities and communities","score":0.7400000095367432,"id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G493703442","display_name":null,"funder_award_id":"94GRD1M1034, 94GRD1M2003","funder_id":"https://openalex.org/F4320308292","funder_display_name":"Corporation for National and Community Service"}],"funders":[{"id":"https://openalex.org/F4320308292","display_name":"Corporation for National and Community Service","ror":"https://ror.org/00p8rjs69"},{"id":"https://openalex.org/F4320322969","display_name":"Shahrekord University","ror":"https://ror.org/051rngw70"},{"id":"https://openalex.org/F4320323983","display_name":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","ror":"https://ror.org/01q7jq182"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W10800830","https://openalex.org/W82689443","https://openalex.org/W1546612351","https://openalex.org/W1582916799","https://openalex.org/W1632601927","https://openalex.org/W1981315194","https://openalex.org/W1996045511","https://openalex.org/W1996119919","https://openalex.org/W1996300679","https://openalex.org/W2006980285","https://openalex.org/W2016700492","https://openalex.org/W2022266190","https://openalex.org/W2022575150","https://openalex.org/W2034177488","https://openalex.org/W2035277428","https://openalex.org/W2041498215","https://openalex.org/W2042592476","https://openalex.org/W2051178311","https://openalex.org/W2077274614","https://openalex.org/W2079466664","https://openalex.org/W2085309471","https://openalex.org/W2086867325","https://openalex.org/W2093249882","https://openalex.org/W2096247314","https://openalex.org/W2117065890","https://openalex.org/W2149454052","https://openalex.org/W2157918496","https://openalex.org/W2164438160","https://openalex.org/W2165323796","https://openalex.org/W2170172991","https://openalex.org/W2275234501","https://openalex.org/W2443947004","https://openalex.org/W2478040551","https://openalex.org/W2572594781","https://openalex.org/W2911789798"],"related_works":["https://openalex.org/W1997779033","https://openalex.org/W1988364556","https://openalex.org/W2324999667","https://openalex.org/W2032195938","https://openalex.org/W3115336282","https://openalex.org/W2180665313","https://openalex.org/W2763458913","https://openalex.org/W2363366096","https://openalex.org/W1968198558","https://openalex.org/W2024113337"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"present":[4],"a":[5,39,94],"feasible":[6,40],"predictor\u2013corrector":[7,29,119],"interior-point":[8,83],"method":[9,24,104],"for":[10,85],"symmetric":[11,33,86],"cone":[12,34,87],"optimization":[13,35],"problem":[14],"in":[15,43,55,105],"the":[16,20,32,48,51,62,76,103,108,111,118],"large":[17,45],"neighbourhood":[18,46],"of":[19,27,47,97,102,110],"central":[21,49],"path.":[22],"The":[23,89],"is":[25,68,114],"generalization":[26],"Ai-Zhang's":[28],"algorithm":[30,52,112],"to":[31],"problem.":[36],"Starting":[37],"with":[38,107],"point":[41],"(x0,y0,s0)":[42],"given":[44],"path,":[50],"still":[53],"terminates":[54],"at":[56],"most":[57],"Orlog\u2061(Tr(x0\u2218s0)/\u03b5)":[58],"iterations.":[59],"This":[60],"matches":[61],"best":[63],"known":[64],"iteration":[65],"bound":[66],"that":[67,113],"usually":[69],"achieved":[70],"by":[71],"short-step":[72,82],"methods,":[73],"thereby,":[74],"closing":[75],"complexity":[77],"gap":[78],"between":[79],"long-":[80],"and":[81],"methods":[84],"optimization.":[88],"preliminary":[90],"numerical":[91],"results":[92],"on":[93,117],"selected":[95],"set":[96],"NETLIB":[98],"problems":[99],"show":[100],"advantage":[101],"comparison":[106],"version":[109],"not":[115],"based":[116],"scheme.":[120]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}