{"id":"https://openalex.org/W2908319547","doi":"https://doi.org/10.1007/s10915-019-01085-z","title":"A Finite Element Nonoverlapping Domain Decomposition Method with Lagrange Multipliers for the Dual Total Variation Minimizations","display_name":"A Finite Element Nonoverlapping Domain Decomposition Method with Lagrange Multipliers for the Dual Total Variation Minimizations","publication_year":2019,"publication_date":"2019-11-04","ids":{"openalex":"https://openalex.org/W2908319547","doi":"https://doi.org/10.1007/s10915-019-01085-z","mag":"2908319547"},"language":"en","primary_location":{"id":"doi:10.1007/s10915-019-01085-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10915-019-01085-z","pdf_url":null,"source":{"id":"https://openalex.org/S151550017","display_name":"Journal of Scientific Computing","issn_l":"0885-7474","issn":["0885-7474","1573-7691"],"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":"Journal of Scientific Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1901.00682","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Chang-Ock Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]},{"id":"https://openalex.org/I4210158432","display_name":"National Institute for Mathematical Sciences","ror":"https://ror.org/04n7py080","country_code":"KR","type":"education","lineage":["https://openalex.org/I4210158432"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Chang-Ock Lee","raw_affiliation_strings":["Department of Mathematical Sciences, KAIST, Daejeon, 34141, Korea"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, KAIST, Daejeon, 34141, Korea","institution_ids":["https://openalex.org/I4210158432","https://openalex.org/I157485424"]}]},{"author_position":"last","author":{"id":null,"display_name":"Jongho Park","orcid":"https://orcid.org/0000-0002-0496-649X"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]},{"id":"https://openalex.org/I4210158432","display_name":"National Institute for Mathematical Sciences","ror":"https://ror.org/04n7py080","country_code":"KR","type":"education","lineage":["https://openalex.org/I4210158432"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jongho Park","raw_affiliation_strings":["Department of Mathematical Sciences, KAIST, Daejeon, 34141, Korea"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, KAIST, Daejeon, 34141, Korea","institution_ids":["https://openalex.org/I4210158432","https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I157485424","https://openalex.org/I4210158432"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.5109,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.6793273,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"81","issue":"3","first_page":"2331","last_page":"2355"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10052","display_name":"Medical Image Segmentation Techniques","score":0.37940001487731934,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10052","display_name":"Medical Image Segmentation Techniques","score":0.37940001487731934,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11205","display_name":"Numerical methods in inverse problems","score":0.2969000041484833,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"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/T11206","display_name":"Model Reduction and Neural Networks","score":0.0640999972820282,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/lagrange-multiplier","display_name":"Lagrange multiplier","score":0.7724000215530396},{"id":"https://openalex.org/keywords/domain-decomposition-methods","display_name":"Domain decomposition methods","score":0.7279000282287598},{"id":"https://openalex.org/keywords/constraint-algorithm","display_name":"Constraint algorithm","score":0.6380000114440918},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5602999925613403},{"id":"https://openalex.org/keywords/finite-element-method","display_name":"Finite element method","score":0.5483999848365784},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5454999804496765},{"id":"https://openalex.org/keywords/saddle-point","display_name":"Saddle point","score":0.5217999815940857},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.510200023651123},{"id":"https://openalex.org/keywords/fictitious-domain-method","display_name":"Fictitious domain method","score":0.48350000381469727},{"id":"https://openalex.org/keywords/saddle","display_name":"Saddle","score":0.48350000381469727}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8212000131607056},{"id":"https://openalex.org/C73684929","wikidata":"https://www.wikidata.org/wiki/Q598870","display_name":"Lagrange multiplier","level":2,"score":0.7724000215530396},{"id":"https://openalex.org/C198880260","wikidata":"https://www.wikidata.org/wiki/Q5289813","display_name":"Domain decomposition methods","level":3,"score":0.7279000282287598},{"id":"https://openalex.org/C15980293","wikidata":"https://www.wikidata.org/wiki/Q5164368","display_name":"Constraint algorithm","level":3,"score":0.6380000114440918},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5602999925613403},{"id":"https://openalex.org/C135628077","wikidata":"https://www.wikidata.org/wiki/Q220184","display_name":"Finite element method","level":2,"score":0.5483999848365784},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5454999804496765},{"id":"https://openalex.org/C2681867","wikidata":"https://www.wikidata.org/wiki/Q690935","display_name":"Saddle point","level":2,"score":0.5217999815940857},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.510200023651123},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4918999969959259},{"id":"https://openalex.org/C119741493","wikidata":"https://www.wikidata.org/wiki/Q5446587","display_name":"Fictitious domain method","level":3,"score":0.48350000381469727},{"id":"https://openalex.org/C2777127463","wikidata":"https://www.wikidata.org/wiki/Q10862618","display_name":"Saddle","level":2,"score":0.48350000381469727},{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.47769999504089355},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4009999930858612},{"id":"https://openalex.org/C48753275","wikidata":"https://www.wikidata.org/wiki/Q11216","display_name":"Numerical analysis","level":2,"score":0.3961000144481659},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39309999346733093},{"id":"https://openalex.org/C207282899","wikidata":"https://www.wikidata.org/wiki/Q7828156","display_name":"Total variation denoising","level":3,"score":0.390500009059906},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.375900000333786},{"id":"https://openalex.org/C97110765","wikidata":"https://www.wikidata.org/wiki/Q17099078","display_name":"Mortar methods","level":4,"score":0.37049999833106995},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.3700000047683716},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35519999265670776},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.35260000824928284},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.3467999994754791},{"id":"https://openalex.org/C89600930","wikidata":"https://www.wikidata.org/wiki/Q1423946","display_name":"Segmentation","level":2,"score":0.3361999988555908},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.305400013923645},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.304500013589859},{"id":"https://openalex.org/C2778334786","wikidata":"https://www.wikidata.org/wiki/Q1586270","display_name":"Variation (astronomy)","level":2,"score":0.30410000681877136},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.2946000099182129},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.2847000062465668},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.2827000021934509},{"id":"https://openalex.org/C103824480","wikidata":"https://www.wikidata.org/wiki/Q185889","display_name":"Time domain","level":2,"score":0.2743000090122223},{"id":"https://openalex.org/C50454189","wikidata":"https://www.wikidata.org/wiki/Q2075125","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","level":2,"score":0.27399998903274536},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.26330000162124634},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.2578999996185303}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10915-019-01085-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10915-019-01085-z","pdf_url":null,"source":{"id":"https://openalex.org/S151550017","display_name":"Journal of Scientific Computing","issn_l":"0885-7474","issn":["0885-7474","1573-7691"],"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":"Journal of Scientific Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1901.00682","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1901.00682","pdf_url":"https://arxiv.org/pdf/1901.00682","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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1901.00682","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1901.00682","pdf_url":"https://arxiv.org/pdf/1901.00682","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1976688370","https://openalex.org/W1978333359","https://openalex.org/W1998999283","https://openalex.org/W2005390260","https://openalex.org/W2016228846","https://openalex.org/W2018575953","https://openalex.org/W2031832209","https://openalex.org/W2033603511","https://openalex.org/W2034511734","https://openalex.org/W2038495454","https://openalex.org/W2052972089","https://openalex.org/W2082608952","https://openalex.org/W2092663520","https://openalex.org/W2103559027","https://openalex.org/W2103913786","https://openalex.org/W2112009428","https://openalex.org/W2126967844","https://openalex.org/W2134123171","https://openalex.org/W2152612750","https://openalex.org/W2156648982","https://openalex.org/W2171611161","https://openalex.org/W2246930985","https://openalex.org/W2339257204","https://openalex.org/W2405803404","https://openalex.org/W2607511154","https://openalex.org/W2884736388","https://openalex.org/W2921749691","https://openalex.org/W2963777691"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2019-01-11T00:00:00"}