{"id":"https://openalex.org/W2056481207","doi":"https://doi.org/10.1137/s1052623401386368","title":"Locating the Least 2-Norm Solution of Linear Programs via a Path-Following Method","display_name":"Locating the Least 2-Norm Solution of Linear Programs via a Path-Following Method","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2056481207","doi":"https://doi.org/10.1137/s1052623401386368","mag":"2056481207"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623401386368","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623401386368","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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 Optimization","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/A5050493484","display_name":"Yun-Bin Zhao","orcid":"https://orcid.org/0000-0001-9285-2793"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Yun-Bin Zhao","raw_affiliation_strings":["Chinese University of Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Chinese University of Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100745907","display_name":"Duan Li","orcid":"https://orcid.org/0000-0001-9786-6238"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Duan Li","raw_affiliation_strings":["Chinese University of Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Chinese University of Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I177725633"],"apc_list":null,"apc_paid":null,"fwci":0.5174,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.66331974,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"12","issue":"4","first_page":"893","last_page":"912"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9979000091552734,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7683864831924438},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7512127757072449},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.7402548789978027},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.6386030912399292},{"id":"https://openalex.org/keywords/karush\u2013kuhn\u2013tucker-conditions","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","score":0.6232434511184692},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5528733134269714},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5270576477050781},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5118672251701355},{"id":"https://openalex.org/keywords/residual","display_name":"Residual","score":0.5035602450370789},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.4870045781135559},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4650173485279083},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4176673889160156},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29834264516830444},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21312499046325684},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1181311309337616}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.7683864831924438},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7512127757072449},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.7402548789978027},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.6386030912399292},{"id":"https://openalex.org/C50454189","wikidata":"https://www.wikidata.org/wiki/Q2075125","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","level":2,"score":0.6232434511184692},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5528733134269714},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5270576477050781},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5118672251701355},{"id":"https://openalex.org/C155512373","wikidata":"https://www.wikidata.org/wiki/Q287450","display_name":"Residual","level":2,"score":0.5035602450370789},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4870045781135559},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4650173485279083},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4176673889160156},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29834264516830444},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21312499046325684},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1181311309337616},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"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":2,"locations":[{"id":"doi:10.1137/s1052623401386368","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623401386368","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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 Optimization","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/a277a47c-c7a6-4711-8eca-c3595117a401","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/a277a47c-c7a6-4711-8eca-c3595117a401","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Li, D & Zhao, Y-B 2002, 'Locating the least 2-norm solution of linear programs via a path-following method', SIAM Journal on Optimization, vol. 12, no. 4, pp. 893-912. https://doi.org/10.1137/S1052623401386368","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W167608187","https://openalex.org/W184596359","https://openalex.org/W1509805685","https://openalex.org/W1560485286","https://openalex.org/W1661542135","https://openalex.org/W1963964731","https://openalex.org/W1964150239","https://openalex.org/W1968243198","https://openalex.org/W1968607806","https://openalex.org/W1968760922","https://openalex.org/W1973520969","https://openalex.org/W1992586477","https://openalex.org/W2002947400","https://openalex.org/W2016273776","https://openalex.org/W2018843371","https://openalex.org/W2022133267","https://openalex.org/W2044382581","https://openalex.org/W2052627810","https://openalex.org/W2055978654","https://openalex.org/W2059448930","https://openalex.org/W2059496213","https://openalex.org/W2065554534","https://openalex.org/W2072418300","https://openalex.org/W2072809596","https://openalex.org/W2073226829","https://openalex.org/W2080180802","https://openalex.org/W2108105954","https://openalex.org/W2110316735","https://openalex.org/W2117634766","https://openalex.org/W2131448432","https://openalex.org/W2145778743","https://openalex.org/W2149846618","https://openalex.org/W4232993594","https://openalex.org/W4298112682"],"related_works":["https://openalex.org/W4244338775","https://openalex.org/W2164754346","https://openalex.org/W4299713359","https://openalex.org/W2035372690","https://openalex.org/W4378551200","https://openalex.org/W2963941240","https://openalex.org/W2610069809","https://openalex.org/W1823078487","https://openalex.org/W2486286901","https://openalex.org/W2965106131"],"abstract_inverted_index":{"A":[0],"linear":[1,12,68,129,148],"program":[2,13,130,149],"has":[3,14],"a":[4,15,44,67,76,82,138,142],"unique":[5],"least":[6,63,124],"2-norm":[7,64,125],"solution,":[8,20],"provided":[9],"that":[10,80,88,107],"the":[11,23,62,93,113,123,128,134,147],"solution.":[16],"To":[17],"locate":[18],"this":[19,42,73,119],"most":[21],"of":[22,66,72,103],"existing":[24],"methods":[25,53],"were":[26],"devised":[27],"to":[28,122,137],"solve":[29],"certain":[30],"equivalent":[31],"perturbed":[32],"quadratic":[33],"programs":[34],"or":[35],"unconstrained":[36],"minimization":[37],"problems.":[38],"We":[39],"provide":[40],"in":[41,97],"paper":[43],"new":[45],"theory":[46],"which":[47,140],"is":[48,55,75,89,106,131,150],"different":[49,91],"from":[50,92],"these":[51],"traditional":[52],"and":[54],"an":[56],"effective":[57],"numerical":[58],"method":[59,74,105],"for":[60],"seeking":[61],"solution":[65,126],"program.":[69],"The":[70,115],"essence":[71],"(interior-point-like)":[77],"path-following":[78],"algorithm":[79,120],"traces":[81],"newly":[83],"introduced":[84],"regularized":[85],"central":[86,94],"path":[87,95],"fairly":[90],"used":[96],"interior-point":[98],"methods.":[99],"One":[100],"distinguishing":[101],"feature":[102],"our":[104],"it":[108],"imposes":[109],"no":[110],"assumption":[111],"on":[112],"problem.":[114],"iterates":[116,135],"generated":[117],"by":[118],"converge":[121,136],"whenever":[127],"solvable;":[132],"otherwise,":[133],"point":[139],"gives":[141],"minimal":[143],"KKT":[144],"residual":[145],"when":[146],"unsolvable.":[151]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}