{"id":"https://openalex.org/W2310020878","doi":"https://doi.org/10.1080/00207160.2015.1085028","title":"A corrector\u2013predictor path-following method for second-order cone optimization","display_name":"A corrector\u2013predictor path-following method for second-order cone optimization","publication_year":2015,"publication_date":"2015-08-25","ids":{"openalex":"https://openalex.org/W2310020878","doi":"https://doi.org/10.1080/00207160.2015.1085028","mag":"2310020878"},"language":"en","primary_location":{"id":"doi:10.1080/00207160.2015.1085028","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160.2015.1085028","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"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":"International Journal of Computer Mathematics","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":"B. Kheirfam","raw_affiliation_strings":["Department of Applied Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran","institution_ids":["https://openalex.org/I51301133"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5029506482"],"corresponding_institution_ids":["https://openalex.org/I51301133"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.18629637,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"93","issue":"12","first_page":"2064","last_page":"2078"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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/T10288","display_name":"Fractional Differential Equations Solutions","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/2611","display_name":"Modeling and Simulation"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9909999966621399,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/mathematics","display_name":"Mathematics","score":0.7151920795440674},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.7024058699607849},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6235400438308716},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.5932885408401489},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5867432355880737},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.5833616852760315},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5335431694984436},{"id":"https://openalex.org/keywords/cone","display_name":"Cone (formal languages)","score":0.48932474851608276},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44723206758499146},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.44407594203948975},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2011338472366333},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.15742909908294678}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7151920795440674},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.7024058699607849},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6235400438308716},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.5932885408401489},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5867432355880737},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.5833616852760315},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5335431694984436},{"id":"https://openalex.org/C30014739","wikidata":"https://www.wikidata.org/wiki/Q5159445","display_name":"Cone (formal languages)","level":2,"score":0.48932474851608276},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44723206758499146},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.44407594203948975},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2011338472366333},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.15742909908294678},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160.2015.1085028","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160.2015.1085028","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"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":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5899999737739563,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1158336912","https://openalex.org/W1582916799","https://openalex.org/W1871716056","https://openalex.org/W1980901515","https://openalex.org/W1992863603","https://openalex.org/W1996045511","https://openalex.org/W2004747456","https://openalex.org/W2006980285","https://openalex.org/W2009826121","https://openalex.org/W2009923109","https://openalex.org/W2014885585","https://openalex.org/W2018098459","https://openalex.org/W2025473301","https://openalex.org/W2042592476","https://openalex.org/W2047626675","https://openalex.org/W2071001262","https://openalex.org/W2076280751","https://openalex.org/W2077274614","https://openalex.org/W2086670316","https://openalex.org/W2105235982","https://openalex.org/W2117065890","https://openalex.org/W2162465786"],"related_works":["https://openalex.org/W1823078487","https://openalex.org/W1758063681","https://openalex.org/W2095983929","https://openalex.org/W2498799440","https://openalex.org/W2034177488","https://openalex.org/W2153851007","https://openalex.org/W1536532856","https://openalex.org/W3124111004","https://openalex.org/W2952370250","https://openalex.org/W2092565441"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"present":[4],"a":[5,17,24,29,37],"corrector\u2013predictor":[6],"path-following":[7],"interior-point":[8],"method":[9],"for":[10,53,61],"second-order":[11],"cone":[12],"optimization":[13],"(SOCO)":[14],"based":[15,35],"on":[16,36],"new":[18,38],"proximity":[19,39],"measure.":[20,40],"The":[21,63],"algorithm":[22,45,70],"produces":[23],"sequence":[25],"of":[26,31],"iterates":[27],"in":[28],"neighbourhood":[30],"the":[32,44,50,54,58,68],"central":[33],"path":[34],"We":[41,56],"show":[42,66],"that":[43,67],"is":[46,71],"well-defined":[47],"and":[48],"derive":[49],"complexity":[51],"bound":[52],"algorithm.":[55],"obtain":[57],"best-known":[59],"result":[60],"SOCO.":[62],"numerical":[64],"results":[65],"proposed":[69],"effective.":[72]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}