{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:15:38Z","timestamp":1743077738065,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030588076"},{"type":"electronic","value":"9783030588083"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58808-3_39","type":"book-chapter","created":{"date-parts":[[2020,9,28]],"date-time":"2020-09-28T09:03:00Z","timestamp":1601283780000},"page":"538-551","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Penalty-Based Heuristic DIRECT Method for Constrained Global Optimization"],"prefix":"10.1007","author":[{"given":"M. Fernanda P.","family":"Costa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ana Maria A. C.","family":"Rocha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edite M. G. P.","family":"Fernandes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,29]]},"reference":[{"issue":"1","key":"39_CR1","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00941892","volume":"79","author":"DR Jones","year":"1993","unstructured":"Jones, D.R., Perttunen, C.D., Stuckman, B.E.: Lipschitzian optimization without the Lipschitz constant. J. Optim. Theory Appl. 79(1), 157\u2013181 (1993). Based on exact penalty functions","journal-title":"J. Optim. Theory Appl."},{"key":"39_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-88670-1","volume-title":"Introduction to Nonlinear and Global Optimization. Optimization and its Applications","author":"EMT Hendrix","year":"2010","unstructured":"Hendrix, E.M.T., G.-T\u00f3th, B.: Introduction to Nonlinear and Global Optimization. Optimization and its Applications. Springer, New York (2010). https:\/\/doi.org\/10.1007\/978-0-387-88670-1"},{"key":"39_CR3","series-title":"SpringerBriefs in Optimization","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-7199-2","volume-title":"Deterministic Global Optimization","author":"YD Sergeyev","year":"2017","unstructured":"Sergeyev, Y.D., Kvasov, D.E.: Deterministic Global Optimization. SO. Springer, New York (2017). https:\/\/doi.org\/10.1007\/978-1-4939-7199-2"},{"issue":"1","key":"39_CR4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1023\/A:1017930332101","volume":"21","author":"JM Gablonsky","year":"2001","unstructured":"Gablonsky, J.M., Kelley, C.T.: A locally-biased form of the DIRECT algorithm. J. Glob. Optim. 21(1), 27\u201337 (2001)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"39_CR5","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10589-016-9876-3","volume":"65","author":"G Di Pillo","year":"2016","unstructured":"Di Pillo, G., Liuzzi, G., Lucidi, S., Piccialli, V., Rinaldi, F.: A DIRECT-type approach for derivative-free constrained global optimization. Comput. Optim. Appl. 65(2), 361\u2013397 (2016). https:\/\/doi.org\/10.1007\/s10589-016-9876-3","journal-title":"Comput. Optim. Appl."},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Paulavi$$\\check{c}$$ius, R., Sergeyev, Y.D., Kvasov, D.E., $$\\check{Z}$$ilinskas, J.: Globally-biased DISIMPL algorithm for expensive global optimization. J. Glob. Optim. 59(2\u20133), 545\u2013567 (2014)","DOI":"10.1007\/s10898-014-0180-4"},{"key":"39_CR7","unstructured":"Stripinis, L., Paulavi$$\\check{c}$$ius, R., $$\\check{Z}$$ilinskas, J.: Improved scheme for selection of potentially optimal hyper-rectangles in DIRECT. Optim. Lett. 12(7), 1699\u20131712 (2018)"},{"key":"39_CR8","unstructured":"Costa, M.F.P., Fernandes, E.M.G.P., Rocha, A.M.A.C.: A two-phase heuristic coupled DIRECT method for bound constrained global optimization. In: EUROGEN 2019 Conference Proceedings, 8 p. Guimar\u00e3es, Portugal (2019)"},{"key":"39_CR9","unstructured":"Paulavi$$\\check{c}$$ius, R., $$\\check{Z}$$ilinskas. J.: Simplicial Lipschitz optimization without the Lipschitz constant. J. Glob. Optim. 59, 23\u201340 (2014)"},{"issue":"11","key":"39_CR10","doi-asserted-by":"crossref","first-page":"1441","DOI":"10.1080\/0305215X.2014.971777","volume":"47","author":"H Liu","year":"2015","unstructured":"Liu, H., Xu, S., Wang, X., Wu, J., Song, Y.: A global optimization algorithm for simulation-based problems via the extended DIRECT scheme. Eng. Optim. 47(11), 1441\u20131458 (2015)","journal-title":"Eng. Optim."},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"Paulavi$$\\check{c}$$ius, R., Sergeyev, Y.D., Kvasov, D.E., $$\\check{Z}$$ilinskas, J.: Globally-biased BIRECT algorithm with local accelerators for expensive global optimization. Expert. Syst. Appl. 144, 113052 (2020)","DOI":"10.1016\/j.eswa.2019.113052"},{"issue":"2","key":"39_CR12","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s10898-010-9582-0","volume":"54","author":"G Di Pillo","year":"2012","unstructured":"Di Pillo, G., Lucidi, S., Rinaldi, F.: An approach to constrained global optimization based on exact penalty functions. J. Glob. Optim. 54(2), 251\u2013260 (2012)","journal-title":"J. Glob. Optim."},{"key":"39_CR13","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1007\/s10957-013-0487-1","volume":"164","author":"G Di Pillo","year":"2015","unstructured":"Di Pillo, G., Lucidi, S., Rinaldi, F.: A derivative-free algorithm for constrained global optimization based on exact penalty functions. J. Optim. Theory Appl. 164, 862\u2013882 (2015)","journal-title":"J. Optim. Theory Appl."},{"key":"39_CR14","unstructured":"Stripinis, L., Paulavi$$\\check{c}$$ius, R., $$\\check{Z}$$ilinskas, J.: Penalty functions and two-step selection procedure based DIRECT-type algorithm for constrained global optimization. Struct. Multidisc. Optim. 59, 2155\u20132175 (2019)"},{"key":"39_CR15","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/0-306-48332-7_93","volume-title":"Encyclopedia of Optimization","author":"DR Jones","year":"2001","unstructured":"Jones, D.R.: The DIRECT global optimization algorithm. In: Floudas, C., Pardalos, P. (eds.) Encyclopedia of Optimization, pp. 431\u2013440. Kluwer Academic Publisher, Boston (2001)"},{"issue":"1","key":"39_CR16","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s00158-016-1482-6","volume":"55","author":"H Liu","year":"2016","unstructured":"Liu, H., Xu, S., Chen, X., Wang, X., Ma, Q.: Constrained global optimization via a DIRECT-type constraint-handling technique and an adaptive metamodeling strategy. Struct. Multi. Optim. 55(1), 155\u2013177 (2016). https:\/\/doi.org\/10.1007\/s00158-016-1482-6","journal-title":"Struct. Multi. Optim."},{"issue":"3","key":"39_CR17","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s10898-017-0596-8","volume":"71","author":"MFP Costa","year":"2017","unstructured":"Costa, M.F.P., Rocha, A.M.A.C., Fernandes, E.M.G.P.: Filter-based DIRECT method for constrained global optimization. J. Glob. Optim. 71(3), 517\u2013536 (2017). https:\/\/doi.org\/10.1007\/s10898-017-0596-8","journal-title":"J. Glob. Optim."},{"key":"39_CR18","unstructured":"Gablonsky, J.M.: DIRECT version 2.0 user guide. Technical report CRSC-TR-01-08, Center for Research in Scientific Computation, North Carolina State University (2001)"},{"key":"39_CR19","unstructured":"Birgin, E.G., Floudas, C.A., Mart\u00ednez, J.M.: Global minimization using an Augmented Lagrangian method with variable lower-level constraints. Technical report MCDO121206, Department of Computer Science IME-USP, University of S\u00e3o Paulo (2007). http:\/\/www.ime.usp.br\/~egbirgin\/"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58808-3_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T11:45:54Z","timestamp":1619178354000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58808-3_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030588076","9783030588083"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58808-3_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cagliari","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iccsa.org\/","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":"Cyber chair 4","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1450","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":"466","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":"32","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":"32% - 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":"2.5","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":"6","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Conference was held virtually due to COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}