{"id":"https://openalex.org/W3023205052","doi":"https://doi.org/10.1137/18m1186320","title":"A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set","display_name":"A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3023205052","doi":"https://doi.org/10.1137/18m1186320","mag":"3023205052"},"language":"en","primary_location":{"id":"doi:10.1137/18m1186320","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1186320","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/A5047322025","display_name":"Minglu Ye","orcid":"https://orcid.org/0000-0001-5157-3878"},"institutions":[{"id":"https://openalex.org/I16351329","display_name":"China West Normal University","ror":"https://ror.org/04s99y476","country_code":"CN","type":"education","lineage":["https://openalex.org/I16351329"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Minglu Ye","raw_affiliation_strings":["China West Normal University,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"China West Normal University,","institution_ids":["https://openalex.org/I16351329"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065214298","display_name":"Ting Kei Pong","orcid":"https://orcid.org/0000-0001-5862-2986"},"institutions":[{"id":"https://openalex.org/I14243506","display_name":"Hong Kong Polytechnic University","ror":"https://ror.org/0030zas98","country_code":"HK","type":"education","lineage":["https://openalex.org/I14243506"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Ting Kei Pong","raw_affiliation_strings":["The Hong Kong Polytechnic University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Hong Kong Polytechnic University","institution_ids":["https://openalex.org/I14243506"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3241,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.61257597,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"30","issue":"2","first_page":"1274","last_page":"1299"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9912999868392944,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9912999868392944,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10050","display_name":"Multi-Criteria Decision Making","score":0.9876000285148621,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9865000247955322,"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/subgradient-method","display_name":"Subgradient method","score":0.990830659866333},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7413859367370605},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6205154061317444},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5843021869659424},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.5530814528465271},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5386474132537842},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5194998979568481},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.48734888434410095},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47778066992759705},{"id":"https://openalex.org/keywords/stationary-point","display_name":"Stationary point","score":0.4774742126464844},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.43876829743385315},{"id":"https://openalex.org/keywords/projection-method","display_name":"Projection method","score":0.4374862313270569},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.39110565185546875},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30081117153167725},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2102152407169342},{"id":"https://openalex.org/keywords/dykstras-projection-algorithm","display_name":"Dykstra's projection algorithm","score":0.17156252264976501},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09463191032409668}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.990830659866333},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7413859367370605},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6205154061317444},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5843021869659424},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.5530814528465271},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5386474132537842},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5194998979568481},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.48734888434410095},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47778066992759705},{"id":"https://openalex.org/C189237950","wikidata":"https://www.wikidata.org/wiki/Q2500758","display_name":"Stationary point","level":2,"score":0.4774742126464844},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.43876829743385315},{"id":"https://openalex.org/C65557600","wikidata":"https://www.wikidata.org/wiki/Q7249451","display_name":"Projection method","level":3,"score":0.4374862313270569},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.39110565185546875},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30081117153167725},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2102152407169342},{"id":"https://openalex.org/C202426404","wikidata":"https://www.wikidata.org/wiki/Q5318686","display_name":"Dykstra's projection algorithm","level":2,"score":0.17156252264976501},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09463191032409668},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/18m1186320","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1186320","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:ira.lib.polyu.edu.hk:10397/90721","is_oa":false,"landing_page_url":"http://hdl.handle.net/10397/90721","pdf_url":null,"source":{"id":"https://openalex.org/S4306400205","display_name":"PolyU Institutional Research Archive (Hong Kong Polytechnic University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I14243506","host_organization_name":"Hong Kong Polytechnic University","host_organization_lineage":["https://openalex.org/I14243506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Journal/Magazine Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1509629106","display_name":null,"funder_award_id":"PolyU153005/17p","funder_id":"https://openalex.org/F4320321592","funder_display_name":"Research Grants Council, University Grants Committee"}],"funders":[{"id":"https://openalex.org/F4320321592","display_name":"Research Grants Council, University Grants Committee","ror":"https://ror.org/00djwmt25"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1967138577","https://openalex.org/W1971044761","https://openalex.org/W1971697593","https://openalex.org/W1981487911","https://openalex.org/W1993943649","https://openalex.org/W1994211385","https://openalex.org/W2027982384","https://openalex.org/W2045168006","https://openalex.org/W2049083558","https://openalex.org/W2063434077","https://openalex.org/W2075779886","https://openalex.org/W2078853581","https://openalex.org/W2082030917","https://openalex.org/W2126607811","https://openalex.org/W2129732816","https://openalex.org/W2158902838","https://openalex.org/W2265744594","https://openalex.org/W2963579802","https://openalex.org/W3100208521"],"related_works":["https://openalex.org/W1561297735","https://openalex.org/W2078980565","https://openalex.org/W4389712904","https://openalex.org/W2910556747","https://openalex.org/W2392510576","https://openalex.org/W2026392561","https://openalex.org/W2404804436","https://openalex.org/W3005426141","https://openalex.org/W2017887779","https://openalex.org/W3092127437"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,12,20,41,63,76,87,107,133,168,173],"subgradient-based":[3],"method":[4,110,129,151],"for":[5,162],"finding":[6],"the":[7,31,57,60,71,95,98,120,145,149,164,183],"maximum":[8],"feasible":[9],"subsystem":[10],"in":[11,85,92],"collection":[13,169,174],"of":[14,43,52,59,62,94,126,148,170,175,177,185],"closed":[15,22,77,99],"sets":[16],"with":[17,70,132,180],"respect":[18,181],"to":[19,47,75,111,123,142,182],"given":[21],"set":[23,184],"$C$":[24],"(MFS$_C$).":[25],"In":[26],"this":[27,80,103],"method,":[28],"we":[29,105,157],"reformulate":[30],"MFS$_C$":[32,165],"problem":[33,38,55],"as":[34],"an":[35],"$\\ell_0$":[36],"optimization":[37,45],"and":[39,172],"construct":[40],"sequence":[42],"continuous":[44],"problems":[46,166],"approximate":[48],"it.":[49],"The":[50],"objective":[51,81],"each":[53],"approximation":[54,114],"is":[56,83,130],"sum":[58],"composition":[61],"nonnegative":[64],"nondecreasing":[65],"continuously":[66],"differentiable":[67],"concave":[68],"function":[69,74,82],"squared":[72],"distance":[73],"set.":[78],"Although":[79],"nonsmooth":[84],"general,":[86],"subgradient":[88,108,118,128,150],"can":[89],"be":[90],"obtained":[91],"terms":[93],"projections":[96],"onto":[97],"sets.":[100],"Based":[101],"on":[102,167],"observation,":[104],"adapt":[106],"projection":[109],"solve":[112],"these":[113],"problems.":[115],"Unlike":[116],"classical":[117],"methods,":[119],"convergence":[121,147],"(clustering":[122],"stationary":[124],"points)":[125],"our":[127,159],"guaranteed":[131],"nondiminishing":[134],"stepsize":[135],"under":[136,152],"mild":[137],"assumptions.":[138,155],"This":[139],"allows":[140],"us":[141],"further":[143],"study":[144],"sequential":[146],"suitable":[153],"Kurdyka--\u0141ojasiewicz":[154],"Finally,":[156],"illustrate":[158],"algorithm":[160],"numerically":[161],"solving":[163],"halfspaces":[171],"unions":[176],"halfspaces,":[178],"respectively,":[179],"$s$-sparse":[186],"vectors.":[187]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}