{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T16:29:19Z","timestamp":1778516959381,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Global Optimization"],"published-print":{"date-parts":[[2003,11]]},"DOI":"10.1023\/a:1024814401713","type":"journal-article","created":{"date-parts":[[2003,9,16]],"date-time":"2003-09-16T19:30:35Z","timestamp":1063740635000},"page":"215-232","source":"Crossref","is-referenced-by-count":47,"title":["Semismooth Newton Methods for Solving Semi-Infinite Programming Problems"],"prefix":"10.1007","volume":"27","author":[{"given":"Liqun","family":"Qi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soon-Yi","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guanglu","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5096067_CR1","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1090\/S0025-5718-98-00932-6","volume":"67","author":"X. Chen","year":"1998","unstructured":"Chen, X., Qi, L. and Sun, D. 1998, Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities, Math. Comput. 67, 519-540.","journal-title":"Math. Comput."},{"key":"5096067_CR2","volume-title":"Optimization and Nonsmooth Analysis","author":"F.H. Clarke","year":"1983","unstructured":"Clarke, F.H. 1983, Optimization and Nonsmooth Analysis, Wiley, New York."},{"key":"5096067_CR3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF02591681","volume":"37","author":"A.R. Conn","year":"1987","unstructured":"Conn, A.R. and Gould, N.I.M. 1987, An exact penalty function for semi-infinite programming, Math. Programming 37, 19-40.","journal-title":"Math. Programming"},{"key":"5096067_CR4","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF01582053","volume":"32","author":"I.D. Coope","year":"1985","unstructured":"Coope, I.D. and Watson, G.A. 1985, A projected Lagrangian algorithm for semi-infinite programming, Math. Programming 32, 337-356.","journal-title":"Math. Programming"},{"key":"5096067_CR5","first-page":"407","volume":"75","author":"T. De Luca","year":"1996","unstructured":"De Luca, T., Facchinei, F. and Kanzow, C. 1996, A semismooth equation approach to the solution of nonlinear complementarity problems, Math. Programming 75, 407-439.","journal-title":"Math. Programming"},{"key":"5096067_CR6","first-page":"493","volume":"76","author":"F. Facchinei","year":"1997","unstructured":"Facchinei, F. and Kanzow, C. 1997, A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems, Math. Programming 76, 493-512.","journal-title":"Math. Programming"},{"key":"5096067_CR7","first-page":"513","volume":"76","author":"A. Fischer","year":"1997","unstructured":"Fischer, A., 1997, Solution of monotone complementarity problems with locally Lipschitzian functions, Math. Programming 76, 513-532.","journal-title":"Math. Programming"},{"key":"5096067_CR8","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BFb0121215","volume":"21","author":"R. Janin","year":"1984","unstructured":"Janin, R., 1984, Direction derivative of the marginal function in nonlinear programming, Math. Programming Study 21, 127-138.","journal-title":"Math. Programming Study"},{"key":"5096067_CR9","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1287\/moor.24.3.529","volume":"24","author":"H. Jiang","year":"1999","unstructured":"Jiang, H., 1999, Global convergence analysis of the generalized Newton and Gauss-Newton methods of the Fischer-Burmeister equation for the complementarity problem, Math. Oper. Res. 24, 529-543.","journal-title":"Math. Oper. Res."},{"key":"5096067_CR10","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/S0363012994276494","volume":"35","author":"H. Jiang","year":"1997","unstructured":"Jiang, H. and Qi, L. 1997, A new nonsmooth equations approach to nonlinear complementarity problems, SIAM J. Control and Optimization 35, 178-193.","journal-title":"SIAM J. Control and Optimization"},{"key":"5096067_CR11","unstructured":"Li, D., Qi, L., Tam, J. and Wu, S.Y. Smoothing Newton methods for solving semi-infinite programming problems, to appear in: J. Global Optimization."},{"key":"5096067_CR12","volume-title":"Nonlinear Programming","author":"O.L. Mangasarian","year":"1969","unstructured":"Mangasarian, O.L., 1969 Nonlinear Programming, McGraw-Hill, New York, 1969."},{"key":"5096067_CR13","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF01189451","volume":"30","author":"D.Q. Mayne","year":"1994","unstructured":"Mayne, D.Q., Michalska, H. and Polak, E. 1994, An efficient algorithm for solving semi-infinite inequality problems with box constraints, J. Appl. Math. and Optim. 30, 135-157.","journal-title":"J. Appl. Math. and Optim."},{"key":"5096067_CR14","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF01460116","volume":"9","author":"D.Q. Mayne","year":"1982","unstructured":"Mayne, D.Q. and Polak, E. 1982, A quadratically convergent algorithm for solving infinite dimensional inequalities, J. Appl. Math. and Optim. 9, 25-40.","journal-title":"J. Appl. Math. and Optim."},{"key":"5096067_CR15","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1137\/0803021","volume":"3","author":"J.-S. Pang","year":"1993","unstructured":"Pang, J.-S. and Qi, L. 1993, Nonsmooth equations: Motivation and algorithms, SIAM J. Optimization 3, 443-465.","journal-title":"SIAM J. Optimization"},{"key":"5096067_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0663-7","volume-title":"Optimization: Algorithms and Consistent Approximation","author":"E. Polak","year":"1997","unstructured":"Polak, E., 1997, Optimization: Algorithms and Consistent Approximation, Springer-Verlag, New York."},{"key":"5096067_CR17","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01447767","volume":"8","author":"E. Polak","year":"1982","unstructured":"Polak, E., and Tits, A. 1982, A recursive quadratic programming algorithm for semi-infinite optimization problems, Appl. Math. Optim. 8, 325-349.","journal-title":"Appl. Math. Optim."},{"key":"5096067_CR18","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1287\/moor.18.1.227","volume":"18","author":"L. Qi","year":"1993","unstructured":"Qi, L. 1993, Convergence analysis of some algorithms for solving nonsmooth equations, Math. Oper. Res. 18 227-244.","journal-title":"Math. Oper. Res."},{"key":"5096067_CR19","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1287\/moor.24.2.440","volume":"24","author":"L. Qi","year":"1999","unstructured":"Qi, L., 1999, Regular pseudo-smooth NCP and BVIP functions and globally and quadratically convergent generalized Newton methods for complementarity and variational inequality problems, Math. Oper. Res. 24, 440-471.","journal-title":"Math. Oper. Res."},{"key":"5096067_CR20","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1287\/moor.22.2.301","volume":"22","author":"L. Qi","year":"1997","unstructured":"Qi, L. and Jiang, H. 1997, Semismooth Karush-Kuhn-Tucker equations and convergence analysis of Newton methods and quasi-Newton methods for solving these equations, Math. Oper. Res. 22, 301-325.","journal-title":"Math. Oper. Res."},{"key":"5096067_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s101079900127","volume":"87","author":"L. Qi","year":"2000","unstructured":"Qi, L., Sun, D. and Zhou, G. 2000, A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities, Math. Programming 87, 1-35.","journal-title":"Math. Programming"},{"key":"5096067_CR22","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01581275","volume":"58","author":"L. Qi","year":"1993","unstructured":"Qi, L. and Sun, J. 1993, A nonsmooth version of Newton\u2019s method, Math. Programming 58, 353-367.","journal-title":"Math. Programming"},{"key":"5096067_CR23","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1137\/S1052623497326629","volume":"10","author":"L. Qi","year":"2000","unstructured":"Qi, L., and Wei, Z. 2000, On the constant positive linear dependence condition and its applications to SQP methods, SIAM J. Optimization 10, 963-981.","journal-title":"SIAM J. Optimization"},{"key":"5096067_CR24","volume-title":"Semi-Infinite Programming","author":"R. Reemsten","year":"1998","unstructured":"Reemsten, R. and R\u00fcckmann, J. 1998, Semi-Infinite Programming, Kluwer Academic Publishers, Boston."},{"key":"5096067_CR25","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1023\/A:1011239607220","volume":"9","author":"J.J. R\u00fcckmann","year":"2001","unstructured":"R\u00fcckmann, J.J. and Shapiro, A. 2001, Second Order Optimality Conditions in Generalized Semi-Infinite Programming, Set-Valued Analysis 9, 169-186.","journal-title":"Set-Valued Analysis"},{"key":"5096067_CR26","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/978-1-4757-2868-2_4","volume-title":"Semi-Infinite Programming","author":"A. Shapiro","year":"1998","unstructured":"Shapiro, A. 1998, First and second order optimality conditions and perturbation analysis of semi-infinite programming problems, in: R. Reemsten and J. R\u00fcckmann, eds., pp. 103\u2013133 Semi-Infinite Programming, Kluwer Academic Publishers, Boston."},{"key":"5096067_CR27","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0377-0427(88)90276-2","volume":"23","author":"Y. Tanaka","year":"1988","unstructured":"Tanaka, Y., Fukushima, M. and Ibaraki, T. 1988, A globally convergent SQP method for semiinfinite nonlinear optimization, J. Comput. Appl. Math. 23, 141-153.","journal-title":"J. Comput. Appl. Math."},{"key":"5096067_CR28","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0377-2217(88)90010-0","volume":"36","author":"Y. Tanaka","year":"1988","unstructured":"Tanaka, Y., Fukushima, M. and Ibaraki, T. 1988, A comparative study of several semi-infinite nonlinear programming algorithms, European J. Oper. Res. 36, 92-100.","journal-title":"European J. Oper. Res."},{"key":"5096067_CR29","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1023\/A:1019260508329","volume":"98","author":"K.L. Teo","year":"2001","unstructured":"Teo, K.L., Yang, X.Q. and Jennings, L.S. 2001, Computational discretization algorithms for functional inequality constrained optimization, Ann. Oper. Res. 98, 215-234.","journal-title":"Ann. Oper. Res."},{"key":"5096067_CR30","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/BF01941472","volume":"21","author":"G.A. Watson","year":"1981","unstructured":"Watson, G.A., 1981, Globally convergent methods for semi-infinite programming, BIT, 21 362-373.","journal-title":"BIT"},{"key":"5096067_CR31","series-title":"Lecture Notes in Econom. and Math. Systems","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/978-3-642-46477-5_13","volume-title":"Semi-infinite programming and applications","author":"G.A. Watson","year":"1983","unstructured":"Watson, G.A., 1983, Numerical experiments with globally convergent methods for semi-infinite programming problems, in: Semi-infinite programming and applications, A.V. Fiacco and K.O. Kortanek, eds., (Austin, Tex., 1981), 193-205, Lecture Notes in Econom. and Math. Systems, 215, Springer, Berlin-New York."},{"key":"5096067_CR32","first-page":"469","volume":"76","author":"N. Yamashita","year":"1997","unstructured":"Yamashita, N. and Fukushima, M. 1997, Modified Newton methods for solving semismooth reformulations of monotone complementarity problems, Math. Programming 76, 469-491.","journal-title":"Math. Programming"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024814401713.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1024814401713\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024814401713.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:45:31Z","timestamp":1751366731000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1024814401713"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":32,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["5096067"],"URL":"https:\/\/doi.org\/10.1023\/a:1024814401713","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}