{"id":"https://openalex.org/W1977018573","doi":"https://doi.org/10.1007/s11075-013-9772-1","title":"Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function","display_name":"Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function","publication_year":2014,"publication_date":"2014-01-13","ids":{"openalex":"https://openalex.org/W1977018573","doi":"https://doi.org/10.1007/s11075-013-9772-1","mag":"1977018573"},"language":"en","primary_location":{"id":"doi:10.1007/s11075-013-9772-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11075-013-9772-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/A5044356249","display_name":"M. Reza Peyghami","orcid":"https://orcid.org/0000-0003-0360-040X"},"institutions":[{"id":"https://openalex.org/I80543232","display_name":"K.N.Toosi University of Technology","ror":"https://ror.org/0433abe34","country_code":"IR","type":"education","lineage":["https://openalex.org/I80543232"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"M. Reza Peyghami","raw_affiliation_strings":["Department of Mathematics, K.N. Toosi Univ. of Tech., P.O. Box 16315-1618, Tehran, Iran","Scientific Computations in Optimization and Systems Engineering (SCOPE), K.N. Toosi Univ. of Tech., P.O. Box 16315-1618, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, K.N. Toosi Univ. of Tech., P.O. Box 16315-1618, Tehran, Iran","institution_ids":["https://openalex.org/I80543232"]},{"raw_affiliation_string":"Scientific Computations in Optimization and Systems Engineering (SCOPE), K.N. Toosi Univ. of Tech., P.O. Box 16315-1618, Tehran, Iran","institution_ids":["https://openalex.org/I80543232"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000950110","display_name":"Sajad Fathi Hafshejani","orcid":"https://orcid.org/0000-0002-5731-8234"},"institutions":[{"id":"https://openalex.org/I80543232","display_name":"K.N.Toosi University of Technology","ror":"https://ror.org/0433abe34","country_code":"IR","type":"education","lineage":["https://openalex.org/I80543232"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"S. Fathi Hafshejani","raw_affiliation_strings":["Department of Mathematics, K.N. Toosi Univ. of Tech., P.O. Box 16315-1618, Tehran, Iran","Scientific Computations in Optimization and Systems Engineering (SCOPE), K.N. Toosi Univ. of Tech., P.O. Box 16315-1618, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, K.N. Toosi Univ. of Tech., P.O. Box 16315-1618, Tehran, Iran","institution_ids":["https://openalex.org/I80543232"]},{"raw_affiliation_string":"Scientific Computations in Optimization and Systems Engineering (SCOPE), K.N. Toosi Univ. of Tech., P.O. Box 16315-1618, Tehran, Iran","institution_ids":["https://openalex.org/I80543232"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5044356249"],"corresponding_institution_ids":["https://openalex.org/I80543232"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":3.8567,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.92458876,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"67","issue":"1","first_page":"33","last_page":"48"},"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/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":0.9796000123023987,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9757999777793884,"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.8292423486709595},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8216253519058228},{"id":"https://openalex.org/keywords/trigonometric-functions","display_name":"Trigonometric functions","score":0.6589361429214478},{"id":"https://openalex.org/keywords/kernel","display_name":"Kernel (algebra)","score":0.5881226062774658},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5212829113006592},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5123647451400757},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5104169249534607},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4994194507598877},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.42506957054138184},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37718576192855835},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3488539457321167},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11412426829338074}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.8292423486709595},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8216253519058228},{"id":"https://openalex.org/C178009071","wikidata":"https://www.wikidata.org/wiki/Q93344","display_name":"Trigonometric functions","level":2,"score":0.6589361429214478},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.5881226062774658},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5212829113006592},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5123647451400757},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5104169249534607},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4994194507598877},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.42506957054138184},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37718576192855835},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3488539457321167},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11412426829338074},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s11075-013-9772-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11075-013-9772-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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W21055737","https://openalex.org/W1493426390","https://openalex.org/W1533868172","https://openalex.org/W1546612351","https://openalex.org/W1573409602","https://openalex.org/W1632601927","https://openalex.org/W1709621369","https://openalex.org/W1996119919","https://openalex.org/W2030548196","https://openalex.org/W2059947385","https://openalex.org/W2074316151","https://openalex.org/W2078688491","https://openalex.org/W2131995325","https://openalex.org/W2611147814"],"related_works":["https://openalex.org/W2965106131","https://openalex.org/W2094757704","https://openalex.org/W2114808974","https://openalex.org/W25030584","https://openalex.org/W29231041","https://openalex.org/W2610104823","https://openalex.org/W2074889170","https://openalex.org/W2092044038","https://openalex.org/W2144582354","https://openalex.org/W3125179639"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}