{"id":"https://openalex.org/W3208007364","doi":"https://doi.org/10.1007/s10957-021-01954-4","title":"An Interior Point-Proximal Method of Multipliers for Linear Positive Semi-Definite Programming","display_name":"An Interior Point-Proximal Method of Multipliers for Linear Positive Semi-Definite Programming","publication_year":2021,"publication_date":"2021-10-28","ids":{"openalex":"https://openalex.org/W3208007364","doi":"https://doi.org/10.1007/s10957-021-01954-4","mag":"3208007364"},"language":"en","primary_location":{"id":"doi:10.1007/s10957-021-01954-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10957-021-01954-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10957-021-01954-4.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-021-01954-4.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017796051","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"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033855320","display_name":"Jacek Gondzio","orcid":"https://orcid.org/0000-0002-6270-4666"},"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"],"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":["https://openalex.org/A5017796051"],"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":2.7975,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.90035907,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"192","issue":"1","first_page":"97","last_page":"129"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9973000288009644,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9883999824523926,"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.8524321913719177},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7674026489257812},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6336201429367065},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5869277715682983},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.5858619213104248},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48009541630744934},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.4150935709476471},{"id":"https://openalex.org/keywords/positive-definite-matrix","display_name":"Positive-definite matrix","score":0.41337841749191284},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3956720232963562},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33563321828842163},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.17274129390716553},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.06774887442588806}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.8524321913719177},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7674026489257812},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6336201429367065},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5869277715682983},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.5858619213104248},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48009541630744934},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.4150935709476471},{"id":"https://openalex.org/C49712288","wikidata":"https://www.wikidata.org/wiki/Q77601250","display_name":"Positive-definite matrix","level":3,"score":0.41337841749191284},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3956720232963562},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33563321828842163},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.17274129390716553},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.06774887442588806},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/s10957-021-01954-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10957-021-01954-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10957-021-01954-4.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/49b4fe0e-e87c-447d-9297-1d7065bfcb3c","is_oa":true,"landing_page_url":"https://discovery.dundee.ac.uk/en/publications/49b4fe0e-e87c-447d-9297-1d7065bfcb3c","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 2022, 'An interior point-proximal method of multipliers for linear positive semi-definite programming', Journal of Optimization Theory and Applications, vol. 192, no. 1, pp. 97-129. https://doi.org/10.1007/s10957-021-01954-4","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:kclpure.kcl.ac.uk:openaire/95c3b4e6-e624-40ae-9d7e-32225f5c34c5","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/95c3b4e6-e624-40ae-9d7e-32225f5c34c5","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 2022, 'An Interior Point-Proximal Method of Multipliers for Linear Positive Semi-Definite Programming', Journal of Optimization Theory and Applications, vol. 192, pp. 97-129. https://doi.org/10.1007/s10957-021-01954-4","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/588fd834-a782-44bd-a967-c24390b5a0b9","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/588fd834-a782-44bd-a967-c24390b5a0b9","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":"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 2022, 'An Interior Point-Proximal Method of Multipliers for Linear Positive Semi-Definite Programming', Journal of Optimization Theory and Applications, vol. 192, pp. 97-129. https://doi.org/10.1007/s10957-021-01954-4","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:2010.14285","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2010.14285","pdf_url":"https://arxiv.org/pdf/2010.14285","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":"","raw_type":"text"},{"id":"pmh:oai:RePEc:spr:joptap:v:192:y:2022:i:1:d:10.1007_s10957-021-01954-4","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10957-021-01954-4","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"}],"best_oa_location":{"id":"doi:10.1007/s10957-021-01954-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10957-021-01954-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10957-021-01954-4.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":[{"score":0.6499999761581421,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3208007364.pdf","grobid_xml":"https://content.openalex.org/works/W3208007364.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W4701811","https://openalex.org/W55017993","https://openalex.org/W135900567","https://openalex.org/W1237127655","https://openalex.org/W1632601927","https://openalex.org/W1985984741","https://openalex.org/W1989395545","https://openalex.org/W1996395235","https://openalex.org/W2038497950","https://openalex.org/W2049219350","https://openalex.org/W2064301532","https://openalex.org/W2069159962","https://openalex.org/W2080605902","https://openalex.org/W2089105401","https://openalex.org/W2099799470","https://openalex.org/W2135779729","https://openalex.org/W2141380252","https://openalex.org/W2495457432","https://openalex.org/W2531901171","https://openalex.org/W2799810553","https://openalex.org/W2914327614","https://openalex.org/W2940731840","https://openalex.org/W2947372223","https://openalex.org/W2963029052","https://openalex.org/W2973058629","https://openalex.org/W2995987820","https://openalex.org/W3100929843","https://openalex.org/W3104106909","https://openalex.org/W3133669662","https://openalex.org/W3154076173","https://openalex.org/W3179669931","https://openalex.org/W3205470900","https://openalex.org/W4249667877"],"related_works":["https://openalex.org/W4378529241","https://openalex.org/W2362838148","https://openalex.org/W2323830966","https://openalex.org/W188032563","https://openalex.org/W2359279826","https://openalex.org/W2361901126","https://openalex.org/W2387523877","https://openalex.org/W2029931673","https://openalex.org/W2384106618","https://openalex.org/W2962885385"],"abstract_inverted_index":{"Abstract":[0],"In":[1,45],"this":[2,109,112],"paper":[3],"we":[4,47,114],"generalize":[5],"the":[6,26,38,41,56,64,88,99,119,130],"Interior":[7,51],"Point-Proximal":[8],"Method":[9,53,58],"of":[10,28,40,59,81,87,118,141],"Multipliers":[11,60],"(IP-PMM)":[12,66],"presented":[13],"in":[14,37],"Pougkakiotis":[15],"and":[16,62,107,124],"Gondzio":[17],"(Comput":[18],"Optim":[19],"Appl":[20],"78:307\u2013351,":[21],"2021.":[22],"10.1007/s10589-020-00240-9":[23],")":[24],"for":[25,73,129,139,151,155],"solution":[27,39,93],"linear":[29],"positive":[30],"Semi-Definite":[31],"Programming":[32],"(SDP)":[33],"problems,":[34],"allowing":[35],"inexactness":[36],"associated":[42],"Newton":[43,131],"systems.":[44],"particular,":[46],"combine":[48],"an":[49,82],"infeasible":[50],"Point":[52],"(IPM)":[54],"with":[55],"Proximal":[57],"(PMM)":[61],"interpret":[63],"algorithm":[65],"as":[67,148],"a":[68,91,103,136,149],"primal-dual":[69],"regularized":[70],"IPM,":[71],"suitable":[72],"solving":[74],"SDP":[75],"problems.":[76],"We":[77,96,133],"apply":[78],"some":[79],"iterations":[80],"IPM":[83,105],"to":[84],"each":[85],"sub-problem":[86],"PMM":[89,100],"until":[90],"satisfactory":[92],"is":[94],"found.":[95],"then":[97],"update":[98],"parameters,":[101],"form":[102],"new":[104],"neighbourhood,":[106],"repeat":[108],"process.":[110],"Given":[111],"framework,":[113],"prove":[115],"polynomial":[116],"complexity":[117],"algorithm,":[120],"under":[121],"mild":[122],"assumptions,":[123],"without":[125],"requiring":[126],"exact":[127],"computations":[128],"directions.":[132],"furthermore":[134],"provide":[135],"necessary":[137],"condition":[138],"lack":[140],"strong":[142],"duality,":[143],"which":[144],"can":[145],"be":[146],"used":[147],"basis":[150],"constructing":[152],"detection":[153],"mechanisms":[154],"identifying":[156],"pathological":[157],"cases":[158],"within":[159],"IP-PMM.":[160]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2022-07-25T00:00:00"}