{"id":"https://openalex.org/W1997413930","doi":"https://doi.org/10.1162/neco_a_00283","title":"A Proof of Convergence of the Concave-Convex Procedure Using Zangwill's Theory","display_name":"A Proof of Convergence of the Concave-Convex Procedure Using Zangwill's Theory","publication_year":2012,"publication_date":"2012-02-24","ids":{"openalex":"https://openalex.org/W1997413930","doi":"https://doi.org/10.1162/neco_a_00283","mag":"1997413930","pmid":"https://pubmed.ncbi.nlm.nih.gov/22364501"},"language":"en","primary_location":{"id":"doi:10.1162/neco_a_00283","is_oa":false,"landing_page_url":"https://doi.org/10.1162/neco_a_00283","pdf_url":null,"source":{"id":"https://openalex.org/S207023548","display_name":"Neural Computation","issn_l":"0899-7667","issn":["0899-7667","1530-888X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Neural Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"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/A5109582233","display_name":"Bharath K. Sriperumbudur","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bharath K. Sriperumbudur","raw_affiliation_strings":["Gatsby Unit, University College London, London WC1N 3AR, U.K"],"affiliations":[{"raw_affiliation_string":"Gatsby Unit, University College London, London WC1N 3AR, U.K","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003709708","display_name":"Gert Lanckriet","orcid":null},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gert R. G. Lanckriet","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA 92093-0407, U.S.A"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA 92093-0407, U.S.A","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5109582233"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.6618,"has_fulltext":false,"cited_by_count":71,"citation_normalized_percentile":{"value":0.97998221,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"24","issue":"6","first_page":"1391","last_page":"1407"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9994000196456909,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9952999949455261,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.669478178024292},{"id":"https://openalex.org/keywords/symbolic-convergence-theory","display_name":"Symbolic convergence theory","score":0.6275072693824768},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6121267080307007},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5486652255058289},{"id":"https://openalex.org/keywords/local-convergence","display_name":"Local convergence","score":0.5391737222671509},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5003361701965332},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.4764994978904724},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4351840913295746},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4283809959888458},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4274032711982727},{"id":"https://openalex.org/keywords/support-vector-machine","display_name":"Support vector machine","score":0.42718249559402466},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.41395875811576843},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.2932548522949219},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17820227146148682},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.12138363718986511}],"concepts":[{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.669478178024292},{"id":"https://openalex.org/C64980692","wikidata":"https://www.wikidata.org/wiki/Q16191959","display_name":"Symbolic convergence theory","level":3,"score":0.6275072693824768},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6121267080307007},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5486652255058289},{"id":"https://openalex.org/C117898588","wikidata":"https://www.wikidata.org/wiki/Q6664310","display_name":"Local convergence","level":3,"score":0.5391737222671509},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5003361701965332},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.4764994978904724},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4351840913295746},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4283809959888458},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4274032711982727},{"id":"https://openalex.org/C12267149","wikidata":"https://www.wikidata.org/wiki/Q282453","display_name":"Support vector machine","level":2,"score":0.42718249559402466},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.41395875811576843},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2932548522949219},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17820227146148682},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.12138363718986511},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"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/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1162/neco_a_00283","is_oa":false,"landing_page_url":"https://doi.org/10.1162/neco_a_00283","pdf_url":null,"source":{"id":"https://openalex.org/S207023548","display_name":"Neural Computation","issn_l":"0899-7667","issn":["0899-7667","1530-888X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Neural Computation","raw_type":"journal-article"},{"id":"pmid:22364501","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/22364501","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Neural computation","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W81972919","https://openalex.org/W111413457","https://openalex.org/W1481939842","https://openalex.org/W1538755060","https://openalex.org/W1629332708","https://openalex.org/W1749992802","https://openalex.org/W1979556467","https://openalex.org/W1989145836","https://openalex.org/W1997029057","https://openalex.org/W2000023271","https://openalex.org/W2037984448","https://openalex.org/W2038614136","https://openalex.org/W2043230024","https://openalex.org/W2051664786","https://openalex.org/W2053742104","https://openalex.org/W2083955318","https://openalex.org/W2090963365","https://openalex.org/W2107968230","https://openalex.org/W2114551781","https://openalex.org/W2142114717","https://openalex.org/W2158460069","https://openalex.org/W2166765763","https://openalex.org/W2171270653","https://openalex.org/W2215815030","https://openalex.org/W2340859457","https://openalex.org/W2597289420","https://openalex.org/W2802627035","https://openalex.org/W3081544918","https://openalex.org/W3202365024","https://openalex.org/W4299356270","https://openalex.org/W4299512035"],"related_works":["https://openalex.org/W2149720731","https://openalex.org/W2371360614","https://openalex.org/W2764550560","https://openalex.org/W924788931","https://openalex.org/W2992250528","https://openalex.org/W4297899479","https://openalex.org/W2880790775","https://openalex.org/W2589063463","https://openalex.org/W2953109382","https://openalex.org/W2811008754"],"abstract_inverted_index":{"The":[0,83],"concave-convex":[1],"procedure":[2],"(CCCP)":[3],"is":[4,26,48,80],"an":[5,224],"iterative":[6,131,160],"algorithm":[7,96],"that":[8],"solves":[9],"d.c.":[10,95,107,113,208],"(difference":[11],"of":[12,19,62,85,93,130,141,159,170,186,189,206,230,233],"convex":[13,20],"functions)":[14],"programs":[15],"as":[16,147],"a":[17,60,120,134,148,183,199,203],"sequence":[18,216],"programs.":[21],"In":[22,115,178],"machine":[23],"learning,":[24],"CCCP":[25,47,86,190,197,219],"extensively":[27],"used":[28,50,165],"in":[29,51,71,99],"many":[30,52],"learning":[31],"algorithms,":[32,161],"including":[33],"sparse":[34,42],"support":[35],"vector":[36],"machines":[37],"(SVMs),":[38],"transductive":[39],"SVMs,":[40],"and":[41,66,123,150,174,212],"principal":[43],"component":[44],"analysis.":[45],"Though":[46],"widely":[49],"applications,":[53],"its":[54,69],"convergence":[55,70,84,92,128,140,157,169,188,232],"behavior":[56],"has":[57],"not":[58,81],"gotten":[59],"lot":[61],"specific":[63],"attention.":[64],"Yuille":[65],"Rangarajan":[67],"analyzed":[68],"their":[72],"original":[73],"paper;":[74],"however,":[75],"we":[76,118,181],"believe":[77],"the":[78,91,94,100,139,156,168,187,207,215,228],"analysis":[79,185],"complete.":[82],"can":[87],"be":[88],"derived":[89],"from":[90],"(DCA),":[97],"proposed":[98],"global":[101,127],"optimization":[102],"literature":[103],"to":[104,137,153,166],"solve":[105],"general":[106,151],"programs,":[108],"whose":[109],"proof":[110],"relies":[111],"on":[112,227],"duality.":[114],"this":[116,179],"note,":[117,180],"follow":[119],"different":[121],"reasoning":[122],"show":[124],"how":[125],"Zangwill's":[126,145],"theory":[129,146],"algorithms":[132,171],"provides":[133],"natural":[135],"framework":[136,152],"prove":[138,167],"CCCP.":[142,234],"This":[143],"underlines":[144],"powerful":[149],"deal":[154],"with":[155],"issues":[158],"after":[162],"also":[163,222],"being":[164],"like":[172],"expectation-maximization":[173],"generalized":[175],"alternating":[176],"minimization.":[177],"provide":[182],"rigorous":[184],"by":[191,218],"addressing":[192],"two":[193],"questions:":[194],"When":[195],"does":[196,214],"find":[198],"local":[200,231],"minimum":[201],"or":[202],"stationary":[204],"point":[205],"program":[209],"under":[210],"consideration?":[211],"when":[213],"generated":[217],"converge?":[220],"We":[221],"present":[223],"open":[225],"problem":[226],"issue":[229]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}