Convergence of Linear Bregman ADMM for Nonconvex and Nonsmooth Problems with Nonseparable Structure Article Swipe
YOU?
·
· 2020
· Open Access
·
· DOI: https://doi.org/10.1155/2020/6237942
The alternating direction method of multipliers (ADMM) is an effective method for solving two-block separable convex problems and its convergence is well understood. When either the involved number of blocks is more than two, or there is a nonconvex function, or there is a nonseparable structure, ADMM or its directly extend version may not converge. In this paper, we proposed an ADMM-based algorithm for nonconvex multiblock optimization problems with a nonseparable structure. We show that any cluster point of the iterative sequence generated by the proposed algorithm is a critical point, under mild condition. Furthermore, we establish the strong convergence of the whole sequence, under the condition that the potential function satisfies the Kurdyka–Łojasiewicz property. This provides the theoretical basis for the application of the proposed ADMM in the practice. Finally, we give some preliminary numerical results to show the effectiveness of the proposed algorithm.
Related Topics
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.1155/2020/6237942
- https://downloads.hindawi.com/journals/complexity/2020/6237942.pdf
- OA Status
- gold
- Cited By
- 10
- References
- 21
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W3008071309
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W3008071309Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1155/2020/6237942Digital Object Identifier
- Title
-
Convergence of Linear Bregman ADMM for Nonconvex and Nonsmooth Problems with Nonseparable StructureWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2020Year of publication
- Publication date
-
2020-02-26Full publication date if available
- Authors
-
Miantao Chao, Zhao Deng, Jinbao JianList of authors in order
- Landing page
-
https://doi.org/10.1155/2020/6237942Publisher landing page
- PDF URL
-
https://downloads.hindawi.com/journals/complexity/2020/6237942.pdfDirect link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
goldOpen access status per OpenAlex
- OA URL
-
https://downloads.hindawi.com/journals/complexity/2020/6237942.pdfDirect OA link when available
- Concepts
-
Separable space, Convergence (economics), Sequence (biology), Mathematical optimization, Mathematics, Function (biology), Regular polygon, Convex function, Optimization problem, Computer science, Applied mathematics, Algorithm, Evolutionary biology, Genetics, Economics, Economic growth, Mathematical analysis, Biology, GeometryTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
10Total citation count in OpenAlex
- Citations by year (recent)
-
2025: 4, 2024: 2, 2023: 2, 2022: 2Per-year citation counts (last 5 years)
- References (count)
-
21Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W3008071309 |
|---|---|
| doi | https://doi.org/10.1155/2020/6237942 |
| ids.doi | https://doi.org/10.1155/2020/6237942 |
| ids.mag | 3008071309 |
| ids.openalex | https://openalex.org/W3008071309 |
| fwci | 0.74689152 |
| type | article |
| title | Convergence of Linear Bregman ADMM for Nonconvex and Nonsmooth Problems with Nonseparable Structure |
| biblio.issue | |
| biblio.volume | 2020 |
| biblio.last_page | 14 |
| biblio.first_page | 1 |
| grants[0].funder | https://openalex.org/F4320321001 |
| grants[0].award_id | 11601095 |
| grants[0].funder_display_name | National Natural Science Foundation of China |
| grants[1].funder | https://openalex.org/F4320321001 |
| grants[1].award_id | 11771383 |
| grants[1].funder_display_name | National Natural Science Foundation of China |
| grants[2].funder | https://openalex.org/F4320321001 |
| grants[2].award_id | 2016GXNSFBA380185 |
| grants[2].funder_display_name | National Natural Science Foundation of China |
| grants[3].funder | https://openalex.org/F4320321001 |
| grants[3].award_id | 2016GXNSFDA380019 |
| grants[3].funder_display_name | National Natural Science Foundation of China |
| topics[0].id | https://openalex.org/T10500 |
| topics[0].field.id | https://openalex.org/fields/22 |
| topics[0].field.display_name | Engineering |
| topics[0].score | 0.9977999925613403 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/2206 |
| topics[0].subfield.display_name | Computational Mechanics |
| topics[0].display_name | Sparse and Compressive Sensing Techniques |
| topics[1].id | https://openalex.org/T10534 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.9908000230789185 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2205 |
| topics[1].subfield.display_name | Civil and Structural Engineering |
| topics[1].display_name | Structural Health Monitoring Techniques |
| topics[2].id | https://openalex.org/T10931 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9818000197410583 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1711 |
| topics[2].subfield.display_name | Signal Processing |
| topics[2].display_name | Direction-of-Arrival Estimation Techniques |
| funders[0].id | https://openalex.org/F4320321001 |
| funders[0].ror | https://ror.org/01h0zpd94 |
| funders[0].display_name | National Natural Science Foundation of China |
| is_xpac | False |
| apc_list.value | 2300 |
| apc_list.currency | USD |
| apc_list.value_usd | 2300 |
| apc_paid.value | 2300 |
| apc_paid.currency | USD |
| apc_paid.value_usd | 2300 |
| concepts[0].id | https://openalex.org/C70710897 |
| concepts[0].level | 2 |
| concepts[0].score | 0.7162732481956482 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q680081 |
| concepts[0].display_name | Separable space |
| concepts[1].id | https://openalex.org/C2777303404 |
| concepts[1].level | 2 |
| concepts[1].score | 0.702176570892334 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q759757 |
| concepts[1].display_name | Convergence (economics) |
| concepts[2].id | https://openalex.org/C2778112365 |
| concepts[2].level | 2 |
| concepts[2].score | 0.6897537708282471 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q3511065 |
| concepts[2].display_name | Sequence (biology) |
| concepts[3].id | https://openalex.org/C126255220 |
| concepts[3].level | 1 |
| concepts[3].score | 0.550604522228241 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[3].display_name | Mathematical optimization |
| concepts[4].id | https://openalex.org/C33923547 |
| concepts[4].level | 0 |
| concepts[4].score | 0.5227482318878174 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[4].display_name | Mathematics |
| concepts[5].id | https://openalex.org/C14036430 |
| concepts[5].level | 2 |
| concepts[5].score | 0.5087681412696838 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q3736076 |
| concepts[5].display_name | Function (biology) |
| concepts[6].id | https://openalex.org/C112680207 |
| concepts[6].level | 2 |
| concepts[6].score | 0.4722142815589905 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q714886 |
| concepts[6].display_name | Regular polygon |
| concepts[7].id | https://openalex.org/C145446738 |
| concepts[7].level | 3 |
| concepts[7].score | 0.42435282468795776 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q319913 |
| concepts[7].display_name | Convex function |
| concepts[8].id | https://openalex.org/C137836250 |
| concepts[8].level | 2 |
| concepts[8].score | 0.41973042488098145 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q984063 |
| concepts[8].display_name | Optimization problem |
| concepts[9].id | https://openalex.org/C41008148 |
| concepts[9].level | 0 |
| concepts[9].score | 0.4116734266281128 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[9].display_name | Computer science |
| concepts[10].id | https://openalex.org/C28826006 |
| concepts[10].level | 1 |
| concepts[10].score | 0.3900440037250519 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q33521 |
| concepts[10].display_name | Applied mathematics |
| concepts[11].id | https://openalex.org/C11413529 |
| concepts[11].level | 1 |
| concepts[11].score | 0.3486230671405792 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[11].display_name | Algorithm |
| concepts[12].id | https://openalex.org/C78458016 |
| concepts[12].level | 1 |
| concepts[12].score | 0.0 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q840400 |
| concepts[12].display_name | Evolutionary biology |
| concepts[13].id | https://openalex.org/C54355233 |
| concepts[13].level | 1 |
| concepts[13].score | 0.0 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q7162 |
| concepts[13].display_name | Genetics |
| concepts[14].id | https://openalex.org/C162324750 |
| concepts[14].level | 0 |
| concepts[14].score | 0.0 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q8134 |
| concepts[14].display_name | Economics |
| concepts[15].id | https://openalex.org/C50522688 |
| concepts[15].level | 1 |
| concepts[15].score | 0.0 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q189833 |
| concepts[15].display_name | Economic growth |
| concepts[16].id | https://openalex.org/C134306372 |
| concepts[16].level | 1 |
| concepts[16].score | 0.0 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q7754 |
| concepts[16].display_name | Mathematical analysis |
| concepts[17].id | https://openalex.org/C86803240 |
| concepts[17].level | 0 |
| concepts[17].score | 0.0 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q420 |
| concepts[17].display_name | Biology |
| concepts[18].id | https://openalex.org/C2524010 |
| concepts[18].level | 1 |
| concepts[18].score | 0.0 |
| concepts[18].wikidata | https://www.wikidata.org/wiki/Q8087 |
| concepts[18].display_name | Geometry |
| keywords[0].id | https://openalex.org/keywords/separable-space |
| keywords[0].score | 0.7162732481956482 |
| keywords[0].display_name | Separable space |
| keywords[1].id | https://openalex.org/keywords/convergence |
| keywords[1].score | 0.702176570892334 |
| keywords[1].display_name | Convergence (economics) |
| keywords[2].id | https://openalex.org/keywords/sequence |
| keywords[2].score | 0.6897537708282471 |
| keywords[2].display_name | Sequence (biology) |
| keywords[3].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[3].score | 0.550604522228241 |
| keywords[3].display_name | Mathematical optimization |
| keywords[4].id | https://openalex.org/keywords/mathematics |
| keywords[4].score | 0.5227482318878174 |
| keywords[4].display_name | Mathematics |
| keywords[5].id | https://openalex.org/keywords/function |
| keywords[5].score | 0.5087681412696838 |
| keywords[5].display_name | Function (biology) |
| keywords[6].id | https://openalex.org/keywords/regular-polygon |
| keywords[6].score | 0.4722142815589905 |
| keywords[6].display_name | Regular polygon |
| keywords[7].id | https://openalex.org/keywords/convex-function |
| keywords[7].score | 0.42435282468795776 |
| keywords[7].display_name | Convex function |
| keywords[8].id | https://openalex.org/keywords/optimization-problem |
| keywords[8].score | 0.41973042488098145 |
| keywords[8].display_name | Optimization problem |
| keywords[9].id | https://openalex.org/keywords/computer-science |
| keywords[9].score | 0.4116734266281128 |
| keywords[9].display_name | Computer science |
| keywords[10].id | https://openalex.org/keywords/applied-mathematics |
| keywords[10].score | 0.3900440037250519 |
| keywords[10].display_name | Applied mathematics |
| keywords[11].id | https://openalex.org/keywords/algorithm |
| keywords[11].score | 0.3486230671405792 |
| keywords[11].display_name | Algorithm |
| language | en |
| locations[0].id | doi:10.1155/2020/6237942 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S207319443 |
| locations[0].source.issn | 1076-2787, 1099-0526 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 1076-2787 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | True |
| locations[0].source.display_name | Complexity |
| locations[0].source.host_organization | https://openalex.org/P4310319869 |
| locations[0].source.host_organization_name | Hindawi Publishing Corporation |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310319869 |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://downloads.hindawi.com/journals/complexity/2020/6237942.pdf |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Complexity |
| locations[0].landing_page_url | https://doi.org/10.1155/2020/6237942 |
| locations[1].id | pmh:oai:doaj.org/article:2c2609ed91854bd58b47f34f96bb8f9a |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306401280 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | False |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | DOAJ (DOAJ: Directory of Open Access Journals) |
| locations[1].source.host_organization | |
| locations[1].source.host_organization_name | |
| locations[1].source.host_organization_lineage | |
| locations[1].license | cc-by-sa |
| locations[1].pdf_url | |
| locations[1].version | submittedVersion |
| locations[1].raw_type | article |
| locations[1].license_id | https://openalex.org/licenses/cc-by-sa |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | Complexity, Vol 2020 (2020) |
| locations[1].landing_page_url | https://doaj.org/article/2c2609ed91854bd58b47f34f96bb8f9a |
| indexed_in | crossref, doaj |
| authorships[0].author.id | https://openalex.org/A5048562330 |
| authorships[0].author.orcid | https://orcid.org/0000-0003-4763-9533 |
| authorships[0].author.display_name | Miantao Chao |
| authorships[0].countries | CN |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I150807315 |
| authorships[0].affiliations[0].raw_affiliation_string | Department of Mathematics, Guangxi University, Nanning 530004, China |
| authorships[0].institutions[0].id | https://openalex.org/I150807315 |
| authorships[0].institutions[0].ror | https://ror.org/02c9qn167 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I150807315 |
| authorships[0].institutions[0].country_code | CN |
| authorships[0].institutions[0].display_name | Guangxi University |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Miantao Chao |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Department of Mathematics, Guangxi University, Nanning 530004, China |
| authorships[1].author.id | https://openalex.org/A5019052672 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-7268-9260 |
| authorships[1].author.display_name | Zhao Deng |
| authorships[1].countries | CN |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I150807315 |
| authorships[1].affiliations[0].raw_affiliation_string | Department of Mathematics, Guangxi University, Nanning 530004, China |
| authorships[1].institutions[0].id | https://openalex.org/I150807315 |
| authorships[1].institutions[0].ror | https://ror.org/02c9qn167 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I150807315 |
| authorships[1].institutions[0].country_code | CN |
| authorships[1].institutions[0].display_name | Guangxi University |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Zhao Deng |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Department of Mathematics, Guangxi University, Nanning 530004, China |
| authorships[2].author.id | https://openalex.org/A5066627199 |
| authorships[2].author.orcid | https://orcid.org/0000-0001-8048-7397 |
| authorships[2].author.display_name | Jinbao Jian |
| authorships[2].countries | CN |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I167274908 |
| authorships[2].affiliations[0].raw_affiliation_string | Guangxi University for Nationalities, Nanning, China |
| authorships[2].institutions[0].id | https://openalex.org/I167274908 |
| authorships[2].institutions[0].ror | https://ror.org/0495efn48 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I167274908 |
| authorships[2].institutions[0].country_code | CN |
| authorships[2].institutions[0].display_name | Guangxi University for Nationalities |
| authorships[2].author_position | last |
| authorships[2].raw_author_name | Jinbao Jian |
| authorships[2].is_corresponding | True |
| authorships[2].raw_affiliation_strings | Guangxi University for Nationalities, Nanning, China |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://downloads.hindawi.com/journals/complexity/2020/6237942.pdf |
| open_access.oa_status | gold |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Convergence of Linear Bregman ADMM for Nonconvex and Nonsmooth Problems with Nonseparable Structure |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10500 |
| primary_topic.field.id | https://openalex.org/fields/22 |
| primary_topic.field.display_name | Engineering |
| primary_topic.score | 0.9977999925613403 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/2206 |
| primary_topic.subfield.display_name | Computational Mechanics |
| primary_topic.display_name | Sparse and Compressive Sensing Techniques |
| related_works | https://openalex.org/W2009525028, https://openalex.org/W4321064619, https://openalex.org/W2076561698, https://openalex.org/W2053599029, https://openalex.org/W3011179836, https://openalex.org/W2962925412, https://openalex.org/W2023672523, https://openalex.org/W4246719751, https://openalex.org/W3044475370, https://openalex.org/W4387635768 |
| cited_by_count | 10 |
| counts_by_year[0].year | 2025 |
| counts_by_year[0].cited_by_count | 4 |
| counts_by_year[1].year | 2024 |
| counts_by_year[1].cited_by_count | 2 |
| counts_by_year[2].year | 2023 |
| counts_by_year[2].cited_by_count | 2 |
| counts_by_year[3].year | 2022 |
| counts_by_year[3].cited_by_count | 2 |
| locations_count | 2 |
| best_oa_location.id | doi:10.1155/2020/6237942 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S207319443 |
| best_oa_location.source.issn | 1076-2787, 1099-0526 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 1076-2787 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | True |
| best_oa_location.source.display_name | Complexity |
| best_oa_location.source.host_organization | https://openalex.org/P4310319869 |
| best_oa_location.source.host_organization_name | Hindawi Publishing Corporation |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310319869 |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://downloads.hindawi.com/journals/complexity/2020/6237942.pdf |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Complexity |
| best_oa_location.landing_page_url | https://doi.org/10.1155/2020/6237942 |
| primary_location.id | doi:10.1155/2020/6237942 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S207319443 |
| primary_location.source.issn | 1076-2787, 1099-0526 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 1076-2787 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | True |
| primary_location.source.display_name | Complexity |
| primary_location.source.host_organization | https://openalex.org/P4310319869 |
| primary_location.source.host_organization_name | Hindawi Publishing Corporation |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310319869 |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://downloads.hindawi.com/journals/complexity/2020/6237942.pdf |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Complexity |
| primary_location.landing_page_url | https://doi.org/10.1155/2020/6237942 |
| publication_date | 2020-02-26 |
| publication_year | 2020 |
| referenced_works | https://openalex.org/W2244987555, https://openalex.org/W2045079045, https://openalex.org/W2516602727, https://openalex.org/W2588594937, https://openalex.org/W2295652899, https://openalex.org/W2964271484, https://openalex.org/W2163232332, https://openalex.org/W2963178962, https://openalex.org/W2962853966, https://openalex.org/W2769032176, https://openalex.org/W2964011556, https://openalex.org/W2033468335, https://openalex.org/W2022541060, https://openalex.org/W1967138577, https://openalex.org/W2129732816, https://openalex.org/W2021361347, https://openalex.org/W2056201402, https://openalex.org/W2024285170, https://openalex.org/W3105393233, https://openalex.org/W2068357778, https://openalex.org/W2096765209 |
| referenced_works_count | 21 |
| abstract_inverted_index.a | 37, 43, 69, 88 |
| abstract_inverted_index.In | 55 |
| abstract_inverted_index.We | 72 |
| abstract_inverted_index.an | 8, 60 |
| abstract_inverted_index.by | 83 |
| abstract_inverted_index.in | 127 |
| abstract_inverted_index.is | 7, 20, 30, 36, 42, 87 |
| abstract_inverted_index.of | 4, 28, 78, 100, 123, 141 |
| abstract_inverted_index.or | 34, 40, 47 |
| abstract_inverted_index.to | 137 |
| abstract_inverted_index.we | 58, 95, 131 |
| abstract_inverted_index.The | 0 |
| abstract_inverted_index.and | 17 |
| abstract_inverted_index.any | 75 |
| abstract_inverted_index.for | 11, 63, 120 |
| abstract_inverted_index.its | 18, 48 |
| abstract_inverted_index.may | 52 |
| abstract_inverted_index.not | 53 |
| abstract_inverted_index.the | 25, 79, 84, 97, 101, 105, 108, 112, 117, 121, 124, 128, 139, 142 |
| abstract_inverted_index.ADMM | 46, 126 |
| abstract_inverted_index.This | 115 |
| abstract_inverted_index.When | 23 |
| abstract_inverted_index.give | 132 |
| abstract_inverted_index.mild | 92 |
| abstract_inverted_index.more | 31 |
| abstract_inverted_index.show | 73, 138 |
| abstract_inverted_index.some | 133 |
| abstract_inverted_index.than | 32 |
| abstract_inverted_index.that | 74, 107 |
| abstract_inverted_index.this | 56 |
| abstract_inverted_index.two, | 33 |
| abstract_inverted_index.well | 21 |
| abstract_inverted_index.with | 68 |
| abstract_inverted_index.basis | 119 |
| abstract_inverted_index.point | 77 |
| abstract_inverted_index.there | 35, 41 |
| abstract_inverted_index.under | 91, 104 |
| abstract_inverted_index.whole | 102 |
| abstract_inverted_index.(ADMM) | 6 |
| abstract_inverted_index.blocks | 29 |
| abstract_inverted_index.convex | 15 |
| abstract_inverted_index.either | 24 |
| abstract_inverted_index.extend | 50 |
| abstract_inverted_index.method | 3, 10 |
| abstract_inverted_index.number | 27 |
| abstract_inverted_index.paper, | 57 |
| abstract_inverted_index.point, | 90 |
| abstract_inverted_index.strong | 98 |
| abstract_inverted_index.cluster | 76 |
| abstract_inverted_index.results | 136 |
| abstract_inverted_index.solving | 12 |
| abstract_inverted_index.version | 51 |
| abstract_inverted_index.Finally, | 130 |
| abstract_inverted_index.critical | 89 |
| abstract_inverted_index.directly | 49 |
| abstract_inverted_index.function | 110 |
| abstract_inverted_index.involved | 26 |
| abstract_inverted_index.problems | 16, 67 |
| abstract_inverted_index.proposed | 59, 85, 125, 143 |
| abstract_inverted_index.provides | 116 |
| abstract_inverted_index.sequence | 81 |
| abstract_inverted_index.algorithm | 62, 86 |
| abstract_inverted_index.condition | 106 |
| abstract_inverted_index.converge. | 54 |
| abstract_inverted_index.direction | 2 |
| abstract_inverted_index.effective | 9 |
| abstract_inverted_index.establish | 96 |
| abstract_inverted_index.function, | 39 |
| abstract_inverted_index.generated | 82 |
| abstract_inverted_index.iterative | 80 |
| abstract_inverted_index.nonconvex | 38, 64 |
| abstract_inverted_index.numerical | 135 |
| abstract_inverted_index.potential | 109 |
| abstract_inverted_index.practice. | 129 |
| abstract_inverted_index.property. | 114 |
| abstract_inverted_index.satisfies | 111 |
| abstract_inverted_index.separable | 14 |
| abstract_inverted_index.sequence, | 103 |
| abstract_inverted_index.two-block | 13 |
| abstract_inverted_index.ADMM-based | 61 |
| abstract_inverted_index.algorithm. | 144 |
| abstract_inverted_index.condition. | 93 |
| abstract_inverted_index.multiblock | 65 |
| abstract_inverted_index.structure, | 45 |
| abstract_inverted_index.structure. | 71 |
| abstract_inverted_index.alternating | 1 |
| abstract_inverted_index.application | 122 |
| abstract_inverted_index.convergence | 19, 99 |
| abstract_inverted_index.multipliers | 5 |
| abstract_inverted_index.preliminary | 134 |
| abstract_inverted_index.theoretical | 118 |
| abstract_inverted_index.understood. | 22 |
| abstract_inverted_index.Furthermore, | 94 |
| abstract_inverted_index.nonseparable | 44, 70 |
| abstract_inverted_index.optimization | 66 |
| abstract_inverted_index.effectiveness | 140 |
| abstract_inverted_index.Kurdyka–Łojasiewicz | 113 |
| cited_by_percentile_year.max | 98 |
| cited_by_percentile_year.min | 94 |
| corresponding_author_ids | https://openalex.org/A5066627199 |
| countries_distinct_count | 1 |
| institutions_distinct_count | 3 |
| corresponding_institution_ids | https://openalex.org/I167274908 |
| citation_normalized_percentile.value | 0.64685445 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |