{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:16:49Z","timestamp":1743099409989,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030910587"},{"type":"electronic","value":"9783030910594"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-91059-4_7","type":"book-chapter","created":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T15:02:57Z","timestamp":1636038177000},"page":"94-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computational Study of Local Search Methods for a D.C. Optimization Problem with Inequality Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9942-0977","authenticated-orcid":false,"given":"M. V.","family":"Barkova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4664-6961","authenticated-orcid":false,"given":"A. S.","family":"Strekalovskiy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,5]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-030-22629-9_2","volume-title":"Mathematical Optimization Theory and Operations Research","author":"MV Barkova","year":"2019","unstructured":"Barkova, M.V.: On generating nonconvex optimization test problems. In: Khachay, M., Kochetov, Y., Pardalos, P. (eds.) MOTOR 2019. LNCS, vol. 11548, pp. 21\u201333. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-22629-9_2"},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1080\/10556780701394169","volume":"23","author":"RH Byrd","year":"2008","unstructured":"Byrd, R.H., Nocedal, J., Waltz, R.A.: Steering exact penalty methods for nonlinear programming. Optim. Methods Softw. 23(2), 197\u2013213 (2008)","journal-title":"Optim. Methods Softw."},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01582148","volume":"61","author":"PH Calamai","year":"1993","unstructured":"Calamai, P.H., Vicente, L.N., Judice, J.J.: A new technique for generating quadratic programming test problems. Math. Program. 61, 215\u2013231 (1993). https:\/\/doi.org\/10.1007\/BF01582148","journal-title":"Math. Program."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"046301","DOI":"10.1063\/1.5113902","volume":"11","author":"M Calasan","year":"2019","unstructured":"Calasan, M., Nikitovi\u0107, L., Mujovic, S.: CONOPT solver embedded in GAMS for optimal power flow. J. Renew. Sustain. Energy 11, 046301 (2019)","journal-title":"J. Renew. Sustain. Energy"},{"key":"7_CR5","first-page":"487","volume-title":"Princeton Symposium on Mathematical Programming","author":"AR Colville","year":"1970","unstructured":"Colville, A.R.: A comparative study of nonlinear programming codes. In: Kuhn, H.W. (ed.) Princeton Symposium on Mathematical Programming, pp. 487\u2013501. Princeton University Press, Princeton (1970)"},{"key":"7_CR6","unstructured":"The COCONUT Benchmark. https:\/\/www.mat.univie.ac.at\/~neum\/glopt\/coconut \/Benchmark\/Benchmark.html. Accessed 1 June 2021"},{"key":"7_CR7","unstructured":"Convex Over and Under ENvelopes for Nonlinear Estimation, Couenne, https:\/\/www.coin-or.org\/Couenne. Accessed 1 June 2021"},{"key":"7_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3040-1","volume-title":"Handbook of Test Problems in Local and Global Optimization","author":"CA Floudas","year":"1999","unstructured":"Floudas, C.A., Pardalos, P.M.: Handbook of Test Problems in Local and Global Optimization. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Hesse, R.: A heuristic search procedure for estimating a global solution of nonconvex programming problems. Oper. Res. 21(6), 1177\u20131326, 1267 (1973)","DOI":"10.1287\/opre.21.6.1267"},{"key":"7_CR10","unstructured":"The General Algebraic Modeling System, GAMS. https:\/\/www.gams.com\/. Accessed 1 June 2021"},{"key":"7_CR11","first-page":"459","volume":"8","author":"II Eremin","year":"1966","unstructured":"Eremin, I.I.: The penalty method in convex programming. Soviet Math. Dokl. 8, 459\u2013462 (1966)","journal-title":"Soviet Math. Dokl."},{"key":"7_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02796-7","volume-title":"Convex Analysis and Minimization Algorithms I","author":"J-B Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.-B., Lemarechal, C.: Convex Analysis and Minimization Algorithms I. Springer, Berlin (1993). https:\/\/doi.org\/10.1007\/978-3-662-02796-7"},{"key":"7_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global Optimization: Deterministic Approaches","author":"R Horst","year":"1996","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches. Springer, Berlin (1996). https:\/\/doi.org\/10.1007\/978-3-662-03199-5"},{"key":"7_CR14","unstructured":"MathWorks, MATLAB. https:\/\/www.mathworks.com. Accessed 1 June 2021"},{"key":"7_CR15","unstructured":"LINDOGlobal. https:\/\/www.lindo.com\/. Accessed 1 June 2021"},{"issue":"2","key":"7_CR16","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10898-014-0166-2","volume":"59","author":"R Misener","year":"2014","unstructured":"Misener, R., Floudas, C.A.: ANTIGONE: algorithms for coNTinuous\/integer global optimization of nonlinear equations. J. Glob. Optim. 59(2), 503\u2013526 (2014). https:\/\/doi.org\/10.1007\/s10898-014-0166-2","journal-title":"J. Glob. Optim."},{"key":"7_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-40065-5","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer, New York (2006). https:\/\/doi.org\/10.1007\/978-0-387-40065-5"},{"issue":"2","key":"7_CR18","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"NV Sahinidis","year":"1996","unstructured":"Sahinidis, N.V.: BARON: a general purpose global optimization software package. J. Glob. Optim. 8(2), 201\u2013205 (1996). https:\/\/doi.org\/10.1007\/BF00138693","journal-title":"J. Glob. Optim."},{"key":"7_CR19","unstructured":"SCIP: Solving Constraint Integer Programs. https:\/\/www.scipopt.org\/. Accessed 1 June 2021"},{"key":"7_CR20","volume-title":"Elements of Nonconvex Optimization","author":"AS Strekalovsky","year":"2003","unstructured":"Strekalovsky, A.S.: Elements of Nonconvex Optimization. Nauka, Novosibirsk (2003).(in Russian)"},{"key":"7_CR21","first-page":"73","volume":"255","author":"AS Strekalovsky","year":"2015","unstructured":"Strekalovsky, A.S.: On local search in d.c. optimization problems. Appl. Math. Comput. 255, 73\u201383 (2015)","journal-title":"Appl. Math. Comput."},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-030-34910-3_7","volume-title":"Numerical Nonsmooth Optimization","author":"AS Strekalovsky","year":"2020","unstructured":"Strekalovsky, A.S.: Local search for nonsmooth DC optimization with DC equality and inequality constraints. In: Bagirov, A.M., Gaudioso, M., Karmitsa, N., M\u00e4kel\u00e4, M.M., Taheri, S. (eds.) Numerical Nonsmooth Optimization, pp. 229\u2013261. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-34910-3_7"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.apm.2017.07.031","volume":"58","author":"AS Strekalovsky","year":"2018","unstructured":"Strekalovsky, A.S., Minarchenko, I.M.: A local search method for optimization problem with d.c. inequality constraints. Appl. Math. Model. 58, 229\u2013244 (2018)","journal-title":"Appl. Math. Model."},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Tuy, H.: D.C. optimization: theory, methods and algorithms. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global optimization, pp. 149\u2013216. Kluwer Academic Publisher, Dordrecht (1995)","DOI":"10.1007\/978-1-4615-2025-2_4"}],"container-title":["Lecture Notes in Computer Science","Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91059-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T23:03:47Z","timestamp":1638399827000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91059-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030910587","9783030910594"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91059-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"5 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OPTIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Petrovac","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montenegro","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"optima2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/agora.guru.ru\/display.php?conf=OPTIMA-2021","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"63","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"65% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}