{"id":"https://openalex.org/W4304893021","doi":"https://doi.org/10.1080/10556788.2022.2117356","title":"Linear programming with nonparametric penalty programs and iterated thresholding","display_name":"Linear programming with nonparametric penalty programs and iterated thresholding","publication_year":2022,"publication_date":"2022-10-13","ids":{"openalex":"https://openalex.org/W4304893021","doi":"https://doi.org/10.1080/10556788.2022.2117356"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2022.2117356","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2022.2117356","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"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":"Optimization Methods and Software","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/A5106277659","display_name":"Jeffery Kline","orcid":null},"institutions":[{"id":"https://openalex.org/I4210139783","display_name":"University of Wisconsin American Family Children's Hospital","ror":"https://ror.org/04mrdd905","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I4210139783"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jeffery Kline","raw_affiliation_strings":["American Family Insurance, Madison, WI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"American Family Insurance, Madison, WI, USA","institution_ids":["https://openalex.org/I4210139783"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111408590","display_name":"Glenn Fung","orcid":null},"institutions":[{"id":"https://openalex.org/I4210139783","display_name":"University of Wisconsin American Family Children's Hospital","ror":"https://ror.org/04mrdd905","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I4210139783"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Glenn Martin Fung","raw_affiliation_strings":["American Family Insurance, Madison, WI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"American Family Insurance, Madison, WI, USA","institution_ids":["https://openalex.org/I4210139783"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5106277659"],"corresponding_institution_ids":["https://openalex.org/I4210139783"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14155669,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"38","issue":"1","first_page":"107","last_page":"127"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9998000264167786,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.9445000290870667,"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/linear-programming","display_name":"Linear programming","score":0.6860424876213074},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6600720286369324},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.6479542255401611},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6081793904304504},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5975682139396667},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5846665501594543},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.5232576131820679},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.4605061411857605},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.45652806758880615},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.45381778478622437},{"id":"https://openalex.org/keywords/limit-point","display_name":"Limit point","score":0.4391198754310608},{"id":"https://openalex.org/keywords/linear-fractional-programming","display_name":"Linear-fractional programming","score":0.4347776770591736},{"id":"https://openalex.org/keywords/fixed-point","display_name":"Fixed point","score":0.4196551740169525},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4170331358909607},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.39417749643325806},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35176563262939453},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07970786094665527}],"concepts":[{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6860424876213074},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6600720286369324},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6479542255401611},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6081793904304504},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5975682139396667},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5846665501594543},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.5232576131820679},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.4605061411857605},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.45652806758880615},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.45381778478622437},{"id":"https://openalex.org/C63548660","wikidata":"https://www.wikidata.org/wiki/Q858223","display_name":"Limit point","level":2,"score":0.4391198754310608},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.4347776770591736},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.4196551740169525},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4170331358909607},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.39417749643325806},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35176563262939453},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07970786094665527},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2022.2117356","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2022.2117356","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"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":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W79588614","https://openalex.org/W198845011","https://openalex.org/W1969117912","https://openalex.org/W1985514811","https://openalex.org/W2001048563","https://openalex.org/W2003211636","https://openalex.org/W2006431173","https://openalex.org/W2008181411","https://openalex.org/W2008590178","https://openalex.org/W2012465196","https://openalex.org/W2018135538","https://openalex.org/W2022922836","https://openalex.org/W2033477411","https://openalex.org/W2043819123","https://openalex.org/W2047828698","https://openalex.org/W2053487511","https://openalex.org/W2053661713","https://openalex.org/W2059448930","https://openalex.org/W2079589506","https://openalex.org/W2092554297","https://openalex.org/W2115706991","https://openalex.org/W2129516068","https://openalex.org/W2162988958","https://openalex.org/W2605355993","https://openalex.org/W2769646558","https://openalex.org/W3035965352","https://openalex.org/W3099878876","https://openalex.org/W3101798601"],"related_works":["https://openalex.org/W1970914972","https://openalex.org/W2006148793","https://openalex.org/W2175677697","https://openalex.org/W2912146214","https://openalex.org/W2145479420","https://openalex.org/W2068533472","https://openalex.org/W1500017135","https://openalex.org/W2058386658","https://openalex.org/W2002561307","https://openalex.org/W3015765855"],"abstract_inverted_index":{"It":[0],"is":[1,36,44,57,152],"known":[2],"[Mangasarian,":[3],"A":[4],"Newton":[5],"method":[6,125],"for":[7,139],"linear":[8,20,50,73,163],"programming,":[9],"J.":[10],"Optim.":[11],"Theory":[12],"Appl.":[13],"121":[14],"(2004),":[15],"pp.":[16],"1\u201318]":[17],"that":[18,71,110,122,138],"every":[19,72,140],"program":[21,35,51,74,133,151],"can":[22,75,126],"be":[23,76],"solved":[24,77],"exactly":[25],"by":[26,38,146],"minimizing":[27],"an":[28,106],"unconstrained":[29],"quadratic":[30,93,132],"penalty":[31,34,84,94,150],"program.":[32,85,164],"The":[33],"parameterized":[37,149],"a":[39,61,82,113,128,148],"scalar":[40],"t>0,":[41],"and":[42],"one":[43,144],"able":[45],"to":[46,81,91,105,112,154],"solve":[47],"the":[48,79,89,92,142,157,161],"original":[49,162],"in":[52,119,156],"this":[53,67,123],"manner":[54],"when":[55],"t":[56],"selected":[58],"larger":[59],"than":[60],"finite,":[62],"but":[63],"unknown":[64],"t0>0.":[65],"In":[66],"paper,":[68],"we":[69,136],"show":[70,118,137],"using":[78,96],"solution":[80,143],"parameter-free":[83],"We":[86,117],"also":[87],"characterize":[88],"solutions":[90],"programs":[95],"fixed":[97],"points":[98],"of":[99,130,160],"certain":[100],"nonexpansive":[101],"maps.":[102],"This":[103],"leads":[104],"iterative":[107,124],"thresholding":[108],"algorithm":[109],"converges":[111],"desired":[114],"limit":[115],"point.":[116],"numerical":[120],"experiments":[121],"outperform":[127],"variety":[129],"standard":[131],"solvers.":[134],"Finally,":[135],"t\u2208R,":[141],"obtains":[145],"solving":[147],"guaranteed":[153],"lie":[155],"feasible":[158],"set":[159]},"counts_by_year":[],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}