{"id":"https://openalex.org/W2507505996","doi":"https://doi.org/10.1007/s11075-018-0469-3","title":"Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming","display_name":"Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming","publication_year":2018,"publication_date":"2018-01-12","ids":{"openalex":"https://openalex.org/W2507505996","doi":"https://doi.org/10.1007/s11075-018-0469-3","mag":"2507505996"},"language":"en","primary_location":{"id":"doi:10.1007/s11075-018-0469-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11075-018-0469-3","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1609.00694","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Y. Yang","orcid":"https://orcid.org/0000-0002-2943-9389"},"institutions":[{"id":"https://openalex.org/I1280339224","display_name":"United States Nuclear Regulatory Commission","ror":"https://ror.org/03nhmbj89","country_code":"US","type":"government","lineage":["https://openalex.org/I1280339224"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Y. Yang","raw_affiliation_strings":["Office of Research, US NRC, Two White Flint North 11545 Rockville Pike, Rockville, MD, 20852-2738, USA"],"affiliations":[{"raw_affiliation_string":"Office of Research, US NRC, Two White Flint North 11545 Rockville Pike, Rockville, MD, 20852-2738, USA","institution_ids":["https://openalex.org/I1280339224"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1280339224"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":2.0505,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.84526022,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"79","issue":"3","first_page":"957","last_page":"992"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.8894000053405762,"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.8894000053405762,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.03709999844431877,"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"}},{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.020099999383091927,"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/theory-of-computation","display_name":"Theory of computation","score":0.6557999849319458},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5371000170707703},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.48969998955726624},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4593000113964081},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4514999985694885},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4162999987602234},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4124999940395355},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.39660000801086426}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7303000092506409},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6557999849319458},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5378000140190125},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5371000170707703},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.48969998955726624},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4593000113964081},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4514999985694885},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4162999987602234},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4124999940395355},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.39660000801086426},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3862999975681305},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.3646000027656555},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.35740000009536743},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34200000762939453},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.3188000023365021},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3165000081062317},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.30630001425743103},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.27869999408721924},{"id":"https://openalex.org/C34628019","wikidata":"https://www.wikidata.org/wiki/Q13636890","display_name":"Algorithmics","level":2,"score":0.274399995803833},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.26030001044273376},{"id":"https://openalex.org/C48753275","wikidata":"https://www.wikidata.org/wiki/Q11216","display_name":"Numerical analysis","level":2,"score":0.25189998745918274}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s11075-018-0469-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11075-018-0469-3","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"},{"id":"pmh:oai:arXiv.org:1609.00694","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1609.00694","pdf_url":"https://arxiv.org/pdf/1609.00694","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1609.00694","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1609.00694","pdf_url":"https://arxiv.org/pdf/1609.00694","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W219701461","https://openalex.org/W1191021814","https://openalex.org/W1518039036","https://openalex.org/W1533868172","https://openalex.org/W1971910179","https://openalex.org/W1981315194","https://openalex.org/W1985332751","https://openalex.org/W1987953347","https://openalex.org/W1992596978","https://openalex.org/W1996314042","https://openalex.org/W2021328462","https://openalex.org/W2030490984","https://openalex.org/W2030674458","https://openalex.org/W2043868859","https://openalex.org/W2045867632","https://openalex.org/W2046332585","https://openalex.org/W2053624310","https://openalex.org/W2059676477","https://openalex.org/W2086397439","https://openalex.org/W2086648616","https://openalex.org/W2086867325","https://openalex.org/W2089389443","https://openalex.org/W2149454052","https://openalex.org/W2160272666","https://openalex.org/W2165452678","https://openalex.org/W2169287093","https://openalex.org/W2480935067","https://openalex.org/W2611147814"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-09-16T00:00:00"}