{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T11:36:59Z","timestamp":1774265819665,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,3,6]],"date-time":"2007-03-06T00:00:00Z","timestamp":1173139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2007,3,6]],"date-time":"2007-03-06T00:00:00Z","timestamp":1173139200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1007\/s10589-007-9011-6","type":"journal-article","created":{"date-parts":[[2007,3,5]],"date-time":"2007-03-05T14:40:05Z","timestamp":1173105605000},"page":"157-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Smoothed penalty algorithms for optimization of nonlinear models"],"prefix":"10.1007","volume":"37","author":[{"given":"M.","family":"Herty","sequence":"first","affiliation":[]},{"given":"A.","family":"Klar","sequence":"additional","affiliation":[]},{"given":"A. K.","family":"Singh","sequence":"additional","affiliation":[]},{"given":"P.","family":"Spellucci","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,3,6]]},"reference":[{"key":"9011_CR1","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1080\/02331939008843594","volume":"21","author":"A. Ben\u00a0Tal","year":"1990","unstructured":"Ben\u00a0Tal,\u00a0A., Melman,\u00a0A., Zowe,\u00a0J.: Curved search methods for unconstrained optimization. Optimization 21, 669 (1990)","journal-title":"Optimization"},{"key":"9011_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF01681332","volume":"9","author":"D.P. Bertsekas","year":"1975","unstructured":"Bertsekas,\u00a0D.P.: Necessary and sufficient conditions for a\u00a0penalty method to be exact. Math. Program. 9, 87 (1975)","journal-title":"Math. Program."},{"key":"9011_CR3","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"D.P. Bertsekas","year":"1982","unstructured":"Bertsekas,\u00a0D.P.: Constrained Optimization and Lagrange Multiplier Methods. Academic, New York (1982)"},{"key":"9011_CR4","series-title":"Mathematical Programming Study","volume-title":"Nondifferentiable Optimization via Approximation","author":"D.P. Bertsekas","year":"1993","unstructured":"Bertsekas,\u00a0D.P.: Nondifferentiable Optimization via Approximation. In: Balinski,\u00a0M., Wolfe,\u00a0P. (eds.) Mathematical Programming Study, vol.\u00a03. North-Holland, Amsterdam (1993)"},{"key":"9011_CR5","volume-title":"Numerical Optimization","author":"J.F. Bonnans","year":"1997","unstructured":"Bonnans,\u00a0J.F., Gilbert,\u00a0J.C., Lemarechal,\u00a0C., Sagastizabal,\u00a0C.A.: Numerical Optimization. Springer, Berlin (1997)"},{"key":"9011_CR6","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1137\/0329054","volume":"29","author":"J.V. Burke","year":"1991","unstructured":"Burke,\u00a0J.V.: An exact penalization viewpoint of constrained optimization. SIAM\u00a0J. Control Opt. 29, 968 (1991)","journal-title":"SIAM\u00a0J. Control Opt."},{"key":"9011_CR7","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.1137\/0916069","volume":"16","author":"R.H. Byrd","year":"1995","unstructured":"Byrd,\u00a0R.H., Lu,\u00a0P., Nocedal,\u00a0J., Zhu,\u00a0C.: A\u00a0limited memory algorithm for bound constrained optimization. SIAM J. Sci. Comput. 16, 1190 (1995)","journal-title":"SIAM J. Sci. Comput."},{"key":"9011_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01582063","volume":"63","author":"R.H. Byrd","year":"1994","unstructured":"Byrd,\u00a0R.H., Nocedal,\u00a0J., Schnabel,\u00a0R.: Representations of quasi-Newton matrices and their use in limited memory methods. Math. Program. 63, 129 (1994)","journal-title":"Math. Program."},{"key":"9011_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01592244","volume":"71","author":"C. Chen","year":"1995","unstructured":"Chen,\u00a0C., Mangasarin,\u00a0O.L.: Smoothing methods for convex inequalities and linear complementarity problems. Math. Program. 71, 1 (1995)","journal-title":"Math. Program."},{"key":"9011_CR10","doi-asserted-by":"publisher","first-page":"1862","DOI":"10.1137\/S0036141004402683","volume":"36","author":"G.M. Coclite","year":"2005","unstructured":"Coclite,\u00a0G.M., Garavello,\u00a0M., Piccoli,\u00a0B.: Traffic flow on road networks. SIAM J. Math. Anal. 36, 1862\u20131886 (2005)","journal-title":"SIAM J. Math. Anal."},{"key":"9011_CR11","unstructured":"Conn,\u00a0A.R., Sinclair,\u00a0J.W.: Quadratic programming via a\u00a0nondifferentiable penalty function. University of Waterloo, Report CORR 75\/15."},{"key":"9011_CR12","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1137\/0317044","volume":"17","author":"G. DiPillo","year":"1979","unstructured":"DiPillo,\u00a0G., Grippo,\u00a0L.: A\u00a0new class of augmented Lagrangians in nonlinear programming. SIAM J. Control Optim. 17, 618 (1979)","journal-title":"SIAM J. Control Optim."},{"key":"9011_CR13","unstructured":"Felkel,\u00a0R.: On a\u00a0bound constrained optimization technique using second order information. Ph.D. thesis, TU Darmstadt (1999)"},{"key":"9011_CR14","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/040605503","volume":"16","author":"A. F\u00fcgenschuh","year":"2006","unstructured":"F\u00fcgenschuh,\u00a0A., Herty,\u00a0M., Klar,\u00a0A., Martin,\u00a0A.: Combinatorial and continuous models for the optimization of traffic flow networks. SIAM J. Optim. 16, 1155\u20131176 (2006)","journal-title":"SIAM J. Optim."},{"key":"9011_CR15","unstructured":"Garavello,\u00a0M., Piccoli,\u00a0B.: Traffic flow on a\u00a0road network using the Aw-Rascle model. Preprint (2004). Commun. Partial Differ. Equations (in press)"},{"key":"9011_CR16","doi-asserted-by":"crossref","unstructured":"Gonzaga,\u00a0C.C., Castillo,\u00a0R.A.: A\u00a0nonlinear programming algorithm based on non-coercive penalty functions. Math. Program. Ser. A\u00a096 (2003)","DOI":"10.1007\/s10107-002-0332-z"},{"key":"9011_CR17","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01588250","volume":"17","author":"S.-P. Han","year":"1979","unstructured":"Han,\u00a0S.-P., Mangasarin,\u00a0O.L.: Exact penalty functions in nonlinear programming. Math. Program. 17, 251 (1979)","journal-title":"Math. Program."},{"key":"9011_CR18","unstructured":"Heinrich,\u00a0N.: Eine neue Modifikation des Newtonverfahrens f\u00fcr nichtrestringierte und linear restringierte Optimierungsprobleme mit Mehrfachinaktivierung im linear restringierten Fall. Ph.D. thesis, TU Darmstadt (1995)"},{"issue":"4","key":"9011_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218202504003362","volume":"14","author":"M. Herty","year":"2004","unstructured":"Herty,\u00a0M., Klar,\u00a0A.: Simplified dynamics and optimization of large scale traffic networks. Math. Models Methods Appl. Sci. 14(4), 1 (2004)","journal-title":"Math. Models Methods Appl. Sci."},{"key":"9011_CR20","doi-asserted-by":"publisher","first-page":"1066","DOI":"10.1137\/S106482750241459X","volume":"25","author":"M. Herty","year":"2004","unstructured":"Herty,\u00a0M., Klar,\u00a0A.: Modelling and optimization of traffic networks. SIAM J. Sci. Comput. 25, 1066 (2004)","journal-title":"SIAM J. Sci. Comput."},{"key":"9011_CR21","series-title":"Applied Mathematics and Mechanics","volume-title":"Flow Optimization on Traffic Networks","author":"M. Herty","year":"2004","unstructured":"Herty,\u00a0M., Klar,\u00a0A., Singh,\u00a0A.K.: Flow Optimization on Traffic Networks. Applied Mathematics and Mechanics, vol.\u00a04. Shanghai Univ. Techn., Shanghai (2004), 624 p."},{"key":"9011_CR22","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1137\/S0036141093243289","volume":"26","author":"H. Holden","year":"1995","unstructured":"Holden,\u00a0H., Risebro,\u00a0N.H.: A\u00a0mathematical model of traffic flow on a\u00a0network of unidirectional roads. SIAM J. Math. Anal. 26, 999 (1995)","journal-title":"SIAM J. Math. Anal."},{"key":"9011_CR23","first-page":"437","volume-title":"Operations Research Proceedings","author":"O. Jahn","year":"2000","unstructured":"Jahn,\u00a0O., M\u00f6hring,\u00a0R., Schulz,\u00a0A.S.: Optimal routing of traffic flows with length restrictions in networks with congestion. In: Inderfurth,\u00a0K.,\u00a0et al.(eds.) Operations Research Proceedings, p.\u00a0437. Springer, Berlin (2000)"},{"key":"9011_CR24","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1287\/opre.1040.0197","volume":"53","author":"O. Jahn","year":"2005","unstructured":"Jahn,\u00a0O., M\u00f6hring,\u00a0R., Schulz,\u00a0A.S., Stier-Moses,\u00a0N.E.: System-optimal routing of traffic flows with user constraints in networks with congestion. Oper. Res. 53, 600 (2005)","journal-title":"Oper. Res."},{"key":"9011_CR25","unstructured":"Janesch,\u00a0S.M.H., Santos,\u00a0L.T.: Exact penalty methods with constrained subproblems. Investigacion Operativa (1997)"},{"key":"9011_CR26","series-title":"SIAM Frontiers in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970920","volume-title":"Iterative Methods for Optimization","author":"C.T. Kelley","year":"1999","unstructured":"Kelley,\u00a0C.T.: Iterative Methods for Optimization. SIAM Frontiers in Applied Mathematics. SIAM, Philadelphia (1999)"},{"key":"9011_CR27","unstructured":"K\u00f6hler,\u00a0E., Skutella,\u00a0M., M\u00f6hring,\u00a0R.H.: Traffic networks and flows over time. Preprint No. 752\/2002 (2002)"},{"key":"9011_CR28","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1011215321374","volume":"20","author":"Y.J. Lee","year":"2001","unstructured":"Lee,\u00a0Y.J., Mangasarin,\u00a0O.L.: SSVM: A\u00a0smooth support vector machine for classification. Comput. Optim. Appl. 20, 5 (2001)","journal-title":"Comput. Optim. Appl."},{"key":"9011_CR29","first-page":"281","volume":"229","author":"M. Lighthill","year":"1983","unstructured":"Lighthill,\u00a0M., Whitham,\u00a0J.: On kinematic waves, Proc. Roy. Soc. Edinb. A 229, 281 (1983)","journal-title":"Proc. Roy. Soc. Edinb. A"},{"key":"9011_CR30","doi-asserted-by":"crossref","unstructured":"Madsen,\u00a0K., Nielsen,\u00a0H.B.: A\u00a0finite smoothing algorithm for Linear l\n                           1 estimation, SIAM J. Optim. 3 (1993)","DOI":"10.1137\/0803010"},{"key":"9011_CR31","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF01582118","volume":"16","author":"D.Q. Mayne","year":"1979","unstructured":"Mayne,\u00a0D.Q., Maratos,\u00a0N.: A\u00a0first order exact penalty function algorithm for equality constrained optimization problems. Math. Program. 16, 303 (1979)","journal-title":"Math. Program."},{"key":"9011_CR32","doi-asserted-by":"crossref","unstructured":"Mayne,\u00a0D.Q., Polak,\u00a0E.: A\u00a0Superlinearly Convergent Algorithm for Constrained Optimization Problems. Mathematical Programming Study, vol. 16 (1979)","DOI":"10.1007\/BF01582118"},{"key":"9011_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J. Nocedal","year":"1999","unstructured":"Nocedal,\u00a0J., Wright,\u00a0St.J.: Numerical Optimization. Springer, Berlin (1999)"},{"key":"9011_CR34","series-title":"SIAM Classics in Applied Mathematics","volume-title":"The Symmetric Eigenvalue Problem","author":"B.N. Parlett","year":"1997","unstructured":"Parlett,\u00a0B.N.: The Symmetric Eigenvalue Problem. SIAM Classics in Applied Mathematics. SIAM, Philadelphia (1997)"},{"key":"9011_CR35","doi-asserted-by":"crossref","unstructured":"Pinar,\u00a0M.C., Zenios,\u00a0S.A.: On smoothing exact penalty functions for convex constrained optimization. SIAM J. Optim. 4 (1994)","DOI":"10.1137\/0804027"},{"key":"9011_CR36","unstructured":"PL2 is available at http:\/\/plato.la.asu.edu\/topics\/problems\/nlounres.html"},{"key":"9011_CR37","unstructured":"Spellucci,\u00a0P.: Solving QP problems by penalization and smoothing. Preprint, TU Darmstadt (2002)"},{"key":"9011_CR38","volume-title":"Nonlinear Programming","author":"W.I. Zhangwill","year":"1969","unstructured":"Zhangwill,\u00a0W.I.: Nonlinear Programming. Prentice-Hall, Englewood Cliffs (1969)"},{"key":"9011_CR39","unstructured":"Zhu,\u00a0C., Byrd,\u00a0R.H., Lu,\u00a0P., Nocedal,\u00a0J.: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization. Technical report, Northwestern University (1994)"},{"key":"9011_CR40","doi-asserted-by":"crossref","unstructured":"Wu,\u00a0Z.Y., Bai,\u00a0F.S., Yang,\u00a0X.Q., Zhang,\u00a0L.S.: An exact lower order penalty function and its smoothing in nonlinear programming. Optimization 53 (2004)","DOI":"10.1080\/02331930410001662199"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9011-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-007-9011-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9011-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9011-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,18]],"date-time":"2022-05-18T01:33:03Z","timestamp":1652837583000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-007-9011-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,6]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["9011"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9011-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,6]]},"assertion":[{"value":"1 June 2005","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2006","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2007","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}