{"id":"https://openalex.org/W2914327614","doi":"https://doi.org/10.1007/s10957-019-01491-1","title":"Dynamic Non-diagonal Regularization in Interior Point Methods for Linear and Convex Quadratic Programming","display_name":"Dynamic Non-diagonal Regularization in Interior Point Methods for Linear and Convex Quadratic Programming","publication_year":2019,"publication_date":"2019-02-26","ids":{"openalex":"https://openalex.org/W2914327614","doi":"https://doi.org/10.1007/s10957-019-01491-1","mag":"2914327614"},"language":"en","primary_location":{"id":"doi:10.1007/s10957-019-01491-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10957-019-01491-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10957-019-01491-1.pdf","source":{"id":"https://openalex.org/S52430896","display_name":"Journal of Optimization Theory and Applications","issn_l":"0022-3239","issn":["0022-3239","1573-2878"],"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":"Journal of Optimization Theory 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/s10957-019-01491-1.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":["School of Mathematics, University of Edinburgh, Edinburgh, UK"],"affiliations":[{"raw_affiliation_string":"School of Mathematics, 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":["School of Mathematics, University of Edinburgh, Edinburgh, UK"],"affiliations":[{"raw_affiliation_string":"School of Mathematics, 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":3.246,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.91722543,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"181","issue":"3","first_page":"905","last_page":"945"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.5722000002861023,"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.5722000002861023,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.31859999895095825,"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"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.03359999880194664,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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.7603999972343445},{"id":"https://openalex.org/keywords/regularization","display_name":"Regularization (linguistics)","score":0.6692000031471252},{"id":"https://openalex.org/keywords/proximal-gradient-methods-for-learning","display_name":"Proximal gradient methods for learning","score":0.6450999975204468},{"id":"https://openalex.org/keywords/regularization-perspectives-on-support-vector-machines","display_name":"Regularization perspectives on support vector machines","score":0.5882999897003174},{"id":"https://openalex.org/keywords/backus\u2013gilbert-method","display_name":"Backus\u2013Gilbert method","score":0.5533000230789185},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.5349000096321106},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4447000026702881},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.43639999628067017},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.42800000309944153}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.7603999972343445},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7407000064849854},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.6692000031471252},{"id":"https://openalex.org/C79248915","wikidata":"https://www.wikidata.org/wiki/Q17086776","display_name":"Proximal gradient methods for learning","level":5,"score":0.6450999975204468},{"id":"https://openalex.org/C141718189","wikidata":"https://www.wikidata.org/wiki/Q7309628","display_name":"Regularization perspectives on support vector machines","level":4,"score":0.5882999897003174},{"id":"https://openalex.org/C27872270","wikidata":"https://www.wikidata.org/wiki/Q4839810","display_name":"Backus\u2013Gilbert method","level":5,"score":0.5533000230789185},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.5349000096321106},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5060999989509583},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4447000026702881},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.43639999628067017},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.42800000309944153},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4097999930381775},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.40610000491142273},{"id":"https://openalex.org/C177918212","wikidata":"https://www.wikidata.org/wiki/Q803623","display_name":"Perturbation (astronomy)","level":2,"score":0.39089998602867126},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3815999925136566},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3691999912261963},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.362199991941452},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.33730000257492065},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.31290000677108765},{"id":"https://openalex.org/C139352143","wikidata":"https://www.wikidata.org/wiki/Q82571","display_name":"Linear algebra","level":2,"score":0.3005000054836273},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2903999984264374},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.2897000014781952},{"id":"https://openalex.org/C63548660","wikidata":"https://www.wikidata.org/wiki/Q858223","display_name":"Limit point","level":2,"score":0.2854999899864197},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.2840000092983246},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.2833999991416931},{"id":"https://openalex.org/C84545080","wikidata":"https://www.wikidata.org/wiki/Q1147936","display_name":"Condition number","level":3,"score":0.28279998898506165},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.2777999937534332},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.2709999978542328},{"id":"https://openalex.org/C163834973","wikidata":"https://www.wikidata.org/wiki/Q2004891","display_name":"Numerical linear algebra","level":3,"score":0.262800008058548},{"id":"https://openalex.org/C60866291","wikidata":"https://www.wikidata.org/wiki/Q5140577","display_name":"Coefficient matrix","level":3,"score":0.25920000672340393}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1007/s10957-019-01491-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10957-019-01491-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10957-019-01491-1.pdf","source":{"id":"https://openalex.org/S52430896","display_name":"Journal of Optimization Theory and Applications","issn_l":"0022-3239","issn":["0022-3239","1573-2878"],"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":"Journal of Optimization Theory and Applications","raw_type":"journal-article"},{"id":"pmh:oai:discovery.dundee.ac.uk:openaire/6f391afc-8210-4856-905f-3759e153fbd7","is_oa":true,"landing_page_url":"https://discovery.dundee.ac.uk/en/publications/6f391afc-8210-4856-905f-3759e153fbd7","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 2019, 'Dynamic Non-diagonal Regularization in Interior Point Methods for Linear and Convex Quadratic Programming', Journal of Optimization Theory and Applications, vol. 181, no. 3, pp. 905-945. https://doi.org/10.1007/s10957-019-01491-1","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:kclpure.kcl.ac.uk:openaire/99ecb1d1-2bc0-4a5f-80ab-20f86eaef3a4","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/99ecb1d1-2bc0-4a5f-80ab-20f86eaef3a4","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 2019, 'Dynamic Non-diagonal Regularization in Interior Point Methods for Linear and Convex Quadratic Programming', Journal of Optimization Theory and Applications, vol. 181, pp. 905-945. https://doi.org/10.1007/s10957-019-01491-1","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/03623f03-7938-4e00-8d16-b25b3b247bc6","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/03623f03-7938-4e00-8d16-b25b3b247bc6","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Pougkakiotis, S & Gondzio, J 2019, 'Dynamic Non-Diagonal Regularization in Interior Point Methods for Linear and Convex Quadratic Programming', Journal of Optimization Theory and Applications, vol. 181, no. 3, pp. 905-945. https://doi.org/10.1007/s10957-019-01491-1","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1902.04834","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1902.04834","pdf_url":"https://arxiv.org/pdf/1902.04834","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:RePEc:spr:joptap:v:181:y:2019:i:3:d:10.1007_s10957-019-01491-1","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10957-019-01491-1","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:kclpure.kcl.ac.uk:publications/99ecb1d1-2bc0-4a5f-80ab-20f86eaef3a4","is_oa":true,"landing_page_url":"https://link.springer.com/article/10.1007/s10957-019-01491-1","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Pougkakiotis, S & Gondzio, J 2019, 'Dynamic Non-diagonal Regularization in Interior Point Methods for Linear and Convex Quadratic Programming', Journal of Optimization Theory and Applications, vol. 181, pp. 905-945. https://doi.org/10.1007/s10957-019-01491-1","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.ed.ac.uk:publications/03623f03-7938-4e00-8d16-b25b3b247bc6","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/portal/en/publications/dynamic-nondiagonal-regularization-in-interior-point-methods-for-linear-and-convex-quadratic-programming(03623f03-7938-4e00-8d16-b25b3b247bc6).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"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 2019, 'Dynamic Non-Diagonal Regularization in Interior Point Methods for Linear and Convex Quadratic Programming', Journal of Optimization Theory and Applications, vol. 181, no. 3, pp. 905-945. https://doi.org/10.1007/s10957-019-01491-1","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1007/s10957-019-01491-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10957-019-01491-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10957-019-01491-1.pdf","source":{"id":"https://openalex.org/S52430896","display_name":"Journal of Optimization Theory and Applications","issn_l":"0022-3239","issn":["0022-3239","1573-2878"],"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":"Journal of Optimization Theory and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2914327614.pdf","grobid_xml":"https://content.openalex.org/works/W2914327614.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1573409602","https://openalex.org/W1979304280","https://openalex.org/W1999331305","https://openalex.org/W2004304255","https://openalex.org/W2006981104","https://openalex.org/W2009629085","https://openalex.org/W2026073821","https://openalex.org/W2033477411","https://openalex.org/W2034835449","https://openalex.org/W2037679050","https://openalex.org/W2049219350","https://openalex.org/W2050897335","https://openalex.org/W2068531154","https://openalex.org/W2069159962","https://openalex.org/W2075998338","https://openalex.org/W2085581918","https://openalex.org/W2086867325","https://openalex.org/W2092554297","https://openalex.org/W2135779729","https://openalex.org/W2149454052","https://openalex.org/W2164362618","https://openalex.org/W2583926461","https://openalex.org/W2802164368"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1,17],"paper,":[2],"we":[3,173],"present":[4,36],"a":[5,55,104],"dynamic":[6],"non-diagonal":[7,14],"regularization":[8,18,28,56,87,109,137],"for":[9,97,106,154],"interior":[10,79],"point":[11,80],"methods.":[12],"The":[13,60],"aspect":[15],"of":[16,26,50,69,77,115,123,134,157,168,177],"is":[19,63,142],"implicit,":[20],"since":[21],"all":[22],"the":[23,27,38,48,51,66,70,78,83,86,92,108,113,116,124,132,143,148,155,158,165,169,175,178],"off-diagonal":[24],"elements":[25,35],"matrices":[29,88],"are":[30,127],"cancelled":[31],"out":[32],"by":[33],"those":[34],"in":[37,47,147],"Newton":[39,52,71],"system,":[40,95],"which":[41,141],"do":[42],"not":[43],"contribute":[44],"important":[45],"information":[46],"computation":[49],"direction.":[53],"Such":[54],"has":[57],"multiple":[58],"goals.":[59],"obvious":[61],"one":[62],"to":[64,91,181],"improve":[65],"spectral":[67,166],"properties":[68,114,167],"system":[72,126,160],"solved":[73],"at":[74],"each":[75],"iteration":[76],"method.":[81],"On":[82],"other":[84],"hand,":[85],"introduce":[89],"sparsity":[90],"aforementioned":[93],"linear":[94,187],"allowing":[96],"more":[98],"efficient":[99],"factorizations.":[100],"We":[101,150],"also":[102],"propose":[103],"rule":[105],"tuning":[107],"dynamically":[110],"based":[111],"on":[112],"problem,":[117],"such":[118],"that":[119],"sufficiently":[120],"large":[121],"eigenvalues":[122,156],"non-regularized":[125,159],"perturbed":[128],"insignificantly.":[129],"This":[130],"alleviates":[131],"need":[133],"finding":[135],"specific":[136],"values":[138],"through":[139],"experimentation,":[140],"most":[144],"common":[145],"approach":[146],"literature.":[149],"provide":[151],"perturbation":[152],"bounds":[153],"matrix":[161],"and":[162,185,188],"then":[163],"discuss":[164],"regularized":[170],"matrix.":[171],"Finally,":[172],"demonstrate":[174],"efficiency":[176],"method":[179],"applied":[180],"solve":[182],"standard":[183],"small-":[184],"medium-scale":[186],"convex":[189],"quadratic":[190],"programming":[191],"test":[192],"problems.":[193]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2019-02-21T00:00:00"}