{"id":"https://openalex.org/W4319792579","doi":"https://doi.org/10.1080/10556788.2023.2167992","title":"Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints","display_name":"Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints","publication_year":2023,"publication_date":"2023-02-03","ids":{"openalex":"https://openalex.org/W4319792579","doi":"https://doi.org/10.1080/10556788.2023.2167992"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2023.2167992","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2023.2167992","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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/A5000808861","display_name":"\u041c. \u0412. \u0414\u043e\u043b\u0433\u043e\u043f\u043e\u043b\u0438\u043a","orcid":"https://orcid.org/0000-0003-0677-0797"},"institutions":[{"id":"https://openalex.org/I4210142628","display_name":"Institute of Problems of Mechanical Engineering","ror":"https://ror.org/047pt5178","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210142628","https://openalex.org/I4210164537"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"M. V. Dolgopolik","raw_affiliation_strings":["Institute for Problems in Mechanical Engineering of the Russian Academy of Sciences, Saint Petersburg, Russia"],"raw_orcid":"https://orcid.org/0000-0003-0677-0797","affiliations":[{"raw_affiliation_string":"Institute for Problems in Mechanical Engineering of the Russian Academy of Sciences, Saint Petersburg, Russia","institution_ids":["https://openalex.org/I4210142628"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5000808861"],"corresponding_institution_ids":["https://openalex.org/I4210142628"],"apc_list":null,"apc_paid":null,"fwci":0.7266,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.59651818,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":"38","issue":"4","first_page":"668","last_page":"697"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9991000294685364,"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.9991000294685364,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9968000054359436,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9954000115394592,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.8874166011810303},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6931042671203613},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6871803998947144},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5394698977470398},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5141828060150146},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4975018799304962},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4829360842704773},{"id":"https://openalex.org/keywords/bellman-equation","display_name":"Bellman equation","score":0.4691520929336548},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.375612735748291},{"id":"https://openalex.org/keywords/control-theory","display_name":"Control theory (sociology)","score":0.3622431755065918},{"id":"https://openalex.org/keywords/control","display_name":"Control (management)","score":0.2790912687778473},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.05177143216133118}],"concepts":[{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.8874166011810303},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6931042671203613},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6871803998947144},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5394698977470398},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5141828060150146},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4975018799304962},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4829360842704773},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.4691520929336548},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.375612735748291},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.3622431755065918},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.2790912687778473},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.05177143216133118},{"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/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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2023.2167992","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2023.2167992","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6499999761581421,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[{"id":"https://openalex.org/G4870972204","display_name":null,"funder_award_id":"20-71-10032","funder_id":"https://openalex.org/F4320324099","funder_display_name":"Russian Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320324099","display_name":"Russian Science Foundation","ror":"https://ror.org/03y2gwe85"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W9274362","https://openalex.org/W25580798","https://openalex.org/W187184694","https://openalex.org/W1440015328","https://openalex.org/W1530146942","https://openalex.org/W1967660666","https://openalex.org/W1989711444","https://openalex.org/W1990494141","https://openalex.org/W2016836328","https://openalex.org/W2022568122","https://openalex.org/W2038611554","https://openalex.org/W2043339930","https://openalex.org/W2049974979","https://openalex.org/W2051664786","https://openalex.org/W2067684924","https://openalex.org/W2068889684","https://openalex.org/W2079309016","https://openalex.org/W2083029110","https://openalex.org/W2090395694","https://openalex.org/W2113642685","https://openalex.org/W2221524898","https://openalex.org/W2261918559","https://openalex.org/W2485305008","https://openalex.org/W2561526916","https://openalex.org/W2754518108","https://openalex.org/W2784638391","https://openalex.org/W2796925970","https://openalex.org/W2807122385","https://openalex.org/W2810034112","https://openalex.org/W2898522262","https://openalex.org/W2905422092","https://openalex.org/W2918733380","https://openalex.org/W2924141044","https://openalex.org/W2929787504","https://openalex.org/W2957841223","https://openalex.org/W2971960947","https://openalex.org/W3007729993","https://openalex.org/W3012148517","https://openalex.org/W3021186089","https://openalex.org/W3025582638","https://openalex.org/W3088449319","https://openalex.org/W3105314490","https://openalex.org/W3110176297","https://openalex.org/W4249667877"],"related_works":["https://openalex.org/W2062802260","https://openalex.org/W3134574304","https://openalex.org/W1977335770","https://openalex.org/W2175677697","https://openalex.org/W3180934676","https://openalex.org/W2766314973","https://openalex.org/W2058809596","https://openalex.org/W2091724753","https://openalex.org/W2358930476","https://openalex.org/W4387635768"],"abstract_inverted_index":{"We":[0,70],"propose":[1],"and":[2,27,53,79],"study":[3],"a":[4,63,72],"version":[5],"of":[6,66,76],"the":[7,13,47,67,77,86],"DCA":[8],"(Difference-of-Convex":[9],"functions":[10],"Algorithm)":[11],"using":[12],"\u21131":[14],"penalty":[15,35,51,68],"function":[16],"for":[17],"solving":[18,56],"nonsmooth":[19,24,90],"DC":[20,25],"optimisation":[21],"problems":[22],"with":[23],"equality":[26],"inequality":[28],"constraints.":[29],"The":[30],"method":[31,78,87],"employs":[32],"an":[33],"adaptive":[34],"updating":[36],"strategy":[37,43],"to":[38,61,88],"improve":[39],"its":[40,81],"performance.":[41],"This":[42],"is":[44],"based":[45],"on":[46,55],"so-called":[48],"steering":[49],"exact":[50],"methodology":[52],"relies":[54],"some":[57],"auxiliary":[58],"convex":[59],"subproblems":[60],"determine":[62],"suitable":[64],"value":[65],"parameter.":[69],"present":[71],"detailed":[73],"convergence":[74],"analysis":[75],"illustrate":[80],"practical":[82],"performance":[83],"by":[84],"applying":[85],"two":[89],"discrete":[91],"optimal":[92],"control":[93],"problem.":[94]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-15T08:34:33.830935","created_date":"2023-02-11T00:00:00"}