{"id":"https://openalex.org/W1996101393","doi":"https://doi.org/10.1080/00207169908804882","title":"A logarithm barrier method for linear programming","display_name":"A logarithm barrier method for linear programming","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1996101393","doi":"https://doi.org/10.1080/00207169908804882","mag":"1996101393"},"language":"en","primary_location":{"id":"doi:10.1080/00207169908804882","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169908804882","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/A5110131767","display_name":"Gianfranco Corradi","orcid":null},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Gianfranco Corradi","raw_affiliation_strings":["Faculty of Economics Via Del Castro , University of Rome\"La Sapienza\" , Laurenziano, Roma, 9 00161,  Italy","Faculty of Economics Via Del Castro, University of Rome\"La Sapienza\", Laurenziano, Roma, 9 00161, Italy","Faculty of Economics Via Del Castro , University of RomeLa Sapienza , Laurenziano, Roma, 9 00161, Italy"],"affiliations":[{"raw_affiliation_string":"Faculty of Economics Via Del Castro , University of Rome\"La Sapienza\" , Laurenziano, Roma, 9 00161,  Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Faculty of Economics Via Del Castro, University of Rome\"La Sapienza\", Laurenziano, Roma, 9 00161, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Faculty of Economics Via Del Castro , University of RomeLa Sapienza , Laurenziano, Roma, 9 00161, Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5110131767"],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15260252,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"73","issue":"1","first_page":"93","last_page":"104"},"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.998199999332428,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9977999925613403,"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/taylor-series","display_name":"Taylor series","score":0.7449820637702942},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7050942182540894},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6902051568031311},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.58978670835495},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.5829893946647644},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5760177969932556},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5301588177680969},{"id":"https://openalex.org/keywords/newtons-method-in-optimization","display_name":"Newton's method in optimization","score":0.45870861411094666},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.4575599133968353},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.4557192027568817},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.44261085987091064},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.440863698720932},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.4304405152797699},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4228655993938446},{"id":"https://openalex.org/keywords/linear-fractional-programming","display_name":"Linear-fractional programming","score":0.42207467555999756},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42118653655052185},{"id":"https://openalex.org/keywords/local-convergence","display_name":"Local convergence","score":0.3486369252204895},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26218050718307495},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09375855326652527}],"concepts":[{"id":"https://openalex.org/C158946198","wikidata":"https://www.wikidata.org/wiki/Q131187","display_name":"Taylor series","level":2,"score":0.7449820637702942},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7050942182540894},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6902051568031311},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.58978670835495},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.5829893946647644},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5760177969932556},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5301588177680969},{"id":"https://openalex.org/C179127668","wikidata":"https://www.wikidata.org/wiki/Q17086396","display_name":"Newton's method in optimization","level":4,"score":0.45870861411094666},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4575599133968353},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.4557192027568817},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.44261085987091064},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.440863698720932},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.4304405152797699},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4228655993938446},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.42207467555999756},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42118653655052185},{"id":"https://openalex.org/C117898588","wikidata":"https://www.wikidata.org/wiki/Q6664310","display_name":"Local convergence","level":3,"score":0.3486369252204895},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26218050718307495},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09375855326652527},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/00207169908804882","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169908804882","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"},{"id":"pmh:oai:iris.uniroma1.it:11573/1065","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/1065","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1559606740","https://openalex.org/W1669104078","https://openalex.org/W2030490984","https://openalex.org/W2036567359","https://openalex.org/W2059102393","https://openalex.org/W2068048371","https://openalex.org/W2085548605","https://openalex.org/W2086867325","https://openalex.org/W2108142042","https://openalex.org/W2170451819","https://openalex.org/W4250915400"],"related_works":["https://openalex.org/W1548681518","https://openalex.org/W2313656068","https://openalex.org/W2348398807","https://openalex.org/W2778996617","https://openalex.org/W4205485413","https://openalex.org/W1987530871","https://openalex.org/W2050215206","https://openalex.org/W2029804256","https://openalex.org/W1993818022","https://openalex.org/W2350788688"],"abstract_inverted_index":{"In":[0,27],"a":[1,55,62],"previous":[2],"paper":[3,29],"[6]":[4,37],"we":[5,30],"introduce":[6,48],"an":[7,11,17,49],"algorithm":[8],"for":[9,53],"solving":[10,54],"unconstrained":[12],"optimization":[13],"problem":[14,58],"based":[15],"on":[16],"iterative":[18,33],"process":[19,34],"which":[20],"makes":[21],"use":[22,60],"of":[23,43,61,70],"higher":[24],"order":[25],"derivatives.":[26],"this":[28,44],"consider":[31],"the":[32,40,68,71],"presented":[35],"in":[36],"and":[38],"prove":[39],"cubic":[41],"convergence":[42],"process.":[45],"We,":[46],"moreover,":[47],"interior":[50],"point":[51],"method":[52],"linear":[56],"programming":[57],"making":[59],"Taylor":[63],"series":[64],"expansion":[65],"related":[66],"to":[67],"gradient":[69],"penalty":[72],"function.":[73],"Finally":[74],"some":[75],"numerical":[76],"results":[77],"are":[78],"reported.":[79]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}