{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:29:07Z","timestamp":1787333347720,"version":"build-2736575974"},"reference-count":29,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[1996,2]]},"abstract":"<jats:p>A new Newton barrier method is proposed for minimizing a sum of Euclidean norms (MSN), $F( x ) = \\sum_{i = 1}^k \\| A_i^T x - b_i \\|_2 $. MSN is a nonsmooth problem because F is not differentiable at any point x where any of the norms is zero. The method used is based on approximating F with a smooth function, which in the limit has the same optimal value as F. MSN is shown to have a dual problem with properties very similar to duality theory in linear programming. This is used in the development of the method and to give a proof of when an optimal solution for the smooth approximation is $\\epsilon $-optimal (measured in the duality gap) for the original problem. An implementation of the algorithm is described for large sparse problems and numerical results are presented for problems with more than 270,000 nonlinear variables. These problems arise from plastic collapse analysis.<\/jats:p>","DOI":"10.1137\/0806006","type":"journal-article","created":{"date-parts":[[2005,2,23]],"date-time":"2005-02-23T05:51:47Z","timestamp":1109137907000},"page":"74-95","source":"Crossref","is-referenced-by-count":34,"title":["An Efficient Newton Barrier Method for Minimizing a Sum of Euclidean Norms"],"prefix":"10.1137","volume":"6","author":[{"given":"Knud D.","family":"Andersen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","first-page":"19","volume":"22","author":"Andersen K.","year":"1993","journal-title":"COAL Bulletin"},{"key":"R2","unstructured":"K. Andersen, E. Christiansen, Limit Analysis with the Dual Affine Scaling Algorithm, 1993, Preprint 26, Dept. Of Math. and Computer Sci., Odense University, J. Comput. Applied Math., to appear"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1177\/109434208700100403"},{"key":"R4","volume-title":"Nonlinear programming: Theory and Algorithms","author":"Bazaraa M.","year":"1993"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0093145"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1007\/BF02591853"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(91)90147-C"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1002\/nme.1620190203"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0079169"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1080\/05695557308974875"},{"key":"R11","volume-title":"Nonlinear programming: Sequential unconstrained minimization techniques","author":"Fiacco A.","year":"1968"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1007\/BF02023049"},{"key":"R13","unstructured":"K. Frisch, The logarithmic potential method of convex programming, Tech. Report, University Institute of Economics, Oslo, Norway, 1955"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1016\/0045-7825(91)90255-5"},{"key":"R15","volume-title":"Computer solution of large sparse positive definite systems","author":"George A.","year":"1981"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592025"},{"key":"R17","first-page":"37","volume-title":"Nonlinear Programming (NATO Summer School, Menton, 1964)","author":"Kuhn H.","year":"1967"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584648"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1137\/0803030"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1145\/214392.214398"},{"key":"R21","unstructured":"I. Lustig, R. Marsten, D. Shanno, Interior point methods for linear programming: Computational state of the art, Technical Report, SOR 92-17, Department of Civil Engineering and Operations Research, Princeton University, Princeton, NJ, 1992"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9617-8_8"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1137\/0802028"},{"key":"R24","volume-title":"Mathematical programming: theory and algorithms","author":"Minoux M.","year":"1986"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588950"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1007\/BF02591963"},{"key":"R27","first-page":"421","volume-title":"Computing methods in applied sciences and engineering, VI (Versailles, 1983)","author":"Overton M.","year":"1984"},{"key":"R28","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580724"},{"key":"R29","doi-asserted-by":"publisher","DOI":"10.1287\/opre.40.1.188"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0806006","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T16:53:08Z","timestamp":1787331188000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0806006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["10.1137\/0806006"],"URL":"https:\/\/doi.org\/10.1137\/0806006","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}