{"id":"https://openalex.org/W4417071985","doi":"https://doi.org/10.1080/02331934.2025.2597966","title":"A method of centres for DC-constrained DC optimization programs","display_name":"A method of centres for DC-constrained DC optimization programs","alternate_titles":[],"publication_year":2025,"publication_date":"2025-12-05","ids":{"openalex":"https://openalex.org/W4417071985","doi":"https://doi.org/10.1080/02331934.2025.2597966"},"language":"en","primary_location":{"id":"doi:10.1080/02331934.2025.2597966","doi":"https://doi.org/10.1080/02331934.2025.2597966","is_oa":false,"landing_page_url":"https://doi.org/10.1080/02331934.2025.2597966","pdf_url":null,"source":{"id":"https://openalex.org/S158016561","display_name":"Optimization","issn_l":"0233-1934","issn":["0233-1934","1026-7662","1029-4945"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-c","anvur-scientific","cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-1"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W4417071985"],"child_works_count":0,"type":"article","is_traditional":true,"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/A5035218095","display_name":"Ahmed Roubi","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210145365","display_name":"Universit\u00e9 Hassan 1er","ror":"https://ror.org/03cdvht47","country_code":"MA","type":"education","lineage":["https://openalex.org/I4210145365"]}],"countries":["MA"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Ahmed Roubi","raw_affiliation_strings":["Hassan First University, Settat, Morocco"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hassan First University, Settat, Morocco","institution_ids":["https://openalex.org/I4210145365"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5035218095"],"corresponding_institution_ids":["https://openalex.org/I4210145365"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"75","issue":"12","first_page":"3295","last_page":"3311"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.8939999938011169,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.8939999938011169,"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.1046999990940094,"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/T10791","display_name":"Advanced Control Systems Optimization","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/difference-of-convex-functions","display_name":"difference of convex functions","score":0.8579999804496765},{"id":"https://openalex.org/keywords/dc-optimization","display_name":"DC optimization","score":0.8830000162124634},{"id":"https://openalex.org/keywords/necessary-optimality-conditions","display_name":"necessary optimality conditions","score":0.847000002861023},{"id":"https://openalex.org/keywords/karush-kuhn-tucker-conditions","display_name":"Karush-Kuhn-Tucker conditions","score":0.8029999732971191},{"id":"https://openalex.org/keywords/globally-convergent-algorithm","display_name":"globally convergent algorithm","score":0.8259999752044678},{"id":"https://openalex.org/keywords/infeasible-starting-point","display_name":"infeasible starting point","score":0.6790000200271606},{"id":"https://openalex.org/keywords/convex-relaxation","display_name":"convex relaxation","score":0.3959999978542328}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5480999946594238},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5070000290870667},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3449999988079071},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3089999854564667},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.3001999855041504},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.2840000092983246},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.27869999408721924},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2590000033378601},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2590000033378601},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.25049999356269836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/02331934.2025.2597966","doi":"https://doi.org/10.1080/02331934.2025.2597966","is_oa":false,"landing_page_url":"https://doi.org/10.1080/02331934.2025.2597966","pdf_url":null,"source":{"id":"https://openalex.org/S158016561","display_name":"Optimization","issn_l":"0233-1934","issn":["0233-1934","1026-7662","1029-4945"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-c","anvur-scientific","cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-1"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W9274362","https://openalex.org/W11852162","https://openalex.org/W75157487","https://openalex.org/W172058465","https://openalex.org/W952811592","https://openalex.org/W1440015328","https://openalex.org/W1590823696","https://openalex.org/W1990494141","https://openalex.org/W1997927517","https://openalex.org/W2000698507","https://openalex.org/W2004447866","https://openalex.org/W2008685729","https://openalex.org/W2012975146","https://openalex.org/W2018434230","https://openalex.org/W2057366835","https://openalex.org/W2116462758","https://openalex.org/W2186273234","https://openalex.org/W2229839854","https://openalex.org/W2340859457","https://openalex.org/W2485305008","https://openalex.org/W2504422903","https://openalex.org/W2586151490","https://openalex.org/W2604776691","https://openalex.org/W2605892009","https://openalex.org/W2754518108","https://openalex.org/W2765418381","https://openalex.org/W2767653264","https://openalex.org/W2784638391","https://openalex.org/W2835899109","https://openalex.org/W2948394288","https://openalex.org/W4225397084","https://openalex.org/W4253214256","https://openalex.org/W4319792579","https://openalex.org/W4365814448","https://openalex.org/W7214680054"],"related_works":["https://openalex.org/W4402337623","https://openalex.org/W4365814448","https://openalex.org/W2014398202","https://openalex.org/W3126525620","https://openalex.org/W2378196437","https://openalex.org/W4391740566","https://openalex.org/W578126237","https://openalex.org/W2087713257","https://openalex.org/W3037462440","https://openalex.org/W7100895386"],"abstract_inverted_index":{"We":[0,25],"give":[1],"necessary":[2,114],"optimality":[3,115],"conditions":[4,116],"for":[5,47],"DC":[6,8,36],"constrained":[7],"optimization":[9],"problems,":[10],"that":[11,40,44,89],"is,":[12],"problems":[13,88,111],"whose":[14],"objective":[15,95],"and":[16],"constraint":[17],"functions":[18],"are":[19,79],"difference":[20],"of":[21,38,86,103,106,109,117,134],"convex":[22,87],"(DC)":[23],"functions.":[24],"then":[26,68],"propose":[27],"a":[28,61,84],"globally":[29],"convergent":[30],"algorithm,":[31],"which":[32],"we":[33,122],"call":[34],"the":[35,55,71,77,91,104,113,124,132,135],"method":[37,82],"centres,":[39],"is":[41,58,70],"to":[42,130],"say":[43],"it":[45],"converges":[46],"every":[48],"starting":[49,56],"point,":[50],"feasible":[51,64],"or":[52,60],"infeasible.":[53,80],"If":[54],"point":[57,62,102],"feasible,":[59],"becomes":[63],"at":[65],"some":[66,127],"iteration,":[67],"so":[69],"entire":[72],"generated":[73],"sequence;":[74],"else":[75],"all":[76],"sequences":[78],"The":[81],"generates":[83],"sequence":[85,105],"incorporate":[90],"constraints":[92],"in":[93],"their":[94],"functions,":[96],"without":[97],"penalty":[98],"techniques.":[99],"Every":[100],"cluster":[101],"optimal":[107],"solutions":[108],"these":[110],"satisfies":[112],"KKT":[118],"criticality":[119],"type.":[120],"Finally,":[121],"conclude":[123],"paper":[125],"with":[126],"numerical":[128],"results":[129],"demonstrate":[131],"performance":[133],"algorithm.":[136]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4417071985","counts_by_year":[],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2025-12-06T00:00:00"}
