{"id":"https://openalex.org/W2162465786","doi":null,"title":"New Interior Point Algorithms in Linear Programming","display_name":"New Interior Point Algorithms in Linear Programming","alternate_titles":[],"publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2162465786","mag":"2162465786"},"language":"en","primary_location":{"id":"mag:2162465786","doi":null,"is_oa":false,"landing_page_url":"https://camo.ici.ro/journal/vol5/v5a4.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2162465786"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5008992501","display_name":"Zsolt Darvay","orcid":"https://orcid.org/0000-0003-1094-9837","observed_orcids":["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":true,"contributor_roles":[],"raw_author_name":"Zsolt Darvay","raw_affiliation_strings":["Babe\u0219-Bolyai University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Babe\u0219-Bolyai University","institution_ids":["https://openalex.org/I3125347698"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008992501"],"corresponding_institution_ids":["https://openalex.org/I3125347698"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":133,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9916999936103821,"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.9916999936103821,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0066999997943639755,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.000699999975040555,"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-methods","display_name":"interior point methods","score":0.9869999885559082},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.9900000095367432},{"id":"https://openalex.org/keywords/path-following-methods","display_name":"path-following algorithm","score":0.8320000171661377},{"id":"https://openalex.org/keywords/affine-scaling-algorithm","display_name":"affine scaling algorithm","score":0.7229999899864197},{"id":"https://openalex.org/keywords/polynomial-time-complexity","display_name":"polynomial complexity","score":0.6620000004768372},{"id":"https://openalex.org/keywords/search-direction","display_name":"search direction","score":0.8809999823570251},{"id":"https://openalex.org/keywords/primal-dual-algorithm","display_name":"primal-dual algorithm","score":0.8550000190734863}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.8615585565567017},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5980162620544434},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5605590343475342},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5471746325492859},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.536287784576416},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5080616474151611},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.46714019775390625},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4163439869880676},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2954804301261902},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:2162465786","doi":null,"is_oa":false,"landing_page_url":"https://camo.ici.ro/journal/vol5/v5a4.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.9.4761","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.4761","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ici.ro/camo/journal/vol5/v5a4.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":89,"referenced_works":["https://openalex.org/W2745897","https://openalex.org/W21055737","https://openalex.org/W38740827","https://openalex.org/W56357078","https://openalex.org/W60613359","https://openalex.org/W100806451","https://openalex.org/W172058465","https://openalex.org/W622285400","https://openalex.org/W1493426390","https://openalex.org/W1509805685","https://openalex.org/W1518039036","https://openalex.org/W1520524616","https://openalex.org/W1527244075","https://openalex.org/W1528546869","https://openalex.org/W1533868172","https://openalex.org/W1549344391","https://openalex.org/W1552959538","https://openalex.org/W1553078613","https://openalex.org/W1570961610","https://openalex.org/W1571051474","https://openalex.org/W1801355583","https://openalex.org/W1847083924","https://openalex.org/W1963547452","https://openalex.org/W1969136247","https://openalex.org/W1973117121","https://openalex.org/W1976673614","https://openalex.org/W1977916887","https://openalex.org/W1980845317","https://openalex.org/W1981053712","https://openalex.org/W1981315194","https://openalex.org/W1982967176","https://openalex.org/W1985564371","https://openalex.org/W1991534386","https://openalex.org/W1996267767","https://openalex.org/W2004342328","https://openalex.org/W2005037958","https://openalex.org/W2005992544","https://openalex.org/W2008062072","https://openalex.org/W2008772536","https://openalex.org/W2013162809","https://openalex.org/W2013986021","https://openalex.org/W2014746566","https://openalex.org/W2014885585","https://openalex.org/W2016187009","https://openalex.org/W2021395303","https://openalex.org/W2022004439","https://openalex.org/W2026021734","https://openalex.org/W2027552368","https://openalex.org/W2028205846","https://openalex.org/W2031527878","https://openalex.org/W2036021825","https://openalex.org/W2036622774","https://openalex.org/W2036675242","https://openalex.org/W2036792480","https://openalex.org/W2038981176","https://openalex.org/W2040063808","https://openalex.org/W2044618353","https://openalex.org/W2048662938","https://openalex.org/W2051192977","https://openalex.org/W2056940310","https://openalex.org/W2059014132","https://openalex.org/W2059202085","https://openalex.org/W2061711344","https://openalex.org/W2068674826","https://openalex.org/W2071563913","https://openalex.org/W2072653654","https://openalex.org/W2072821511","https://openalex.org/W2074316151","https://openalex.org/W2074889170","https://openalex.org/W2076768004","https://openalex.org/W2079737176","https://openalex.org/W2082909387","https://openalex.org/W2086511826","https://openalex.org/W2086867325","https://openalex.org/W2086920040","https://openalex.org/W2088717993","https://openalex.org/W2091964672","https://openalex.org/W2094326251","https://openalex.org/W2109514698","https://openalex.org/W2112079301","https://openalex.org/W2117350831","https://openalex.org/W2127470768","https://openalex.org/W2204863336","https://openalex.org/W2223756460","https://openalex.org/W2599168675","https://openalex.org/W2611147814","https://openalex.org/W2801172117","https://openalex.org/W2912522929","https://openalex.org/W4244832091"],"related_works":["https://openalex.org/W2118574163","https://openalex.org/W2181661122","https://openalex.org/W4252305540","https://openalex.org/W2983452511","https://openalex.org/W2076710905","https://openalex.org/W7130511943","https://openalex.org/W2160492481","https://openalex.org/W1493426390","https://openalex.org/W7047837294","https://openalex.org/W7120700998"],"abstract_inverted_index":{"In":[0,58,71,90,102,149,195],"this":[1,130,137,218,234],"paper":[2],"the":[3,6,20,38,59,72,79,82,85,91,103,142,147,150,158,162,172,185,196,199,203],"abstract":[4],"of":[5,19,37,55,65,78,129,168,233],"thesis":[7,21,52],"\"New":[8],"Interior":[9],"Point":[10],"Algorithms":[11],"in":[12,146,161,202,222],"Linear":[13],"Programming\"":[14],"is":[15,22,53,69,117,125,132,139,175,181,193,206,215,220,236],"presented.":[16,89],"The":[17,34,51,231],"purpose":[18],"to":[23,224],"elaborate":[24],"new":[25,39,95,107,121,166,178,227],"interior":[26,66,97,114],"point":[27,67,98,115],"algorithms":[28,40,48,87,99,116],"for":[29,109,113,171,183,208],"solving":[30,184],"linear":[31,187],"optimization":[32,188],"problems.":[33],"theoretical":[35],"complexity":[36,128,138,145,192,232],"are":[41,49,88,100],"calculated.":[42],"We":[43,134],"also":[44],"prove":[45],"that":[46,136],"these":[47],"polynomial.":[50],"composed":[54],"seven":[56],"chapters.":[57],"first":[60],"chapter":[61,105,198,205],"a":[62,106,120,154,165,226],"short":[63],"history":[64],"methods":[68],"discussed.":[70],"following":[73],"three":[74,93],"chapters":[75,94],"some":[76],"variants":[77],"a#ne":[80],"scaling,":[81],"projective":[83],"and":[84,119,190,217],"path-following":[86,96],"last":[92,197],"defined.":[101,126],"fifth":[104,204],"method":[108,200],"constructing":[110],"search":[111,169],"directions":[112,170],"introduced,":[118],"primal-dual":[122,179,228],"pathfollowing":[123],"algorithm":[124,131,180,214,219,235],"Polynomial":[127],"proved.":[133,194],"mention":[135],"identical":[140],"with":[141,157],"best":[143],"known":[144],"present.":[148],"sixth":[151],"chapter,":[152,164],"using":[153],"similar":[155],"approach":[156],"one":[159],"defined":[160,182],"previous":[163],"class":[167],"self-dual":[173,186],"problem":[174],"introduced.":[176],"A":[177,211],"problem,":[189],"polynomial":[191],"proposed":[201],"generalized":[207],"target-following":[209,213],"methods.":[210],"conceptual":[212],"defined,":[216],"particularized":[221],"order":[223],"obtain":[225],"weighted-path-following":[229],"method.":[230],"computed.":[237]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2162465786","counts_by_year":[{"year":2026,"cited_by_count":6},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":15},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":14},{"year":2012,"cited_by_count":8}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
