{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:29Z","timestamp":1740122429787,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,10,28]],"date-time":"2016-10-28T00:00:00Z","timestamp":1477612800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund (AT)","doi-asserted-by":"publisher","award":["P22239-N13"],"award-info":[{"award-number":["P22239-N13"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s10898-016-0473-x","type":"journal-article","created":{"date-parts":[[2016,10,28]],"date-time":"2016-10-28T00:55:12Z","timestamp":1477616112000},"page":"157-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Certificates of infeasibility via nonsmooth optimization"],"prefix":"10.1007","volume":"69","author":[{"given":"Hannes","family":"Fendl","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Arnold","family":"Neumaier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0183-9150","authenticated-orcid":false,"given":"Hermann","family":"Schichl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,28]]},"reference":[{"key":"473_CR1","volume-title":"Introduction to Interval Computations","author":"G Alefeld","year":"1983","unstructured":"Alefeld, G., Herzberger, J.: Introduction to Interval Computations. Academic Press, New York, NY (1983)"},{"key":"473_CR2","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s10107-002-0349-3","volume":"95","author":"ED Andersen","year":"2003","unstructured":"Andersen, E.D., Roos, C., Terlaky, T.: On implementing a primal-dual interior-point method for conic quadratic optimization. Math. Program. B 95, 249\u2013277 (2003)","journal-title":"Math. Program. B"},{"key":"473_CR3","unstructured":"Berkelaar, M., Eikland, K., Notebaert, P.: lp_solve. Open source (Mixed-Integer) linear programming system (Version 5.1.0.0). http:\/\/lpsolve.sourceforge.net\/ (2004). May 2004"},{"key":"473_CR4","first-page":"375","volume":"22","author":"JC Burkill","year":"1924","unstructured":"Burkill, J.C.: Functions of intervals. Proc. London Math. Soc. 22, 375\u2013446 (1924)","journal-title":"Proc. London Math. Soc."},{"key":"473_CR5","unstructured":"Domes, F.: GloptLab\u2014a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems. Opt. Methods Softw. 24 (4\u20135), 727\u2013747 (2009). http:\/\/www.mat.univie.ac.at\/~dferi\/gloptlab.html"},{"key":"473_CR6","unstructured":"Fendl, H.: A feasible second order bundle algorithm for nonsmooth, nonconvex optimization problems with inequality constraints and its application to certificates of infeasibility. Ph.D. thesis, Universit\u00e4t Wien (2011). http:\/\/othes.univie.ac.at\/17383\/"},{"key":"473_CR7","doi-asserted-by":"crossref","unstructured":"Fendl, H., Neumaier, A., Schichl, H.: Certificates of infeasibility via nonsmooth optimization. arXiv preprint arXiv:1506.08338 (2015)","DOI":"10.1007\/s10898-016-0473-x"},{"key":"473_CR8","unstructured":"Fendl, H., Schichl, H.: A feasible second order bundle algorithm for nonsmooth, nonconvex optimization problems with inequality constraints: I. derivation and convergence. arXiv preprint arXiv:1506.07937 (2015a)"},{"key":"473_CR9","unstructured":"Fendl, H., Schichl, H.: A feasible second order bundle algorithm for nonsmooth nonconvex optimization problems with inequality constraints: II. Implementation and numerical results. arXiv preprint arXiv:1506.08021 (2015b)"},{"key":"473_CR10","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195100563.001.0001","volume-title":"Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications","author":"CA Floudas","year":"1995","unstructured":"Floudas, C.A.: Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications. Oxford University Press, Oxford (1995)"},{"key":"473_CR11","volume-title":"Deterministic Global Optimization: Theory Algorithms and Applications","author":"CA Floudas","year":"1999","unstructured":"Floudas, C.A.: Deterministic Global Optimization: Theory Algorithms and Applications. Kluwer, Dordrecht (1999)"},{"volume-title":"Automatic Differentiation of Algorithms: Theory, Implementation, and Application","year":"1991","key":"473_CR12","unstructured":"Griewank, A., Corliss, G.F. (eds.): Automatic Differentiation of Algorithms: Theory, Implementation, and Application. SIAM, Philadelphia, PA (1991)"},{"key":"473_CR13","volume-title":"Global Optimization Using Interval Analysis","author":"ER Hansen","year":"1992","unstructured":"Hansen, E.R.: Global Optimization Using Interval Analysis. Dekker, New York (1992)"},{"issue":"5","key":"473_CR14","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1145\/502102.502106","volume":"48","author":"TJ Hickey","year":"2001","unstructured":"Hickey, T.J., Ju, Q., Van Emden, M.H.: Interval arithmetic: from principles to implementation. J. ACM 48(5), 1038\u20131068 (2001)","journal-title":"J. ACM"},{"key":"473_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-0249-6","volume-title":"Applied Interval Analysis","author":"L Jaulin","year":"2001","unstructured":"Jaulin, L., Kieffer, M., Didrit, O., Walter, E.: Applied Interval Analysis, 1st edn. Springer, Berlin (2001). (ISBN 1-85233-219-0)","edition":"1"},{"issue":"2","key":"473_CR16","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1023\/A:1008739111712","volume":"15","author":"F Kappel","year":"2000","unstructured":"Kappel, F., Kuntsevich, A.V.: An implementation of Shor\u2019s r-algorithm. Comput. Opt. Appl. 15(2), 193\u2013205 (2000)","journal-title":"Comput. Opt. Appl."},{"issue":"1","key":"473_CR17","first-page":"95","volume":"2","author":"BR Kearfott","year":"1996","unstructured":"Kearfott, B.R.: Interval computations: introduction, uses, and resources. Euromath Bull. 2(1), 95\u2013112 (1996a)","journal-title":"Euromath Bull."},{"key":"473_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2495-0","volume-title":"Rigorous Global Search: Continuous Problems","author":"RB Kearfott","year":"1996","unstructured":"Kearfott, R.B.: Rigorous Global Search: Continuous Problems. Kluwer, Dordrecht (1996b)"},{"key":"473_CR19","unstructured":"Kuntsevich, A.V., Kappel, F.: SolvOpt the solver for local nonlinear optimization problems. Karl-Franzens Universit\u00e4t Graz, (1997). http:\/\/www.kfunigraz.ac.at\/imawww\/kuntsevich\/solvopt\/ (1997)"},{"key":"473_CR20","unstructured":"Lobo, M.S., Vandenberghe, L., Boyd, S.: socp Software for second-order cone programming user\u2019s guide, (April 1997). http:\/\/stanford.edu\/~boyd\/old_software\/SOCP.html (1997)"},{"key":"473_CR21","unstructured":"Luk\u0161an, L., Vl\u010dek, J.: PBUN, PNEW\u2014Bundle-type algorithms for nonsmooth optimization. Technical report 718, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, Czech Republic, (September 1997). http:\/\/www.uivt.cas.cz\/~luksan\/subroutines.html (1997)"},{"key":"473_CR22","first-page":"373","volume":"83","author":"L Luk\u0161an","year":"1998","unstructured":"Luk\u0161an, L., Vl\u010dek, J.: A bundle-Newton method for nonsmooth unconstrained minimization. Math. Program. 83, 373\u2013391 (1998)","journal-title":"Math. Program."},{"key":"473_CR23","unstructured":"M\u00e4kel\u00e4, M.M.: Multiobjective proximal bundle method for nonconvex nonsmooth optimization: FORTRAN subroutine MPBNGC 2.0. Reports of the Department of Mathematical Information Technology, Series B. Scientific computing, B 13\/2003 University of Jyv\u00e4skyl\u00e4, Jyv\u00e4skyl\u00e4, (2003).\u00a0 http:\/\/napsu.karmitsa.fi\/proxbundle\/ (2003)"},{"key":"473_CR24","volume-title":"Automatic Error Analysis in Digital Computation. Technical Report LMSD-84821","author":"RE Moore","year":"1959","unstructured":"Moore, R.E.: Automatic Error Analysis in Digital Computation. Technical Report LMSD-84821. Missiles and Space Division, Lockheed Aircraft Corporation, Sunnyvale, CA (1959)"},{"key":"473_CR25","volume-title":"Interval Analysis","author":"RE Moore","year":"1966","unstructured":"Moore, R.E.: Interval Analysis. Prentice Hall, Englewood Cliffs, NJ (1966)"},{"key":"473_CR26","volume-title":"Interval Methods for Systems of Equations. Encyclopedia of Mathematics and its Applications","author":"A Neumaier","year":"1990","unstructured":"Neumaier, A.: Interval Methods for Systems of Equations. Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (1990a)"},{"key":"473_CR27","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1017\/S0962492904000194","volume":"13","author":"A Neumaier","year":"2004","unstructured":"Neumaier, A.: Complete search in continuous global optimization and constraint satisfaction. Acta Numer. 13, 271\u2013369 (2004)","journal-title":"Acta Numer."},{"key":"473_CR28","volume-title":"Interval Methods for Systems of Equations","author":"Arnold Neumaier","year":"1990","unstructured":"Neumaier, Arnold: Interval Methods for Systems of Equations. Cambridge University Press, Cambridge (1990b)"},{"key":"473_CR29","unstructured":"P\u00f3lik, I.: Addendum to the SeDuMi user guide version 1.1, (June 2005). http:\/\/sedumi.ie.lehigh.edu\/ (2005)"},{"key":"473_CR30","doi-asserted-by":"crossref","unstructured":"Rump, S.M.: INTLAB\u2014interval laboratory. In: Csendes, T. (ed.) Developments in Reliable Computing, pp. 77\u2013104. Kluwer Academic Publishers, Dordrecht, (1999). http:\/\/www.ti3.tu-harburg.de\/~rump\/intlab\/","DOI":"10.1007\/978-94-017-1247-7_7"},{"key":"473_CR31","unstructured":"Sahinidis, N.V.: BARON. Branch and reduce optimization navigator. User\u2019s manual. WWW-Document. http:\/\/archimedes.scs.uiuc.edu\/baron\/baron.html (2000)"},{"issue":"2","key":"473_CR32","doi-asserted-by":"crossref","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. Global Opt. 8(2), 201\u2013205 (1996)","journal-title":"J. Global Opt."},{"key":"473_CR33","unstructured":"Schichl, H.: The COCONUT environment. Software package. http:\/\/www.mat.univie.ac.at\/coconut-environment\/"},{"key":"473_CR34","unstructured":"Schichl, H.: Mathematical Modeling and Global Optimization. Habilitation thesis, Universit\u00e4t Wien, Nov 2003 (2003)"},{"key":"473_CR35","series-title":"Numerical Software with Result Verification","first-page":"277","volume-title":"Global optimization in the COCONUT project","author":"H Schichl","year":"2004","unstructured":"Schichl, H.: Global optimization in the COCONUT project. Numerical Software with Result Verification, pp. 277\u2013293. Springer, Berlin (2004)"},{"key":"473_CR36","volume-title":"Optimization Modeling with LINGO","author":"L Schrage","year":"1999","unstructured":"Schrage, L.: Optimization Modeling with LINGO. LINDO Systems Inc, Chicago, Il (1999)"},{"key":"473_CR37","doi-asserted-by":"crossref","unstructured":"Sturm, J.F.: Using SeDuMi 1.02, A MATLAB Toolbox for optimization over symmetric cones (Updated for Version 1.05). Department of Econometrics, Tilburg University, Tilburg, The Netherlads, 1998 \u2013 2001","DOI":"10.1080\/10556789908805766"},{"key":"473_CR38","first-page":"29","volume":"2","author":"T Sunaga","year":"1958","unstructured":"Sunaga, T.: Theory of an interval algebra and its applications to numerical analysis. RAAG Memoirs 2, 29\u201346 (1958)","journal-title":"RAAG Memoirs"},{"key":"473_CR39","unstructured":"Toh, K.C., T\u00fct\u00fcnc\u00fc, R.H., Todd, M.J.: On the implementation and usage of SDPT3 \u2013 a MATLAB software package for semidefinite-quadratic-linear programming, version 4.0, (July 2006). Draft. http:\/\/www.math.nus.edu.sg\/~mattohkc\/sdpt3.html (2006)"},{"issue":"5","key":"473_CR40","first-page":"253","volume":"IV","author":"M Warmus","year":"1956","unstructured":"Warmus, M.: Caculus of approximations. Bulletin de l\u2019Acad\u00e9mie Polonaise des Sciences IV(5), 253\u2013259 (1956)","journal-title":"Bulletin de l\u2019Acad\u00e9mie Polonaise des Sciences"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-016-0473-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-016-0473-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-016-0473-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T17:40:42Z","timestamp":1657561242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-016-0473-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,28]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["473"],"URL":"https:\/\/doi.org\/10.1007\/s10898-016-0473-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2016,10,28]]}}}