{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T16:29:22Z","timestamp":1778516962437,"version":"3.51.4"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T00:00:00Z","timestamp":1285027200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s11590-010-0236-4","type":"journal-article","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T01:29:47Z","timestamp":1284946187000},"page":"705-716","source":"Crossref","is-referenced-by-count":26,"title":["A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming"],"prefix":"10.1007","volume":"5","author":[{"given":"Angelos","family":"Tsoukalas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ber\u00e7","family":"Rustem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,9,21]]},"reference":[{"issue":"2","key":"236_CR1","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF00934096","volume":"19","author":"J.W. Blankenship","year":"1976","unstructured":"Blankenship J.W., Falk J.E.: Infinitely constrained optimization problems. J. Optim. Theory Appl. 19(2), 261\u2013281 (1976)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"236_CR2","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1137\/1035089","volume":"35","author":"R. Hettich","year":"1993","unstructured":"Hettich R., Kortanek K.O.: Semi-infinite programming: theory, methods, and applications. SIAM Rev. 35(3), 380\u2013429 (1993)","journal-title":"SIAM Rev."},{"issue":"2, Ser. B","key":"236_CR3","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s10107-005-0583-6","volume":"103","author":"B. Bhattacharjee","year":"2005","unstructured":"Bhattacharjee B., Lemonidis P., Green W.H. Jr, Barton P.I.: Global solution of semi-infinite programs. Math. Program. 103(2, Ser. B), 283\u2013307 (2005)","journal-title":"Math. Program."},{"issue":"4","key":"236_CR4","doi-asserted-by":"crossref","first-page":"1187","DOI":"10.1137\/060657741","volume":"18","author":"C.A. Floudas","year":"2007","unstructured":"Floudas C.A., Stein O.: The adaptive convexification algorithm: a feasible point method for semi-infinite programming. SIAM J. Optim. 18(4), 1187\u20131208 (2007)","journal-title":"SIAM J. Optim."},{"key":"236_CR5","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-0-387-74759-0_3","volume-title":"Encyclopedia of Optimization","author":"O. Stein","year":"2009","unstructured":"Stein O.: Adaptive convexification in semi-infinite optimization. In: Floudas, C.A., Pardalos, P.M. (eds) Encyclopedia of Optimization, pp. 13\u201319. Springer, US (2009)"},{"key":"236_CR6","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/060674685","volume":"19","author":"A. Mitsos","year":"2008","unstructured":"Mitsos A., Lemonidis P., Lee C.K., Barton P.I. et\u00a0al.: Relaxation-based bounds for semi-infinite programs. SIAM J. Optim. 19, 77 (2008)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"236_CR7","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10898-008-9321-y","volume":"44","author":"A. Tsoukalas","year":"2009","unstructured":"Tsoukalas A., Rustem B., Pistikopoulos E.N.: A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems. J. Glob. Optim. 44(2), 235\u2013250 (2009)","journal-title":"J. Glob. Optim."},{"key":"236_CR8","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF00938217","volume":"52","author":"H. Tuy","year":"1987","unstructured":"Tuy H.: Convex programs with an additional reverse convex constraint. J. Optim. Theory Appl. 52, 463\u2013486 (1987)","journal-title":"J. Optim. Theory Appl."},{"key":"236_CR9","doi-asserted-by":"crossref","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)"},{"key":"236_CR10","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/978-3-642-46477-5_13","volume":"215","author":"G. Watson","year":"1983","unstructured":"Watson G.: Numerical Experiments with globally convergent methods for semi-infinite programming problems. Lect. Notes Econ. Math. Syst. 215, 193\u2013205 (1983)","journal-title":"Lect. Notes Econ. Math. Syst."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0236-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-010-0236-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0236-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:11:26Z","timestamp":1559394686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-010-0236-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,21]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["236"],"URL":"https:\/\/doi.org\/10.1007\/s11590-010-0236-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,21]]}}}