{"id":"https://openalex.org/W7116688661","doi":"https://doi.org/10.3390/a19010011","title":"Avoiding the Maratos Effect in Non-Convex Optimization Through Piecewise Convexity: A Case Study in Optimal PMU Placement Problem","display_name":"Avoiding the Maratos Effect in Non-Convex Optimization Through Piecewise Convexity: A Case Study in Optimal PMU Placement Problem","publication_year":2025,"publication_date":"2025-12-22","ids":{"openalex":"https://openalex.org/W7116688661","doi":"https://doi.org/10.3390/a19010011"},"language":"en","primary_location":{"id":"doi:10.3390/a19010011","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a19010011","pdf_url":"https://www.mdpi.com/1999-4893/19/1/11/pdf?version=1766413693","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/19/1/11/pdf?version=1766413693","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048771745","display_name":"Nikolaos P. Theodorakatos","orcid":"https://orcid.org/0000-0002-0666-9544"},"institutions":[{"id":"https://openalex.org/I174458059","display_name":"National Technical University of Athens","ror":"https://ror.org/03cx6bg69","country_code":"GR","type":"education","lineage":["https://openalex.org/I174458059"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Nikolaos P. Theodorakatos","raw_affiliation_strings":["School of Electrical & Computer Engineering, National Technical University of Athens, 157 80 Athens, Greece"],"raw_orcid":"https://orcid.org/0000-0002-0666-9544","affiliations":[{"raw_affiliation_string":"School of Electrical & Computer Engineering, National Technical University of Athens, 157 80 Athens, Greece","institution_ids":["https://openalex.org/I174458059"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052990647","display_name":"Rohit Babu","orcid":"https://orcid.org/0000-0003-4128-4428"},"institutions":[{"id":"https://openalex.org/I2799532815","display_name":"Madan Mohan Malaviya University of Technology","ror":"https://ror.org/04h1w2j35","country_code":"IN","type":"education","lineage":["https://openalex.org/I2799532815"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Rohit Babu","raw_affiliation_strings":["Department of Electrical Engineering, Madan Mohan Malaviya University of Technology, Gorakhpur 273010, India"],"raw_orcid":"https://orcid.org/0000-0003-4128-4428","affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Madan Mohan Malaviya University of Technology, Gorakhpur 273010, India","institution_ids":["https://openalex.org/I2799532815"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019119605","display_name":"Miltiadis D. Lytras","orcid":"https://orcid.org/0000-0002-7281-5458"},"institutions":[{"id":"https://openalex.org/I125656591","display_name":"Effat University","ror":"https://ror.org/02cnwgt19","country_code":"SA","type":"education","lineage":["https://openalex.org/I125656591"]},{"id":"https://openalex.org/I230915877","display_name":"The American College of Greece","ror":"https://ror.org/03vkake80","country_code":"GR","type":"nonprofit","lineage":["https://openalex.org/I230915877"]}],"countries":["GR","SA"],"is_corresponding":false,"raw_author_name":"Miltiadis D. Lytras","raw_affiliation_strings":["Computer Science Department, College of Engineering, Effat University, Jeddah 21478, Saudi Arabia","Department of Management, School of Business and Economics, The American College of Greece, 153 42 Athens, Greece"],"raw_orcid":"https://orcid.org/0000-0002-7281-5458","affiliations":[{"raw_affiliation_string":"Computer Science Department, College of Engineering, Effat University, Jeddah 21478, Saudi Arabia","institution_ids":["https://openalex.org/I125656591"]},{"raw_affiliation_string":"Department of Management, School of Business and Economics, The American College of Greece, 153 42 Athens, Greece","institution_ids":["https://openalex.org/I230915877"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5048771745"],"corresponding_institution_ids":["https://openalex.org/I174458059"],"apc_list":{"value":1600,"currency":"CHF","value_usd":1782},"apc_paid":{"value":1600,"currency":"CHF","value_usd":1782},"fwci":4.5598,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.95454545,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":"19","issue":"1","first_page":"11","last_page":"11"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.7688999772071838,"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.7688999772071838,"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.08659999817609787,"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.06199999898672104,"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/penalty-method","display_name":"Penalty method","score":0.7541999816894531},{"id":"https://openalex.org/keywords/piecewise","display_name":"Piecewise","score":0.7516999840736389},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.6360999941825867},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6004999876022339},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.569100022315979},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.5595999956130981},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.46880000829696655},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.45260000228881836},{"id":"https://openalex.org/keywords/piecewise-linear-function","display_name":"Piecewise linear function","score":0.4088999927043915}],"concepts":[{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.7541999816894531},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.7516999840736389},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6784999966621399},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.6360999941825867},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6004999876022339},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.569100022315979},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.5595999956130981},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.503000020980835},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.46880000829696655},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.45260000228881836},{"id":"https://openalex.org/C17095337","wikidata":"https://www.wikidata.org/wiki/Q2375229","display_name":"Piecewise linear function","level":2,"score":0.4088999927043915},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.4081999957561493},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3894999921321869},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.3824000060558319},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.3707999885082245},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.3644999861717224},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.357699990272522},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.3456999957561493},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.3127000033855438},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.310699999332428},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.3086000084877014},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.2766000032424927},{"id":"https://openalex.org/C116149140","wikidata":"https://www.wikidata.org/wiki/Q2070951","display_name":"Descent direction","level":4,"score":0.2721000015735626},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.27070000767707825},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.2671999931335449},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.26460000872612},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.2635999917984009},{"id":"https://openalex.org/C187633118","wikidata":"https://www.wikidata.org/wiki/Q1317949","display_name":"Economic dispatch","level":4,"score":0.2533000111579895},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.2533000111579895}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/a19010011","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a19010011","pdf_url":"https://www.mdpi.com/1999-4893/19/1/11/pdf?version=1766413693","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:19c02ca028bb47d1bc7a84b1ef4803d1","is_oa":true,"landing_page_url":"https://doaj.org/article/19c02ca028bb47d1bc7a84b1ef4803d1","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 19, Iss 1, p 11 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a19010011","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a19010011","pdf_url":"https://www.mdpi.com/1999-4893/19/1/11/pdf?version=1766413693","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.5404890179634094,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W7116688661.pdf"},"referenced_works_count":85,"referenced_works":["https://openalex.org/W8821478","https://openalex.org/W1967415445","https://openalex.org/W1967942590","https://openalex.org/W1974832488","https://openalex.org/W1976385924","https://openalex.org/W1995343075","https://openalex.org/W2032960059","https://openalex.org/W2038904236","https://openalex.org/W2039926750","https://openalex.org/W2048799772","https://openalex.org/W2061646356","https://openalex.org/W2070753847","https://openalex.org/W2075225328","https://openalex.org/W2106320154","https://openalex.org/W2106424475","https://openalex.org/W2123871098","https://openalex.org/W2127097081","https://openalex.org/W2149974730","https://openalex.org/W2230864361","https://openalex.org/W2264518202","https://openalex.org/W2345929525","https://openalex.org/W2482182218","https://openalex.org/W2508903054","https://openalex.org/W2605980318","https://openalex.org/W2758887022","https://openalex.org/W2767859523","https://openalex.org/W2768004039","https://openalex.org/W2770462281","https://openalex.org/W2784119929","https://openalex.org/W2806998279","https://openalex.org/W2907026419","https://openalex.org/W2907150495","https://openalex.org/W2965926346","https://openalex.org/W2966106606","https://openalex.org/W2970649100","https://openalex.org/W3002328144","https://openalex.org/W3015084552","https://openalex.org/W3036062693","https://openalex.org/W3043564069","https://openalex.org/W3045932516","https://openalex.org/W3097253919","https://openalex.org/W3178467969","https://openalex.org/W4200142529","https://openalex.org/W4220845936","https://openalex.org/W4246776814","https://openalex.org/W4280603538","https://openalex.org/W4283278402","https://openalex.org/W4286586452","https://openalex.org/W4291236916","https://openalex.org/W4309180697","https://openalex.org/W4311532864","https://openalex.org/W4324358988","https://openalex.org/W4367186753","https://openalex.org/W4376275060","https://openalex.org/W4385272716","https://openalex.org/W4387124950","https://openalex.org/W4388499688","https://openalex.org/W4390549805","https://openalex.org/W4396510457","https://openalex.org/W4396512148","https://openalex.org/W4396882890","https://openalex.org/W4399341535","https://openalex.org/W4402040487","https://openalex.org/W4402159180","https://openalex.org/W4403071433","https://openalex.org/W4403331925","https://openalex.org/W4403398407","https://openalex.org/W4404476885","https://openalex.org/W4404973016","https://openalex.org/W4405054800","https://openalex.org/W4405596677","https://openalex.org/W4405621977","https://openalex.org/W4405935009","https://openalex.org/W4409761062","https://openalex.org/W4409919506","https://openalex.org/W4411002274","https://openalex.org/W4411567950","https://openalex.org/W4411611797","https://openalex.org/W4412536748","https://openalex.org/W4412571802","https://openalex.org/W4413556488","https://openalex.org/W4413954741","https://openalex.org/W4415124927","https://openalex.org/W4415357082","https://openalex.org/W4416760652"],"related_works":[],"abstract_inverted_index":{"In":[0],"constrained":[1],"nonlinear":[2],"optimization,":[3],"we":[4],"aim":[5],"to":[6,12,21,28,34,69,94,107,139,141,166],"achieve":[7],"two":[8],"goals:":[9],"one":[10],"is":[11,20,33,84,104,126,155,177],"minimize":[13],"the":[14,18,23,52,58,64,70,73,77,96,150,158,168,174,181,194,200,204,207],"objective":[15,53,102],"function,":[16,189],"and":[17,46,221],"other":[19],"satisfy":[22],"constraints.":[24],"A":[25,100],"common":[26],"way":[27],"balance":[29],"these":[30],"competing":[31],"targets":[32],"use":[35],"penalty":[36,79,188],"functions.":[37],"Suppose":[38],"that":[39,50,199],"an":[40],"algorithm":[41],"generates":[42],"a":[43,48,90,108,129,142,186],"descent":[44],"direction":[45],"produces":[47],"step":[49,75],"decreases":[51],"function":[54,103],"value":[55],"but":[56],"increases":[57],"constraint":[59,111],"violation\u2014a":[60],"phenomenon":[61],"known":[62],"as":[63,128],"Maratos":[65,175],"effect.":[66],"This":[67,87,135],"leads":[68],"rejection":[71],"of":[72,131],"full":[74],"by":[76,179],"non-smooth":[78,187],"function;":[80],"therefore,":[81],"superlinear":[82,147],"convergence":[83,148],"not":[85],"preserved.":[86],"work":[88],"leverages":[89],"piecewise":[91,132,182],"convexity":[92,183],"model":[93],"solve":[95],"optimal":[97],"PMU":[98],"placement.":[99],"quadratic":[101],"minimized":[105],"subject":[106],"non-convex":[109,124],"equality":[110],"within":[112],"box":[113],"constraints":[114],"[0,":[115,118],"1]":[116,119],"\u00d7":[117],"\u2282":[120],"R2.":[121],"The":[122],"initial":[123],"region":[125],"reconsidered":[127],"union":[130],"line":[133,208],"segments.":[134],"decomposition":[136],"enables":[137],"algorithms":[138,201],"converge":[140],"local":[143,169],"optimum":[144],"while":[145],"preserving":[146],"near":[149],"solution.":[151],"An":[152],"analytical":[153],"solution":[154],"presented":[156],"using":[157],"Karush\u2013Kuhn\u2013Tucker":[159],"conditions.":[160],"First-and-second-order":[161],"optimality":[162,222],"conditions":[163],"are":[164,223],"applied":[165],"find":[167],"minimum.":[170],"We":[171],"show":[172],"how":[173],"effect":[176],"avoided":[178],"adopting":[180],"without":[184],"needing":[185],"second-order":[190],"corrections":[191],"or":[192,215],"employing":[193],"watchdog":[195],"methods.":[196],"Simulations":[197],"demonstrate":[198],"partially":[202],"search":[203],"space":[205],"along":[206],"segments\u2014avoiding":[209],"zig-zag":[210],"trajectories\u2014and":[211],"reach":[212],"(0,":[213],"1)":[214],"(1,":[216],"0),":[217],"where":[218],"both":[219],"feasibility":[220],"satisfied":[224],"at":[225],"once.":[226]},"counts_by_year":[{"year":2026,"cited_by_count":3}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-12-22T00:00:00"}
