{"id":"https://openalex.org/W2140041377","doi":"https://doi.org/10.1007/s12532-013-0061-8","title":"Block splitting for distributed optimization","display_name":"Block splitting for distributed optimization","publication_year":2013,"publication_date":"2013-10-26","ids":{"openalex":"https://openalex.org/W2140041377","doi":"https://doi.org/10.1007/s12532-013-0061-8","mag":"2140041377"},"language":"en","primary_location":{"id":"doi:10.1007/s12532-013-0061-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12532-013-0061-8","pdf_url":null,"source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming Computation","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/A5076583746","display_name":"Neal Parikh","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Neal Parikh","raw_affiliation_strings":["Department of Computer Science, Stanford University, Stanford, CA, 94305, USA","Stanford University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stanford University, Stanford, CA, 94305, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041065841","display_name":"S. T. P. Boyd","orcid":"https://orcid.org/0000-0003-1526-3690"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stephen Boyd","raw_affiliation_strings":["Department of Electrical Engineering, Stanford University, Stanford, CA, 94305, USA","Stanford University"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Stanford University, Stanford, CA, 94305, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5076583746"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":{"value":2390,"currency":"EUR","value_usd":3090},"apc_paid":null,"fwci":14.7982,"has_fulltext":false,"cited_by_count":121,"citation_normalized_percentile":{"value":0.99423454,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"6","issue":"1","first_page":"77","last_page":"102"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9988999962806702,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9983000159263611,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49205678701400757},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4747900366783142},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.461130291223526},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4321637749671936},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42560291290283203},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41813924908638},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.41281864047050476},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39323097467422485},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39300981163978577},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.30333444476127625}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49205678701400757},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4747900366783142},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.461130291223526},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4321637749671936},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42560291290283203},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41813924908638},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.41281864047050476},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39323097467422485},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39300981163978577},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.30333444476127625},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s12532-013-0061-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12532-013-0061-8","pdf_url":null,"source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming Computation","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.398.8056","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.398.8056","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://stanford.edu/~boyd/papers/pdf/block_splitting.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.474.2777","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.474.2777","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://stanford.edu/~boyd/papers/pdf/block_splitting.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W40680864","https://openalex.org/W1520511539","https://openalex.org/W1534416612","https://openalex.org/W1568307856","https://openalex.org/W1632601927","https://openalex.org/W1966287322","https://openalex.org/W1967073510","https://openalex.org/W1981220107","https://openalex.org/W1988201922","https://openalex.org/W1999913571","https://openalex.org/W2014730252","https://openalex.org/W2033806488","https://openalex.org/W2049064539","https://openalex.org/W2065030431","https://openalex.org/W2074093855","https://openalex.org/W2075998338","https://openalex.org/W2089099677","https://openalex.org/W2118237987","https://openalex.org/W2135046866","https://openalex.org/W2135653967","https://openalex.org/W2138019504","https://openalex.org/W2142333440","https://openalex.org/W2143552821","https://openalex.org/W2157462866","https://openalex.org/W2164278908","https://openalex.org/W2296319761","https://openalex.org/W2765202580","https://openalex.org/W2913535645","https://openalex.org/W2949483514","https://openalex.org/W3136479147","https://openalex.org/W4233534941","https://openalex.org/W4250589301","https://openalex.org/W4292363360","https://openalex.org/W6600689414","https://openalex.org/W6602568893","https://openalex.org/W6604796190"],"related_works":["https://openalex.org/W245862691","https://openalex.org/W3153752017","https://openalex.org/W2756132392","https://openalex.org/W3035814349","https://openalex.org/W4285101096","https://openalex.org/W4382725876","https://openalex.org/W2084892497","https://openalex.org/W2115614142","https://openalex.org/W4320477335","https://openalex.org/W1561889708"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":13},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":18},{"year":2016,"cited_by_count":17},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}