{"id":"https://openalex.org/W2040050334","doi":"https://doi.org/10.1137/0331074","title":"A Path-Following Algorithm for Linear Programming Using Quadratic and Logarithmic Penalty Functions","display_name":"A Path-Following Algorithm for Linear Programming Using Quadratic and Logarithmic Penalty Functions","publication_year":1993,"publication_date":"1993-11-01","ids":{"openalex":"https://openalex.org/W2040050334","doi":"https://doi.org/10.1137/0331074","mag":"2040050334"},"language":"en","primary_location":{"id":"doi:10.1137/0331074","doi":"https://doi.org/10.1137/0331074","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0331074","pdf_url":null,"source":{"id":"https://openalex.org/S897311980","display_name":"SIAM Journal on Control and Optimization","issn_l":"0363-0129","issn":["0363-0129","1095-7138"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","cwts-core","dongbi-a","jufo-3","ki-jl-1","norway-2","poland-100","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Control and Optimization","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1721.1/3193","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110258450","display_name":"Paul Tseng","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Paul Tseng","raw_affiliation_strings":["Laboratory for Information and Decision Systems and Center for Intelligent Control Systems, Room 35-205, Massachusetts Institute of Technology, Cambridge, MA 02139"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory for Information and Decision Systems and Center for Intelligent Control Systems, Room 35-205, Massachusetts Institute of Technology, Cambridge, MA 02139","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5110258450"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_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":null,"biblio":{"volume":"31","issue":"6","first_page":"1578","last_page":"1598"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9970999956130981,"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.9970999956130981,"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.0010000000474974513,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.00039999998989515007,"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/path-following-methods","display_name":"path-following algorithm","score":0.9610000252723694},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.9950000047683716},{"id":"https://openalex.org/keywords/quadratic-penalty","display_name":"quadratic penalty","score":0.996999979019165},{"id":"https://openalex.org/keywords/non-negativity-constraints","display_name":"nonnegativity constraints","score":0.7839999794960022},{"id":"https://openalex.org/keywords/equality-constraints","display_name":"equality constraints","score":0.8379999995231628},{"id":"https://openalex.org/keywords/newton-s-method","display_name":"Newton's method","score":0.8460000157356262},{"id":"https://openalex.org/keywords/linear-convergence","display_name":"linear convergence","score":0.9819999933242798},{"id":"https://openalex.org/keywords/interior-point-methods","display_name":"interior point methods","score":0.5509999990463257}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8306823968887329},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.8118069171905518},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.7141215205192566},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.6360681653022766},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5547580718994141},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5533761382102966},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5312336087226868},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5136072635650635},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5091671347618103},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41298648715019226},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1308794617652893},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07362416386604309},{"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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/0331074","doi":"https://doi.org/10.1137/0331074","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0331074","pdf_url":null,"source":{"id":"https://openalex.org/S897311980","display_name":"SIAM Journal on Control and Optimization","issn_l":"0363-0129","issn":["0363-0129","1095-7138"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","cwts-core","dongbi-a","jufo-3","ki-jl-1","norway-2","poland-100","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Control and Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.219.1690","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.219.1690","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.washington.edu/~tseng/papers/archive/newlpalg_siam.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.931.271","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.931.271","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dspace.mit.edu/bitstream/handle/1721.1/3193/P-1963-21455007.pdf%3Bjsessionid%3D2799B87101CB491BD60DA0AFAE913323?sequence%3D1","raw_type":"text"},{"id":"pmh:oai:dspace.mit.edu:1721.1/3193","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/3193","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/3193","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/3193","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W51359543","https://openalex.org/W1528546869","https://openalex.org/W1669104078","https://openalex.org/W1709621369","https://openalex.org/W1794576667","https://openalex.org/W1973117121","https://openalex.org/W1981885118","https://openalex.org/W1985978629","https://openalex.org/W1987953347","https://openalex.org/W1989097425","https://openalex.org/W2002576214","https://openalex.org/W2004367844","https://openalex.org/W2009550616","https://openalex.org/W2014746566","https://openalex.org/W2026121678","https://openalex.org/W2030674458","https://openalex.org/W2041934365","https://openalex.org/W2053913299","https://openalex.org/W2057185554","https://openalex.org/W2057624533","https://openalex.org/W2059448930","https://openalex.org/W2074316151","https://openalex.org/W2074751680","https://openalex.org/W2083214473","https://openalex.org/W2093357498","https://openalex.org/W2094757704","https://openalex.org/W2108894884","https://openalex.org/W2130839351","https://openalex.org/W2135779729","https://openalex.org/W2154951198","https://openalex.org/W2155500999","https://openalex.org/W2326806701","https://openalex.org/W2512731937","https://openalex.org/W2611147814","https://openalex.org/W4249667877","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2074316151","https://openalex.org/W2005992544","https://openalex.org/W7095629044","https://openalex.org/W2735395627","https://openalex.org/W98326516","https://openalex.org/W2168825111","https://openalex.org/W64202333","https://openalex.org/W1996101393","https://openalex.org/W2059043079","https://openalex.org/W1990909561"],"abstract_inverted_index":{"Motivated":[0],"by":[1],"a":[2,7,25,28,77,100],"recent":[3],"work":[4],"of":[5,42],"Setiono,":[6],"path-following":[8],"algorithm":[9,66,105,117],"for":[10],"linear":[11],"programming":[12],"using":[13],"both":[14],"logarithmic":[15,26],"and":[16,27,38,55,73,91],"quadratic":[17,29],"penalty":[18,30,61,93],"functions":[19],"is":[20,31,48,81,88,106],"proposed.":[21],"In":[22],"the":[23,35,43,52,60,85,92,104,116],"algorithm,":[24],"placed":[32],"on,":[33],"respectively,":[34],"nonnegativity":[36],"constraints":[37],"an":[39],"arbitrary":[40],"subset":[41],"equality":[44],"constraints;":[45],"Newton\u2019s":[46],"method":[47],"applied":[49],"to":[50,97,132],"solve":[51,134],"penalized":[53],"problem,":[54],"after":[56],"each":[57,135],"Newton":[58],"step":[59],"parameters":[62,94],"are":[63,95,111],"decreased.":[64],"This":[65],"maintains":[67],"neither":[68],"primal":[69],"nor":[70],"dual":[71],"feasibility":[72],"does":[74],"not":[75],"require":[76],"Phase":[78],"I.":[79],"It":[80],"shown":[82],"that":[83,115],"if":[84],"initial":[86],"iterate":[87],"chosen":[89],"appropriately":[90],"decreased":[96],"zero":[98],"in":[99,125],"particular":[101],"way,":[102],"then":[103],"linearly":[107],"convergent.":[108],"Numerical":[109],"results":[110],"also":[112],"presented":[113],"suggesting":[114],"may":[118],"be":[119],"competitive":[120],"with":[121],"interior":[122],"point":[123],"algorithms":[124],"practice,":[126],"requiring":[127],"typically":[128],"between":[129],"30\u201345":[130],"iterations":[131],"accurately":[133],"Netlib":[136],"problem":[137],"tested.":[138]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}