{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T16:29:23Z","timestamp":1778516963748,"version":"3.51.4"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,5,20]],"date-time":"2012-05-20T00:00:00Z","timestamp":1337472000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s10107-012-0556-5","type":"journal-article","created":{"date-parts":[[2012,5,20]],"date-time":"2012-05-20T08:57:01Z","timestamp":1337504221000},"page":"183-207","source":"Crossref","is-referenced-by-count":30,"title":["The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets"],"prefix":"10.1007","volume":"136","author":[{"given":"Oliver","family":"Stein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Steuermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,5,20]]},"reference":[{"key":"556_CR1","doi-asserted-by":"crossref","first-page":"1137","DOI":"10.1016\/S0098-1354(98)00027-1","volume":"22","author":"C.S. Adjiman","year":"1998","unstructured":"Adjiman C.S., Androulakis I.P., Floudas C.A.: A global optimization method, \u03b1BB, for general twice-differentiable constrained NLPs\u2014I: theoretical advances. Comput. Chem. Eng. 22, 1137\u20131158 (1998)","journal-title":"Comput. Chem. Eng."},{"key":"556_CR2","doi-asserted-by":"crossref","first-page":"1159","DOI":"10.1016\/S0098-1354(98)00218-X","volume":"22","author":"C.S. Adjiman","year":"1998","unstructured":"Adjiman C.S., Androulakis I.P., Floudas C.A.: A global optimization method, \u03b1BB, for general twice-differentiable constrained NLPs\u2014II: implementation and computational results. Comput. Chem. Eng. 22, 1159\u20131179 (1998)","journal-title":"Comput. Chem. Eng."},{"key":"556_CR3","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10898-004-6455-4","volume":"30","author":"I.G. Akrotirianakis","year":"2004","unstructured":"Akrotirianakis I.G., Floudas C.A.: A new class of improved convex underestimators for twice continuously differentiable constrained NLPs. J. Glob. Optim. 30, 367\u2013390 (2004)","journal-title":"J. Glob. Optim."},{"key":"556_CR4","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10589-005-4556-8","volume":"30","author":"B. Bhattacharjee","year":"2005","unstructured":"Bhattacharjee B., Green W.H., Barton P.I.: Interval methods for semi-infinite programs. Comput. Optim. Appl. 30, 63\u201393 (2005)","journal-title":"Comput. Optim. Appl."},{"key":"556_CR5","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., Barton P.I.: Global solution of semi-infinite programs. Math. Program 103, 283\u2013307 (2005)","journal-title":"Math. Program"},{"key":"556_CR6","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1137\/04060754x","volume":"16","author":"V. Demiguel","year":"2005","unstructured":"Demiguel V., Friedlander M.P., Nogales F.J., Scholtes S.: A two-sided relaxation scheme for mathematical programs with equilibrium constraints. SIAM J. Optim. 16, 587\u2013609 (2005)","journal-title":"SIAM J. Optim."},{"key":"556_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4949-6","volume-title":"Deterministic Global Optimization, Theory, Methods and Applications","author":"C.A. Floudas","year":"2000","unstructured":"Floudas C.A.: Deterministic Global Optimization, Theory, Methods and Applications. Kluwer, Dordrecht (2000)"},{"key":"556_CR8","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s10898-008-9287-9","volume":"42","author":"C.A. Floudas","year":"2008","unstructured":"Floudas C.A., Gounaris C.E.: Tight convex underestimators for C 2-continuous functions: I. Univariate functions. J. Glob. Optim. 42, 51\u201367 (2008)","journal-title":"J. Glob. Optim."},{"key":"556_CR9","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10898-008-9288-8","volume":"42","author":"C.A. Floudas","year":"2008","unstructured":"Floudas C.A., Gounaris C.E.: Tight convex underestimators for C 2-continuous problems: II. Multivariate functions. J. Glob. Optim. 42, 69\u201389 (2008)","journal-title":"J. Glob. Optim."},{"key":"556_CR10","doi-asserted-by":"crossref","first-page":"1187","DOI":"10.1137\/060657741","volume":"18","author":"C. Floudas","year":"2007","unstructured":"Floudas C., Stein O.: The adaptive convexification algorithm: a feasible point method for semi-infinite programming. SIAM J. Optim. 18, 1187\u20131208 (2007)","journal-title":"SIAM J. Optim."},{"key":"556_CR11","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/56.772","volume":"4","author":"T.J. Graettinger","year":"1988","unstructured":"Graettinger T.J., Krogh B.H.: The acceleration radius: a global performance measure for robotic manipulators. IEEE J. Robot. Autom. 4, 60\u201369 (1988)","journal-title":"IEEE J. Robot. Autom."},{"key":"556_CR12","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0012-365X(94)00111-U","volume":"136","author":"P. Gritzmann","year":"1994","unstructured":"Gritzmann P., Klee V.: On the complexity of some basic problems in computational convexity. I. Containment problems. Discr. Math. 136, 129\u2013174 (1994)","journal-title":"Discr. Math."},{"key":"556_CR13","volume-title":"Global Optimization using Interval Analysis","author":"E. Hansen","year":"1992","unstructured":"Hansen E.: Global Optimization using Interval Analysis. Marcel Dekker, New York (1992)"},{"key":"556_CR14","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1137\/1035089","volume":"35","author":"R. Hettich","year":"1993","unstructured":"Hettich R., Kortanek K.: Semi-infinite programming: theory, methods and applications. SIAM Rev. 35, 380\u2013429 (1993)","journal-title":"SIAM Rev."},{"key":"556_CR15","first-page":"112","volume-title":"Parametric Optimization and Related Topics II.","author":"R. Hettich","year":"1991","unstructured":"Hettich R., Still G.: Semi-infinite programming models in robotics. In: Guddat, J., Jongen, H.Th., Kummer, B., No\u017ei\u010dka, F. (eds.) Parametric Optimization and Related Topics II., pp. 112\u2013118. Akademie Verlag, Berlin (1991)"},{"key":"556_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-93108-5","volume-title":"Numerische methoden der approximation und semi-infiniten optimierung","author":"R. Hettich","year":"1982","unstructured":"Hettich R., Zencke P.: Numerische methoden der approximation und semi-infiniten optimierung. Teubner, Stuttgart (1982)"},{"key":"556_CR17","first-page":"187","volume-title":"Studies and Essays, R. Courant Anniversary Volume","author":"F. John","year":"1948","unstructured":"John F.: Extremum problems with inequalities as subsidiary conditions. In: Studies and Essays, R. Courant Anniversary Volume, pp. 187\u2013204. Interscience, New York (1948)"},{"key":"556_CR18","unstructured":"Lemonidis, P.: Global optimization algorithms for semi-infinite and generalized semi-infinite programs. PhD Thesis, Massachusetts Institute of Technology (2007)"},{"key":"556_CR19","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/s10898-007-9260-z","volume":"42","author":"A. Mitsos","year":"2008","unstructured":"Mitsos A., Lemonidis P., Barton P.I.: Global solution of bilevel programs with a nonconvex inner program. J. Glob. Optim. 42, 475\u2013513 (2008)","journal-title":"J. Glob. Optim."},{"key":"556_CR20","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/060674685","volume":"19","author":"A. Mitsos","year":"2007","unstructured":"Mitsos A., Lemonidis P., Lee C.K., Barton P.I.: Relaxation-based bounds for semi-infinite programs. SIAM J. Optim. 19, 77\u2013113 (2007)","journal-title":"SIAM J. Optim."},{"key":"556_CR21","volume-title":"Interval Methods for Systems of Equations","author":"A. Neumaier","year":"1990","unstructured":"Neumaier A.: Interval Methods for Systems of Equations. Cambridge University Press, Cambridge (1990)"},{"key":"556_CR22","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01585697","volume":"53","author":"V.H. Nguyen","year":"1992","unstructured":"Nguyen V.H., Strodiot J.J.: Computing a global optimal solution to a design centering problem. Math. Program 53, 111\u2013123 (1992)","journal-title":"Math. Program"},{"key":"556_CR23","first-page":"299","volume":"79","author":"J.-S. Pang","year":"1997","unstructured":"Pang J.-S.: Error bounds in mathematical programming. Math. Progam 79, 299\u2013332 (1997)","journal-title":"Math. Progam"},{"key":"556_CR24","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1137\/1029002","volume":"29","author":"E. Polak","year":"1987","unstructured":"Polak E.: On the mathematical foundation of nondifferentiable optimization in engineering design. SIAM Rev. 29, 21\u201389 (1987)","journal-title":"SIAM Rev."},{"key":"556_CR25","volume-title":"Optimization Algorithms and Consistent Approximations","author":"E. Polak","year":"1997","unstructured":"Polak E.: Optimization Algorithms and Consistent Approximations. Springer, Berlin (1997)"},{"key":"556_CR26","doi-asserted-by":"crossref","unstructured":"Reemtsen, R., G\u00f6rner, S.: In: Reemtsen, R., R\u00fcckmann, J. (eds.) Numerical Methods for Semi-Infinite Programming: A survey in Semi-Infinite Programming pp. 195\u2013275. Kluwer, Boston (1998)","DOI":"10.1007\/978-1-4757-2868-2_7"},{"key":"556_CR27","unstructured":"Rump, S.M.: INTLAB\u2014INTerval LABoratory, Institute for Reliable Computing, Hamburg University of Technology, Hamburg (2008). http:\/\/www.ti3.tu-harburg.de\/rump\/intlab"},{"key":"556_CR28","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1137\/S1052623499361233","volume":"11","author":"S. Scholtes","year":"2001","unstructured":"Scholtes S.: Convergence properties of a regularization scheme for mathematical programs with complementarity constraints. SIAM J. Optim. 11, 918\u2013936 (2001)","journal-title":"SIAM J. Optim."},{"key":"556_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9164-5","volume-title":"Bi-level strategies in semi-infinite programming","author":"O. Stein","year":"2003","unstructured":"Stein O.: Bi-level strategies in semi-infinite programming. Kluwer, Boston (2003)"},{"key":"556_CR30","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-010-0345-y","volume":"131","author":"O. Stein","year":"2012","unstructured":"Stein O.: Lifting mathematical programs with complementarity constraints. Math. Program. 131, 71\u201394 (2012)","journal-title":"Math. Program."},{"key":"556_CR31","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1016\/S0377-2217(01)00307-1","volume":"142","author":"O. Stein","year":"2002","unstructured":"Stein O., Still G.: On generalized semi-infinite optimization and bilevel optimization. Eur. J. Oper. Res. 142, 444\u2013462 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"556_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S1052623403426556","volume":"16","author":"A. W\u00e4chter","year":"2005","unstructured":"W\u00e4chter A., Biegler L.T.: Line Search filter methods for nonlinear programming: motivation and global convergence. SIAM J. Optim. 16, 1\u201331 (2005)","journal-title":"SIAM J. Optim."},{"key":"556_CR33","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1137\/S1052623403426544","volume":"16","author":"A. W\u00e4chter","year":"2005","unstructured":"W\u00e4chter A., Biegler L.T.: Line search filter methods for nonlinear programming: local convergence. SIAM J. Optim. 16, 32\u201348 (2005)","journal-title":"SIAM J. Optim."},{"key":"556_CR34","unstructured":"Winterfeld, A.: Maximizing volumes of lapidaries by use of hierarchical GSIP-models. Diploma thesis, Technische Universit\u00e4t Kaiserslautern and Fraunhofer Institut f\u00fcr Techno- und Wirtschaftsmathematik (2004)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0556-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0556-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0556-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T18:42:21Z","timestamp":1561747341000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0556-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,20]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["556"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0556-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,20]]}}}