{"id":"https://openalex.org/W2084134548","doi":"https://doi.org/10.1137/080736156","title":"M-Convex Function Minimization by Continuous Relaxation Approach: Proximity Theorem and Algorithm","display_name":"M-Convex Function Minimization by Continuous Relaxation Approach: Proximity Theorem and Algorithm","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2084134548","doi":"https://doi.org/10.1137/080736156","mag":"2084134548"},"language":"en","primary_location":{"id":"doi:10.1137/080736156","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080736156","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","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/A5016777657","display_name":"Satoko Moriguchi","orcid":"https://orcid.org/0000-0003-0105-7167"},"institutions":[{"id":"https://openalex.org/I74640424","display_name":"Advanced Institute of Industrial Technology","ror":"https://ror.org/04f9apy08","country_code":"JP","type":"education","lineage":["https://openalex.org/I74640424"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Satoko Moriguchi","raw_affiliation_strings":["[Advanced Institute of Industrial Technology]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[Advanced Institute of Industrial Technology]","institution_ids":["https://openalex.org/I74640424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067169957","display_name":"Akiyoshi Shioura","orcid":"https://orcid.org/0000-0002-5216-7190"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Akiyoshi Shioura","raw_affiliation_strings":["INF - System Information Sciences"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INF - System Information Sciences","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009977758","display_name":"Nobuyuki Tsuchimura","orcid":null},"institutions":[{"id":"https://openalex.org/I206011266","display_name":"Kwansei Gakuin University","ror":"https://ror.org/02qf2tx24","country_code":"JP","type":"education","lineage":["https://openalex.org/I206011266"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Nobuyuki Tsuchimura","raw_affiliation_strings":["Kwansei Gakuin Univ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kwansei Gakuin Univ","institution_ids":["https://openalex.org/I206011266"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2979,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.6121747,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"21","issue":"3","first_page":"633","last_page":"668"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983000159263611,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983000159263611,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9921000003814697,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.991100013256073,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7494408488273621},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.5894975662231445},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5630574822425842},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5405974984169006},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.5175241827964783},{"id":"https://openalex.org/keywords/proper-convex-function","display_name":"Proper convex function","score":0.499969482421875},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.49320095777511597},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.47320622205734253},{"id":"https://openalex.org/keywords/subderivative","display_name":"Subderivative","score":0.4556084871292114},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.44699394702911377},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.44402629137039185},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.43044614791870117},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35776692628860474},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3478814959526062},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09113079309463501}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7494408488273621},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.5894975662231445},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5630574822425842},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5405974984169006},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.5175241827964783},{"id":"https://openalex.org/C50862404","wikidata":"https://www.wikidata.org/wiki/Q3075259","display_name":"Proper convex function","level":5,"score":0.499969482421875},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.49320095777511597},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.47320622205734253},{"id":"https://openalex.org/C200661725","wikidata":"https://www.wikidata.org/wiki/Q289500","display_name":"Subderivative","level":4,"score":0.4556084871292114},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.44699394702911377},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.44402629137039185},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.43044614791870117},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35776692628860474},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3478814959526062},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09113079309463501},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/080736156","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080736156","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.618.4177","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.618.4177","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.keisu.t.u-tokyo.ac.jp/research/techrep/data/2008/METR08-38.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5638094406","display_name":"High-Accuracy Information-Rich Inventory Management Based on Discrete Convex Analysis","funder_award_id":"22710148","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W129781438","https://openalex.org/W1566552089","https://openalex.org/W1576820654","https://openalex.org/W1963547452","https://openalex.org/W1971775248","https://openalex.org/W1977545325","https://openalex.org/W1978119584","https://openalex.org/W1987675495","https://openalex.org/W1989262026","https://openalex.org/W2015553537","https://openalex.org/W2016802101","https://openalex.org/W2019315437","https://openalex.org/W2025350305","https://openalex.org/W2033932126","https://openalex.org/W2035186046","https://openalex.org/W2050548031","https://openalex.org/W2053352956","https://openalex.org/W2054873505","https://openalex.org/W2059664817","https://openalex.org/W2061274033","https://openalex.org/W2065356639","https://openalex.org/W2069596575","https://openalex.org/W2081321495","https://openalex.org/W2090359754","https://openalex.org/W2093903916","https://openalex.org/W2106772662","https://openalex.org/W2107547393","https://openalex.org/W2115815938","https://openalex.org/W2123812125","https://openalex.org/W2155598645","https://openalex.org/W2157867221","https://openalex.org/W2158486393","https://openalex.org/W2304678994","https://openalex.org/W4210391498","https://openalex.org/W4243401948"],"related_works":["https://openalex.org/W2007576447","https://openalex.org/W2026600343","https://openalex.org/W2356261519","https://openalex.org/W4382519084","https://openalex.org/W1978014154","https://openalex.org/W2478309485","https://openalex.org/W165488893","https://openalex.org/W2040676043","https://openalex.org/W1510770274","https://openalex.org/W4361807553"],"abstract_inverted_index":{"The":[0],"concept":[1],"of":[2,25,36,46,61,104],"M-convexity":[3],"for":[4,75],"functions":[5],"in":[6,22],"integer":[7,67],"variables,":[8],"introduced":[9],"by":[10],"Murota":[11],"[Adv.":[12],"Math.,":[13],"124":[14],"(1996),":[15],"pp.":[16],"272\u2013311],":[17],"plays":[18],"a":[19,43,54,72,89],"primary":[20],"role":[21],"the":[23,34,47,98,105,113],"theory":[24],"discrete":[26],"convex":[27,49,63,107,114],"analysis.":[28],"In":[29],"this":[30],"paper,":[31],"we":[32,87],"consider":[33],"problem":[35,52,111,119],"minimizing":[37],"an":[38],"M-convex":[39,76],"function,":[40],"which":[41],"is":[42],"natural":[44],"generalization":[45],"separable":[48,106],"resource":[50,109,117],"allocation":[51,110,118],"under":[53],"submodular":[55],"constraint":[56],"and":[57,112],"contains":[58],"some":[59,101],"classes":[60],"nonseparable":[62],"function":[64,77],"minimization":[65,78],"on":[66,80,93],"lattice":[68],"points.":[69],"We":[70,96],"propose":[71],"new":[73,90],"approach":[74,99],"based":[79,92],"continuous":[81,94],"relaxation.":[82,95],"By":[83],"establishing":[84],"proximity":[85],"theorems":[86],"develop":[88],"algorithm":[91],"apply":[97],"to":[100,120],"special":[102],"cases":[103],"quadratic":[108,115],"tree":[116],"obtain":[121],"faster":[122],"algorithms.":[123]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}