{"id":"https://openalex.org/W7125226867","doi":"https://doi.org/10.1007/s00500-025-10979-0","title":"Extending the descent-ascent algorithm to constrained difference of convex programming","display_name":"Extending the descent-ascent algorithm to constrained difference of convex programming","publication_year":2026,"publication_date":"2026-01-21","ids":{"openalex":"https://openalex.org/W7125226867","doi":"https://doi.org/10.1007/s00500-025-10979-0"},"language":"en","primary_location":{"id":"doi:10.1007/s00500-025-10979-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00500-025-10979-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00500-025-10979-0.pdf","source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Soft Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00500-025-10979-0.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5118394635","display_name":"Narges Araboljadidi","orcid":"https://orcid.org/0000-0002-3334-4032"},"institutions":[{"id":"https://openalex.org/I39268498","display_name":"University of Isfahan","ror":"https://ror.org/05h9t7759","country_code":"IR","type":"education","lineage":["https://openalex.org/I39268498"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Narges Araboljadidi","raw_affiliation_strings":["University of Isfahan, Isfahan, Iran"],"affiliations":[{"raw_affiliation_string":"University of Isfahan, Isfahan, Iran","institution_ids":["https://openalex.org/I39268498"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103845374","display_name":"Pietro D\u2019Alessandro","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pietro D\u2019Alessandro","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5087376257","display_name":"Manlio Gaudioso","orcid":"https://orcid.org/0000-0002-3022-7041"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Manlio Gaudioso","raw_affiliation_strings":["Universit\u00e1 della Calabria, Calabria, Italia"],"affiliations":[{"raw_affiliation_string":"Universit\u00e1 della Calabria, Calabria, Italia","institution_ids":["https://openalex.org/I45204951"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5087376257"],"corresponding_institution_ids":["https://openalex.org/I45204951"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18549747,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"30","issue":"3","first_page":"1561","last_page":"1568"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.37470000982284546,"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.37470000982284546,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.3481999933719635,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.042500000447034836,"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/piecewise","display_name":"Piecewise","score":0.5228999853134155},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5228999853134155},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4740000069141388},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.46970000863075256},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.45170000195503235},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.450300008058548},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4268999993801117},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.42080000042915344},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.4077000021934509},{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.367900013923645}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6256999969482422},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6104000210762024},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.570900022983551},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.5228999853134155},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5228999853134155},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4740000069141388},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.46970000863075256},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.45170000195503235},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.450300008058548},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4268999993801117},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.42080000042915344},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.4077000021934509},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.367900013923645},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3578999936580658},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.35429999232292175},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.350600004196167},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.3452000021934509},{"id":"https://openalex.org/C2778134712","wikidata":"https://www.wikidata.org/wiki/Q1047307","display_name":"Bundle","level":2,"score":0.3427000045776367},{"id":"https://openalex.org/C66690126","wikidata":"https://www.wikidata.org/wiki/Q2914302","display_name":"Concave function","level":3,"score":0.34200000762939453},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.33649998903274536},{"id":"https://openalex.org/C166437778","wikidata":"https://www.wikidata.org/wiki/Q50695","display_name":"Quadratic function","level":3,"score":0.3310999870300293},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.3190000057220459},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3089999854564667},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3034000098705292},{"id":"https://openalex.org/C195064452","wikidata":"https://www.wikidata.org/wiki/Q2823740","display_name":"Active set method","level":4,"score":0.2953999936580658},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.29030001163482666},{"id":"https://openalex.org/C202269582","wikidata":"https://www.wikidata.org/wiki/Q2644277","display_name":"Complementarity (molecular biology)","level":2,"score":0.28540000319480896},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.2816999852657318},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.2752000093460083},{"id":"https://openalex.org/C50862404","wikidata":"https://www.wikidata.org/wiki/Q3075259","display_name":"Proper convex function","level":5,"score":0.26989999413490295},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.2689000070095062},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.2671999931335449},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.2630000114440918},{"id":"https://openalex.org/C17095337","wikidata":"https://www.wikidata.org/wiki/Q2375229","display_name":"Piecewise linear function","level":2,"score":0.2574999928474426},{"id":"https://openalex.org/C58385900","wikidata":"https://www.wikidata.org/wiki/Q5347254","display_name":"Effective domain","level":5,"score":0.2551000118255615},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.25189998745918274},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.2515999972820282}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00500-025-10979-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00500-025-10979-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00500-025-10979-0.pdf","source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Soft Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00500-025-10979-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00500-025-10979-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00500-025-10979-0.pdf","source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Soft Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320324136","display_name":"Universit\u00e0 della Calabria","ror":"https://ror.org/02rc97e94"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7125226867.pdf"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1988778152","https://openalex.org/W1990494141","https://openalex.org/W2082476974","https://openalex.org/W2083029110","https://openalex.org/W2225235077","https://openalex.org/W2343766162","https://openalex.org/W2741434228","https://openalex.org/W2754518108","https://openalex.org/W2810034112","https://openalex.org/W2885667420","https://openalex.org/W2929787504","https://openalex.org/W2993689585","https://openalex.org/W3007729993","https://openalex.org/W3095693947","https://openalex.org/W3110176297","https://openalex.org/W3184658784","https://openalex.org/W4243140258","https://openalex.org/W4253214256","https://openalex.org/W4319792579","https://openalex.org/W4383534552","https://openalex.org/W4386049845","https://openalex.org/W4386994313","https://openalex.org/W4389767465"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"We":[1,42,126],"investigate":[2],"Difference":[3],"of":[4,29,86,106,131,154],"Convex":[5],"(DC)":[6],"constrained":[7],"optimization":[8],"problems":[9],"where":[10],"both":[11,76],"the":[12,16,44,52,69,77,97,107,132,143],"objective":[13,78,93,108],"function":[14],"and":[15,20,37,79,100,129],"constraints":[17,36,59],"are":[18],"DC":[19,47,58],"nonsmooth.":[21],"The":[22,66,146],"problem":[23],"has":[24],"applications":[25],"in":[26,39],"a":[27,61,84,121,135,139,152],"variety":[28],"fields,":[30],"including":[31],"quadratic":[32,88],"programs":[33],"with":[34,142],"complementarity":[35],"classification":[38],"Machine":[40],"Learning.":[41],"introduce":[43],"Constrained":[45],"Descent-Ascent":[46,54],"algorithm":[48,67,133],"(CDADC)":[49],"which":[50],"generalizes":[51],"standard":[53],"framework":[55],"to":[56,72,91,96,113,134],"incorporate":[57],"using":[60],"piecewise":[62],"affine":[63],"approximation":[64],"strategy.":[65],"utilizes":[68],"bundle":[70,118],"technique":[71],"construct":[73],"models":[74],"for":[75],"constraint":[80,101],"functions.":[81],"It":[82],"solves":[83],"sequence":[85],"convex":[87],"subproblems":[89],"designed":[90],"balance":[92],"improvement,":[94],"proximity":[95],"current":[98],"iterate,":[99],"fulfilment.":[102],"CDADC":[103],"avoids":[104],"evaluation":[105],"function\u2019s":[109],"concave":[110],"part":[111],"and,":[112],"minimize":[114],"computational":[115],"effort,":[116],"implements":[117],"resetting":[119],"whenever":[120],"serious":[122],"step":[123],"is":[124,149],"achieved.":[125],"demonstrate":[127],"finiteness":[128],"convergence":[130],"point":[136],"that":[137],"satisfies":[138],"criterion":[140],"associated":[141],"B-stationarity":[144],"notion.":[145],"algorithm\u2019s":[147],"behaviour":[148],"illustrated":[150],"through":[151],"couple":[153],"numerical":[155],"examples":[156]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2026-01-22T00:00:00"}