{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T13:31:20Z","timestamp":1648560680729},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,1,13]],"date-time":"2016-01-13T00:00:00Z","timestamp":1452643200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s11590-015-0995-z","type":"journal-article","created":{"date-parts":[[2016,1,13]],"date-time":"2016-01-13T13:54:54Z","timestamp":1452693294000},"page":"215-218","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Preface to the Special Issue \u201cRecent developments in non-linear and global optimization\u201d"],"prefix":"10.1007","volume":"10","author":[{"given":"Yaroslav D.","family":"Sergeyev","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,13]]},"reference":[{"key":"995_CR1","doi-asserted-by":"crossref","unstructured":"Lucidi, S., Maurici, M., Paulon, L., Rinaldi, F., Roma, M.: A derivative-free approach for a simulation-based optimization problem in healthcare. Optim. Lett. doi: 10.1007\/s11590-015-0905-4","DOI":"10.1007\/s11590-015-0905-4"},{"key":"995_CR2","doi-asserted-by":"crossref","unstructured":"Paulavicius, R., Zilinskas, J.: Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints. Optim. Lett. doi: 10.1007\/s11590-014-0772-4","DOI":"10.1007\/s11590-014-0772-4"},{"key":"995_CR3","doi-asserted-by":"crossref","unstructured":"Shary, S.P., Sharaya, I.A.: On solvability recognition for interval linear systems of equations. Optim. Lett. doi: 10.1007\/s11590-015-0891-6","DOI":"10.1007\/s11590-015-0891-6"},{"key":"995_CR4","doi-asserted-by":"crossref","unstructured":"Pham Dinh, T., Le Thi, H.A., Pham, V.N., Niu, Y.-S.: DC programming approaches for discrete portfolio optimization under concave transaction costs. Opim. Lett. doi: 10.1007\/s11590-015-0931-2","DOI":"10.1007\/s11590-015-0931-2"},{"key":"995_CR5","doi-asserted-by":"crossref","unstructured":"Guzman, Y.A., Faruque Hasan, M.M., Floudas, C.A.: Performance of convex underestimators in a branch-and-bound framework. Optim. Lett. doi: 10.1007\/s11590-014-0799-6","DOI":"10.1007\/s11590-014-0799-6"},{"key":"995_CR6","doi-asserted-by":"crossref","unstructured":"Cerrone, C., Cerulli, R., Gaudioso, M.: OMEGA\u2014one multi ethnic genetic approach. Optim. Lett. doi: 10.1007\/s11590-015-0852-0","DOI":"10.1007\/s11590-015-0852-0"},{"key":"995_CR7","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Sahinidis, N.V.: Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment. Optim. Lett. doi: 10.1007\/s11590-015-0880-9","DOI":"10.1007\/s11590-015-0880-9"},{"key":"995_CR8","doi-asserted-by":"crossref","unstructured":"Zilinskas, A., Zhigljavsky, A.: Branch and probability bound methods in multi-objective optimization. Optim. Lett. doi: 10.1007\/s11590-014-0777-z","DOI":"10.1007\/s11590-014-0777-z"},{"key":"995_CR9","doi-asserted-by":"crossref","unstructured":"Astorino, A., Miglionico, G.: Optimizing sensor cover energy via DC programming. Optim. Lett. doi: 10.1007\/s11590-014-0778-y","DOI":"10.1007\/s11590-014-0778-y"},{"key":"995_CR10","doi-asserted-by":"crossref","unstructured":"Orlov, A.V., Strekalovsky, A.S., Batbileg, S.: On computational search for Nash equilibrium in hexamatrix games. Optim. Lett. doi: 10.1007\/s11590-014-0833-8","DOI":"10.1007\/s11590-014-0833-8"},{"key":"995_CR11","doi-asserted-by":"crossref","unstructured":"Tr\u00f6ltzsch, A.: A sequential quadratic programming algorithm for equality-constrained optimization without derivatives. Optim. Lett. doi: 10.1007\/s11590-014-0830-y","DOI":"10.1007\/s11590-014-0830-y"},{"key":"995_CR12","doi-asserted-by":"crossref","unstructured":"Steihaug, T., Suleiman, S.: On the final steps of Newton and higher order methods. Optim. Lett. doi: 10.1007\/s11590-015-0899-y","DOI":"10.1007\/s11590-015-0899-y"},{"key":"995_CR13","doi-asserted-by":"crossref","unstructured":"Gu\u00e9rard, G., Tseveendorj, I.: Inscribed ball and enclosing box methods for the convex maximization problem. Optim. Lett. doi: 10.1007\/s11590-015-0981-5","DOI":"10.1007\/s11590-015-0981-5"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0995-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0995-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0995-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:44Z","timestamp":1559409104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0995-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,13]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["995"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0995-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,13]]}}}