{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T18:54:41Z","timestamp":1774119281714,"version":"3.50.1"},"reference-count":38,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2015,11,1]],"date-time":"2015-11-01T00:00:00Z","timestamp":1446336000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2015,11,1]],"date-time":"2015-11-01T00:00:00Z","timestamp":1446336000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s13675-015-0039-6","type":"journal-article","created":{"date-parts":[[2015,6,8]],"date-time":"2015-06-08T05:26:33Z","timestamp":1433741193000},"page":"309-348","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":15,"title":["An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness"],"prefix":"10.1016","volume":"3","author":[{"given":"Martin","family":"Schmidt","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1007\/s13675-015-0039-6_CR1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/PL00011391","article-title":"A trust region method based on interior point techniques for nonlinear programming","volume":"89","author":"Byrd","year":"2000","journal-title":"Math Program Ser B"},{"key":"10.1007\/s13675-015-0039-6_CR2","doi-asserted-by":"crossref","unstructured":"Clarke FH (1990) Optimization and nonsmooth analysis. Soc Ind Appl Math. doi:10.1137\/1.9781611971309","DOI":"10.1137\/1.9781611971309"},{"key":"10.1007\/s13675-015-0039-6_CR3","series-title":"Nonsmooth analysis and control theory. Graduate texts in mathematics","author":"Clarke","year":"1998"},{"key":"10.1007\/s13675-015-0039-6_CR4","doi-asserted-by":"crossref","unstructured":"Conn AR, Gould NIM, Toint P (2000) Trust-region methods. MPS-SIAM series on optimization. SIAM","DOI":"10.1137\/1.9780898719857"},{"key":"10.1007\/s13675-015-0039-6_CR5","unstructured":"CPLEX (2013) User\u2019s manual for CPLEX. IBM Corporation, Armonk, USA, 12.6 edn"},{"key":"10.1007\/s13675-015-0039-6_CR6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","article-title":"Benchmarking optimization software with performance profiles","volume":"91","author":"Dolan","year":"2002","journal-title":"Math Program"},{"key":"10.1007\/s13675-015-0039-6_CR7","doi-asserted-by":"crossref","unstructured":"F\u00fcgenschuh A, Gei\u00dfler B, Gollmer R, Hayn C, Henrion R, Hiller B, Humpola J, Koch T, Lehmann T, Martin A, Mirkov R, Morsi A, R\u00f6vekamp J, Schewe L, Schmidt M, Schultz R, Schwarz R, Schweiger J, Stangl C, Steinbach MC, Willert BM (2013) Mathematical optimization for challenging network planning problems in unbundled liberalized gas markets. Energy Syst 1\u201325. doi:10.1007\/s12667-013-0099-8","DOI":"10.1007\/s12667-013-0099-8"},{"key":"10.1007\/s13675-015-0039-6_CR8","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s101070100244","article-title":"Nonlinear programming without a penalty function","volume":"91","author":"Fletcher","year":"2000","journal-title":"Math Program"},{"issue":"4","key":"10.1007\/s13675-015-0039-6_CR9","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1137\/S0036144502414942","article-title":"Interior methods for nonlinear optimization","volume":"44","author":"Forsgren","year":"2002","journal-title":"SIAM Rev"},{"issue":"1","key":"10.1007\/s13675-015-0039-6_CR10","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1080\/10556780410001648112","article-title":"A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization","volume":"19","author":"Fuduli","year":"2004","journal-title":"Optim Methods Softw"},{"key":"10.1007\/s13675-015-0039-6_CR11","doi-asserted-by":"crossref","unstructured":"Gei\u00dfler B, Martin A, Morsi A, Schewe L (2012) Using piecewise linear functions for solving MINLPs. In: Lee J, Leyffer S (eds) Mixed integer nonlinear programming. The IMA volumes in mathematics and its applications, vol. 154. Springer, New York. pp 287\u2013314. doi:10.1007\/978-1-4614-1927-3_10","DOI":"10.1007\/978-1-4614-1927-3_10"},{"key":"10.1007\/s13675-015-0039-6_CR12","doi-asserted-by":"crossref","unstructured":"Gei\u00dfler B, Morsi A, Schewe L (2013) A new algorithm for MINLP applied to gas transport energy cost minimization. In: J\u00fcnger M, Reinelt G (eds) Facets of combinatorial optimization. Springer, Berlin, Heidelberg. pp 321\u2013353. doi:10.1007\/978-3-642-38189-8_14","DOI":"10.1007\/978-3-642-38189-8_14"},{"key":"10.1007\/s13675-015-0039-6_CR13","unstructured":"Golub GH, van Loan CF (1989) Matrix computations, 2nd edn. Johns Hopkins University Press, Baltimore. 0733.65016."},{"key":"10.1007\/s13675-015-0039-6_CR14","unstructured":"Grothey A (2002) A second order trust region bundle method for nonconvex nonsmooth optimization. Tech. Rep. Report MS02-001, University of Edinburgh"},{"key":"10.1007\/s13675-015-0039-6_CR15","series-title":"Gurobi optimizer reference manual, version 5.6","author":"Gu","year":"2003"},{"key":"10.1007\/s13675-015-0039-6_CR16","doi-asserted-by":"crossref","unstructured":"Hiller B, Humpola J, Lehmann T, Lenz R, Morsi A, Pfetsch ME, Schewe L, Schmidt M, Schwarz R, Schweiger J, Stangl C, Willert BM Computational results for validation of nominations. In: Koch et al. [23], chap 12, pp 233\u2013270. doi:10.1137\/1.9781611973693","DOI":"10.1137\/1.9781611973693.ch12"},{"key":"10.1007\/s13675-015-0039-6_CR17","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty JB, Lemar\u00e9chal C (1993a) Convex analysis and minimization algorithms I: Fundamentals. Grundlehren der mathematischen Wissenschaften, vol. 305. Springer, Berlin","DOI":"10.1007\/978-3-662-02796-7"},{"key":"10.1007\/s13675-015-0039-6_CR18","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty JB, Lemar\u00e9chal C (1993b) Convex analysis and minimization algorithms II: advanced theory and bundle methods. Grundlehren der mathematischen Wissenschaften, vol. 306. Springer, Berlin","DOI":"10.1007\/978-3-662-06409-2"},{"issue":"4","key":"10.1007\/s13675-015-0039-6_CR19","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","article-title":"A new polynomial-time algorithm for linear programming","volume":"4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"key":"10.1007\/s13675-015-0039-6_CR20","unstructured":"Karmitsa N NonSmooth Optimization (NSO) software. http:\/\/napsu.karmitsa.fi\/nsosoftware\/"},{"key":"10.1007\/s13675-015-0039-6_CR21","first-page":"191","article-title":"A polynomial algorithm in linear programming","volume":"20","author":"Khachiyan","year":"1979","journal-title":"Sov Math Doklady"},{"key":"10.1007\/s13675-015-0039-6_CR22","doi-asserted-by":"crossref","unstructured":"Kiwiel KC (1985) Methods of descent for nondifferentiable optimization. Lecture Notes in Math, vol 1133. Springer-Verlag, Berlin, New York","DOI":"10.1007\/BFb0074500"},{"key":"10.1007\/s13675-015-0039-6_CR23","doi-asserted-by":"crossref","unstructured":"Koch T, Hiller B, Pfetsch ME, Schewe L (eds) (2015) Evaluating gas network capacities. SIAM-MOS series on optimization. SIAM. doi:10.1137\/1.9781611973693","DOI":"10.1137\/1.9781611973693"},{"issue":"4","key":"10.1007\/s13675-015-0039-6_CR24","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/0802028","article-title":"On the implementation of a primal-dual interior point method","volume":"2","author":"Mehrotra","year":"1992","journal-title":"SIAM J Optim"},{"issue":"4","key":"10.1007\/s13675-015-0039-6_CR25","doi-asserted-by":"crossref","first-page":"1674","DOI":"10.1137\/060649513","article-title":"Adaptive barrier update strategies for nonlinear interior methods","volume":"19","author":"Nocedal","year":"2009","journal-title":"SIAM J Optim"},{"issue":"1","key":"10.1007\/s13675-015-0039-6_CR26","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1080\/10556788.2014.888426","article-title":"Validation of nominations in gas network optimization: models, methods, and solutions","volume":"30","author":"Pfetsch","year":"2015","journal-title":"Optim Methods Softw"},{"key":"10.1007\/s13675-015-0039-6_CR27","series-title":"Nonlinear optimization","author":"Ruszczy\u0144ski","year":"2006"},{"key":"10.1007\/s13675-015-0039-6_CR28","unstructured":"Schmidt M (2013) A generic interior-point framework for nonsmooth and complementarity constrained nonlinear optimization. Ph.D. thesis, Gottfried Wilhelm Leibniz Universit\u00e4t Hannover"},{"key":"10.1007\/s13675-015-0039-6_CR29","doi-asserted-by":"crossref","unstructured":"Schmidt M, Steinbach MC, Willert BM (2013) A primal heuristic for nonsmooth mixed integer nonlinear optimization. In: J\u00fcnger M, Reinelt G (eds) Facets of combinatorial optimization. Springer, Berlin, Heidelberg, pp 295\u2013320. doi:10.1007\/978-3-642-38189-8_13","DOI":"10.1007\/978-3-642-38189-8_13"},{"issue":"1","key":"10.1007\/s13675-015-0039-6_CR30","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s11081-014-9246-x","article-title":"High detail stationary optimization models for gas networks","volume":"16","author":"Schmidt","year":"2015","journal-title":"Optim Eng"},{"issue":"1","key":"10.1007\/s13675-015-0039-6_CR31","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1137\/S1052623401392123","article-title":"A primal-dual interior-point method for nonlinear programmng with strong global and local convergence properties","volume":"14","author":"Tits","year":"2003","journal-title":"SIAM J Optim"},{"issue":"2","key":"10.1007\/s13675-015-0039-6_CR32","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s10107-003-0477-4","article-title":"A globally convergent primal-dual interior-point filter method for nonlinear programming","volume":"100","author":"Ulbrich","year":"2004","journal-title":"Math Program"},{"key":"10.1007\/s13675-015-0039-6_CR33","series-title":"LOQO user\u2019s manual-version 4.05","author":"Vanderbei","year":"2006"},{"key":"10.1007\/s13675-015-0039-6_CR34","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1023\/A:1008677427361","article-title":"An interior-point algorithm for nonconvex nonlinear programming","volume":"13","author":"Vanderbei","year":"1997","journal-title":"Comput Optim Appl"},{"issue":"3","key":"10.1007\/s13675-015-0039-6_CR35","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/PL00011386","article-title":"Failure of global convergence for a class of interior point methods for nonlinear programming","volume":"88","author":"W\u00e4chter","year":"2000","journal-title":"Math Program"},{"issue":"1","key":"10.1007\/s13675-015-0039-6_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S1052623403426556","article-title":"Line search filter methods for nonlinear programming: motivation and global convergence","volume":"16","author":"W\u00e4chter","year":"2005","journal-title":"SIAM J Optim"},{"issue":"1","key":"10.1007\/s13675-015-0039-6_CR37","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","article-title":"On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming","volume":"106","author":"W\u00e4chter","year":"2006","journal-title":"Math Program"},{"issue":"3","key":"10.1007\/s13675-015-0039-6_CR38","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s10107-004-0560-5","article-title":"An interior algorithm for nonlinear optimization that combines line search and trust region steps","volume":"107","author":"Waltz","year":"2006","journal-title":"Math Program"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-015-0039-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-015-0039-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000496?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000496?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-015-0039-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:45:33Z","timestamp":1761882333000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000496"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["S2192440621000496"],"URL":"https:\/\/doi.org\/10.1007\/s13675-015-0039-6","relation":{},"ISSN":["2192-4406"],"issn-type":[{"value":"2192-4406","type":"print"}],"subject":[],"published":{"date-parts":[[2015,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-015-0039-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}