{"id":"https://openalex.org/W2940731840","doi":"https://doi.org/10.1007/s10589-020-00240-9","title":"An interior point-proximal method of multipliers for convex quadratic programming","display_name":"An interior point-proximal method of multipliers for convex quadratic programming","publication_year":2020,"publication_date":"2020-11-09","ids":{"openalex":"https://openalex.org/W2940731840","doi":"https://doi.org/10.1007/s10589-020-00240-9","mag":"2940731840"},"language":"en","primary_location":{"id":"doi:10.1007/s10589-020-00240-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-020-00240-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-020-00240-9.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10589-020-00240-9.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Spyridon Pougkakiotis","orcid":"https://orcid.org/0000-0001-7903-9335"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Spyridon Pougkakiotis","raw_affiliation_strings":["University of Edinburgh, Edinburgh, UK"],"raw_orcid":"https://orcid.org/0000-0001-7903-9335","affiliations":[{"raw_affiliation_string":"University of Edinburgh, Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","author":{"id":null,"display_name":"Jacek Gondzio","orcid":null},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jacek Gondzio","raw_affiliation_strings":["University of Edinburgh, Edinburgh, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Edinburgh, Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":5.0248,"has_fulltext":true,"cited_by_count":26,"citation_normalized_percentile":{"value":0.96041667,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"78","issue":"2","first_page":"307","last_page":"351"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.46939998865127563,"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.46939998865127563,"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.4043999910354614,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.0835999995470047,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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-method","display_name":"Interior point method","score":0.777899980545044},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.6553000211715698},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5360999703407288},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.505299985408783},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.492900013923645},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.4918999969959259},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.47360000014305115},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.46320000290870667},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.43380001187324524},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.40450000762939453}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8064000010490417},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.777899980545044},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.6553000211715698},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5415999889373779},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5360999703407288},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.505299985408783},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.492900013923645},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.4918999969959259},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.47360000014305115},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.46320000290870667},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.43380001187324524},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.40450000762939453},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.40400001406669617},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4032000005245209},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.3797000050544739},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36079999804496765},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.34700000286102295},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3402999937534332},{"id":"https://openalex.org/C166437778","wikidata":"https://www.wikidata.org/wiki/Q50695","display_name":"Quadratic function","level":3,"score":0.3262999951839447},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.32010000944137573},{"id":"https://openalex.org/C60033838","wikidata":"https://www.wikidata.org/wiki/Q1751685","display_name":"Solution set","level":3,"score":0.31619998812675476},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3109999895095825},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.2992999851703644},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.2953999936580658},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.29319998621940613},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.29190000891685486},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2822999954223633},{"id":"https://openalex.org/C195064452","wikidata":"https://www.wikidata.org/wiki/Q2823740","display_name":"Active set method","level":4,"score":0.2784000039100647},{"id":"https://openalex.org/C39847760","wikidata":"https://www.wikidata.org/wiki/Q1385465","display_name":"Extreme point","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.26190000772476196},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.2540999948978424}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1007/s10589-020-00240-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-020-00240-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-020-00240-9.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},{"id":"pmh:oai:discovery.dundee.ac.uk:openaire/b93dfe5b-d4b1-4218-85de-83ebd6dadc25","is_oa":true,"landing_page_url":"https://discovery.dundee.ac.uk/en/publications/b93dfe5b-d4b1-4218-85de-83ebd6dadc25","pdf_url":null,"source":{"id":"https://openalex.org/S4306400523","display_name":"Discovery Research Portal (University of Dundee)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177639307","host_organization_name":"University of Dundee","host_organization_lineage":["https://openalex.org/I177639307"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Pougkakiotis, S & Gondzio, J 2021, 'An interior point-proximal method of multipliers for convex quadratic programming', Computational Optimization and Applications, vol. 78, no. 2, pp. 307-351. https://doi.org/10.1007/s10589-020-00240-9","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:kclpure.kcl.ac.uk:openaire/ef59521c-f67e-4f75-b5f7-0e7d74927a8f","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/ef59521c-f67e-4f75-b5f7-0e7d74927a8f","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Pougkakiotis, S & Gondzio, J 2021, 'An interior point-proximal method of multipliers for convex quadratic programming', COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, vol. 78, pp. 307-351. https://doi.org/10.1007/s10589-020-00240-9","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1904.10369","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1904.10369","pdf_url":"https://arxiv.org/pdf/1904.10369","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/d0f153c4-6e87-45ad-bc8c-e21011d68b72","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/d0f153c4-6e87-45ad-bc8c-e21011d68b72","pdf_url":"https://www.research.ed.ac.uk/files/174251471/ProxIPM_22oct20.pdf","source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Pougkakiotis, S & Gondzio, J 2021, 'An Interior Point-Proximal Method of Multipliers for Convex Quadratic Programming', Computational optimization and applications, vol. 78, pp. 307-351. https://doi.org/10.1007/s10589-020-00240-9","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:RePEc:spr:coopap:v:78:y:2021:i:2:d:10.1007_s10589-020-00240-9","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10589-020-00240-9","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:pure.ed.ac.uk:publications/d0f153c4-6e87-45ad-bc8c-e21011d68b72","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11820/d0f153c4-6e87-45ad-bc8c-e21011d68b72","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Pougkakiotis, S & Gondzio, J 2021, 'An Interior Point-Proximal Method of Multipliers for Convex Quadratic Programming', Computational optimization and applications, vol. 78, pp. 307-351. https://doi.org/10.1007/s10589-020-00240-9","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1007/s10589-020-00240-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-020-00240-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-020-00240-9.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2190093231","display_name":null,"funder_award_id":"EP/N019652/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3730638574","display_name":"Computational Design Optimization of Large-Scale Building Structures: Methods, Benchmarking & Applications","funder_award_id":"EP/N019652/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320320332","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90"},{"id":"https://openalex.org/F4320322381","display_name":"A.G. Leventis Foundation","ror":null},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2940731840.pdf","grobid_xml":"https://content.openalex.org/works/W2940731840.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W1237127655","https://openalex.org/W1518039036","https://openalex.org/W1632601927","https://openalex.org/W1992200282","https://openalex.org/W2004304255","https://openalex.org/W2006981104","https://openalex.org/W2009629085","https://openalex.org/W2033477411","https://openalex.org/W2037679050","https://openalex.org/W2038497950","https://openalex.org/W2043868859","https://openalex.org/W2044774602","https://openalex.org/W2049219350","https://openalex.org/W2050267927","https://openalex.org/W2057624533","https://openalex.org/W2068531154","https://openalex.org/W2069159962","https://openalex.org/W2075998338","https://openalex.org/W2085548605","https://openalex.org/W2086867325","https://openalex.org/W2089389443","https://openalex.org/W2103299621","https://openalex.org/W2112980792","https://openalex.org/W2114408464","https://openalex.org/W2135779729","https://openalex.org/W2149454052","https://openalex.org/W2583926461","https://openalex.org/W2802164368","https://openalex.org/W2897334136","https://openalex.org/W2914327614"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"In":[1,126],"this":[2,79,82,97],"paper":[3],"we":[4,67,84,129,172,205],"combine":[5],"an":[6,184,200],"infeasible":[7,185],"Interior":[8],"Point":[9],"Method":[10,15],"(IPM)":[11],"with":[12],"the":[13,44,52,62,69,89,99,114,123,134,142,146,152,168,174,177,211,235,245,248],"Proximal":[14],"of":[16,43,51,55,61,88,116,122,137,145,151,176,210,220,237,247],"Multipliers":[17],"(PMM).":[18],"The":[19,109,149,194,231],"resulting":[20],"algorithm":[21,110,213],"(IP-PMM)":[22],"is":[23,65,98,111,181,196],"interpreted":[24],"as":[25,139,141,242,244],"a":[26,58,73,105,117,189,207,218],"primal-dual":[27,106],"regularized":[28,107],"IPM,":[29,158],"suitable":[30],"for":[31,104,192],"solving":[32],"linearly":[33],"constrained":[34],"convex":[35,227],"quadratic":[36,228],"programming":[37,229],"problems.":[38,230],"We":[39],"apply":[40],"few":[41],"iterations":[42],"interior":[45],"point":[46],"method":[47,54,178],"to":[48,183,198,222],"each":[49],"sub-problem":[50,64],"proximal":[53],"multipliers.":[56],"Once":[57],"satisfactory":[59],"solution":[60],"PMM":[63,70,147],"found,":[66],"update":[68],"parameters,":[71],"form":[72],"new":[74],"IPM":[75],"neighbourhood":[76],"and":[77,159,163,187,214,226],"repeat":[78],"process.":[80],"Given":[81],"framework,":[83],"prove":[85],"polynomial":[86,101,135],"complexity":[87,102,136],"algorithm,":[90],"under":[91],"standard":[92],"assumptions.":[93],"To":[94],"our":[95],"knowledge,":[96],"first":[100],"result":[103],"IPM.":[108],"guided":[112],"by":[113,157],"use":[115],"single":[118],"penalty":[119,153],"parameter;":[120],"that":[121,131],"logarithmic":[124],"barrier.":[125],"other":[127],"words,":[128],"show":[130],"IP-PMM":[132],"inherits":[133],"IPMs,":[138],"well":[140,243],"strict":[143],"convexity":[144],"sub-problems.":[148],"updates":[150],"parameter":[154],"are":[155,161],"controlled":[156],"hence":[160],"well-tuned,":[162],"do":[164],"not":[165],"depend":[166],"on":[167],"problem":[169],"solved.":[170],"Furthermore,":[171],"study":[173],"behavior":[175],"when":[179],"it":[180,216],"applied":[182],"problem,":[186],"identify":[188],"necessary":[190],"condition":[191],"infeasibility.":[193],"latter":[195],"used":[197],"construct":[199],"infeasibility":[201],"detection":[202],"mechanism.":[203],"Subsequently,":[204],"provide":[206],"robust":[208],"implementation":[209],"presented":[212],"test":[215],"over":[217],"set":[219],"small":[221],"large":[223],"scale":[224],"linear":[225],"numerical":[232],"results":[233],"demonstrate":[234],"benefits":[236],"using":[238],"regularization":[239],"in":[240],"IPMs":[241],"reliability":[246],"method.":[249]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2019-05-03T00:00:00"}