{"id":"https://openalex.org/W3126822101","doi":"https://doi.org/10.1109/tcsii.2021.3104251","title":"An Efficient Riemannian Gradient Based Algorithm for Max-Cut Problems","display_name":"An Efficient Riemannian Gradient Based Algorithm for Max-Cut Problems","publication_year":2021,"publication_date":"2021-08-11","ids":{"openalex":"https://openalex.org/W3126822101","doi":"https://doi.org/10.1109/tcsii.2021.3104251","mag":"3126822101"},"language":"en","primary_location":{"id":"doi:10.1109/tcsii.2021.3104251","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcsii.2021.3104251","pdf_url":null,"source":{"id":"https://openalex.org/S93916849","display_name":"IEEE Transactions on Circuits & Systems II Express Briefs","issn_l":"1549-7747","issn":["1549-7747","1558-3791"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Circuits and Systems II: Express Briefs","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/A5020734313","display_name":"Mohamad Mahdi Mohades","orcid":"https://orcid.org/0000-0002-6607-2192"},"institutions":[{"id":"https://openalex.org/I67009956","display_name":"Iran University of Science and Technology","ror":"https://ror.org/01jw2p796","country_code":"IR","type":"education","lineage":["https://openalex.org/I67009956"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Mohamad Mahdi Mohades","raw_affiliation_strings":["School of Electrical Engineering, Iran University of Science and Technology, Tehran, Iran"],"raw_orcid":"https://orcid.org/0000-0002-6607-2192","affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Iran University of Science and Technology, Tehran, Iran","institution_ids":["https://openalex.org/I67009956"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010894349","display_name":"Mohammad Hossein Kahaei","orcid":"https://orcid.org/0000-0002-1920-659X"},"institutions":[{"id":"https://openalex.org/I67009956","display_name":"Iran University of Science and Technology","ror":"https://ror.org/01jw2p796","country_code":"IR","type":"education","lineage":["https://openalex.org/I67009956"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mohammad Hossein Kahaei","raw_affiliation_strings":["School of Electrical Engineering, Iran University of Science and Technology, Tehran, Iran"],"raw_orcid":"https://orcid.org/0000-0002-1920-659X","affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Iran University of Science and Technology, Tehran, Iran","institution_ids":["https://openalex.org/I67009956"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020734313"],"corresponding_institution_ids":["https://openalex.org/I67009956"],"apc_list":null,"apc_paid":null,"fwci":0.3028,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.5874121,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":"69","issue":"3","first_page":"1882","last_page":"1886"},"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.9995999932289124,"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.9995999932289124,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9937000274658203,"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/T12288","display_name":"Optimization and Search Problems","score":0.9923999905586243,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.7588338255882263},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5983821153640747},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5646408200263977},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5605146288871765},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.48946869373321533},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4398892819881439},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4370429515838623},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3640671968460083},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32409125566482544},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11734485626220703},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.06398868560791016}],"concepts":[{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.7588338255882263},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5983821153640747},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5646408200263977},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5605146288871765},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.48946869373321533},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4398892819881439},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4370429515838623},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3640671968460083},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32409125566482544},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11734485626220703},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.06398868560791016},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tcsii.2021.3104251","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcsii.2021.3104251","pdf_url":null,"source":{"id":"https://openalex.org/S93916849","display_name":"IEEE Transactions on Circuits & Systems II Express Briefs","issn_l":"1549-7747","issn":["1549-7747","1558-3791"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Circuits and Systems II: Express Briefs","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W179940750","https://openalex.org/W1486060839","https://openalex.org/W1494985256","https://openalex.org/W1536573229","https://openalex.org/W1780575547","https://openalex.org/W1976523866","https://openalex.org/W1984322914","https://openalex.org/W1985123706","https://openalex.org/W1991068820","https://openalex.org/W1999032440","https://openalex.org/W2050628256","https://openalex.org/W2051306216","https://openalex.org/W2051598459","https://openalex.org/W2086917808","https://openalex.org/W2087038607","https://openalex.org/W2159739530","https://openalex.org/W2921629474","https://openalex.org/W2951747536","https://openalex.org/W2963033797","https://openalex.org/W3006976375","https://openalex.org/W4205293427","https://openalex.org/W4250613930","https://openalex.org/W4252799384"],"related_works":["https://openalex.org/W2980963558","https://openalex.org/W3020890412","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1588356204","https://openalex.org/W1992365905","https://openalex.org/W1976691234","https://openalex.org/W4287664878","https://openalex.org/W3212023493"],"abstract_inverted_index":{"The":[0],"max-cut":[1,64,120],"problem":[2,5,39],"addresses":[3],"the":[4,15,24,63,84,104,111,119,123],"of":[6,20,26,118,122],"finding":[7],"a":[8,11,54,71],"cut":[9],"for":[10,61],"graph":[12,16],"that":[13,23,83],"splits":[14],"into":[17],"two":[18,30],"subsets":[19,31],"vertices":[21],"so":[22],"number":[25],"edges":[27],"between":[28],"these":[29],"is":[32,40,87,97,114],"as":[33,35],"large":[34],"possible.":[36],"However,":[37],"this":[38,50],"NP-Hard,":[41],"which":[42,113],"may":[43],"be":[44],"solved":[45],"by":[46],"suboptimal":[47],"algorithms.":[48],"In":[49],"brief,":[51],"we":[52,69],"propose":[53],"fast":[55],"and":[56,75],"accurate":[57],"Riemannian":[58],"optimization":[59],"algorithm":[60,74],"solving":[62],"problem.":[65],"To":[66],"do":[67],"so,":[68],"develop":[70],"gradient":[72],"descent":[73],"prove":[76],"its":[77],"convergence.":[78],"Our":[79],"simulation":[80],"results":[81],"show":[82],"proposed":[85],"method":[86,96],"extremely":[88],"efficient":[89],"on":[90,98,115],"some":[91],"already-investigated":[92],"graphs.":[93],"Specifically,":[94],"our":[95],"average":[99,116],"35":[100],"times":[101],"faster":[102],"than":[103],"best":[105],"well-known":[106],"techniques":[107],"with":[108],"slightly":[109],"losing":[110],"performance,":[112],"0.96":[117],"value":[121],"others.":[124]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}