{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T21:29:01Z","timestamp":1649194141945},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,8,1]],"date-time":"2011-08-01T00:00:00Z","timestamp":1312156800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s11424-011-8427-3","type":"journal-article","created":{"date-parts":[[2011,8,13]],"date-time":"2011-08-13T04:19:19Z","timestamp":1313209159000},"page":"769-783","source":"Crossref","is-referenced-by-count":0,"title":["Global convergence of a class of smooth penalty methods for semi-infinite programming"],"prefix":"10.1007","volume":"24","author":[{"given":"Changyu","family":"Wang","sequence":"first","affiliation":[]},{"given":"Haiyan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Fang","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,8,14]]},"reference":[{"key":"8427_CR1","first-page":"1","volume-title":"Lecture Notes in Mathematics","author":"A. Ben-Tal","year":"1989","unstructured":"A. Ben-Tal and M. Teboulle, A smoothing technique for non-differentiable optimization problem, Lecture Notes in Mathematics, Springer Verlag, Berlin, 1989, 1405: 1\u201311."},{"key":"8427_CR2","doi-asserted-by":"crossref","first-page":"1340","DOI":"10.1137\/0331063","volume":"31","author":"J. V. Burke","year":"1993","unstructured":"J. V. Burke and M. C. Ferris, Weak sharp minima in mathematical programming, SIAM J. Control Optim, 1993, 31: 1340\u20131359.","journal-title":"SIAM J. Control Optim"},{"key":"8427_CR3","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01592244","volume":"71","author":"C. Chen","year":"1995","unstructured":"C. Chen and O. L. Mangasarian, Smoothing method for convex inequalities and linear complementarity problems, Math. Program., 1995, 71: 51\u201369.","journal-title":"Math. Program."},{"key":"8427_CR4","volume-title":"Non-linear semi-infinite programming","author":"C. Price","year":"1992","unstructured":"C. Price, Non-linear semi-infinite programming, Ph. D. Thesis, University of Canterbury, New Zealand, 1992."},{"key":"8427_CR5","doi-asserted-by":"crossref","unstructured":"K. Roleff, A Stable Multiple Exchange Algorithm for Linear SIP, Hettich R. (eds.), Semi-Infinite Programming, Springer-Verlag, 1979: 83\u201396.","DOI":"10.1007\/BFb0003885"},{"key":"8427_CR6","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1287\/moor.22.1.43","volume":"22","author":"A. Auslender","year":"1997","unstructured":"A. Auslender, R. Cominetti, and M. Haddou, Asymptotic analysis for penalty and barrier methods in convex and linear programming, Math. Oper. Res., 1997, 22: 43\u201362.","journal-title":"Math. Oper. Res."},{"key":"8427_CR7","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01585742","volume":"46","author":"R. Hettich","year":"1990","unstructured":"R. Hettich and G. Gramlich, A note on an implementation of a method for quadratic semi-infinite programming, Math. Program., 1990, 46: 249\u2013254.","journal-title":"Math. Program."},{"key":"8427_CR8","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s10898-004-8266-z","volume":"30","author":"D. H. Li","year":"2004","unstructured":"D. H. Li, L. Qi, J. Tam, and S. Y. Wu, A smoothing newton method for semi-infinite programming, J. Glob. Optim., 2004, 30: 169\u2013194.","journal-title":"J. Glob. Optim."},{"key":"8427_CR9","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s10957-006-9049-0","volume":"129","author":"C. Ling","year":"2006","unstructured":"C. Ling, L. Qi, G. Zhou, and S. Y. Wu, Global convergence of a robust smoothing SQP method for semi-infinite programming, J. Optim. Theory Appl., 2006, 129: 147\u2013164.","journal-title":"J. Optim. Theory Appl."},{"key":"8427_CR10","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0898-1221(99)00068-1","volume":"37","author":"M. H. Wang","year":"1999","unstructured":"M. H. Wang and Y. E. Kuo, A perturbation method for solving linear semi-infinite programming problems, Comput. Math. Appl., 1999, 37: 181\u2013198.","journal-title":"Comput. Math. Appl."},{"key":"8427_CR11","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1137\/S1052623497324825","volume":"10","author":"A. Auslender","year":"1999","unstructured":"A. Auslender, Penalty and barrier methods: A unified framework, SIAM J. Optim., 1999, 10: 211\u2013230.","journal-title":"SIAM J. Optim."},{"key":"8427_CR12","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF00249645","volume":"6","author":"C. Price","year":"1996","unstructured":"C. Price and I. Coope, Numerical experiments in semi-infinite programming, Comput. Optim. Appl., 1996, 6: 169\u2013189.","journal-title":"Comput. Optim. Appl."},{"key":"8427_CR13","first-page":"37","volume":"21","author":"A. Vaz","year":"2001","unstructured":"A. Vaz, E. Fernandes, and M. Gomes, Discretization methods for semi-infinite programnfing, Investigac\u00e3o Oper, 2001, 21: 37\u201346.","journal-title":"Investigac\u00e3o Oper"},{"key":"8427_CR14","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/BF01941472","volume":"21","author":"G. Watson","year":"1981","unstructured":"G. Watson, Globally convergent methods for semi-infinite programming, BIT., 1981, 21: 362\u2013373.","journal-title":"BIT."},{"key":"8427_CR15","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1111\/j.1475-3995.1997.tb00084.x","volume":"4","author":"J. Kaliski","year":"1997","unstructured":"J. Kaliski, D. Haglin, C. Roos, and T. Terlaky, Logarithmic barrier decomposition methods for semi-infinite programming, International Transactions in Oper. Res., 1997, 4: 285\u2013303.","journal-title":"International Transactions in Oper. Res."},{"key":"8427_CR16","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1137\/0804027","volume":"4","author":"M. Pinar","year":"1994","unstructured":"M. Pinar and S. Zenios, On smoothing exact penalty functions for convex constrained opimization, SIAM J. Optim., 1994, 4: 486\u2013511.","journal-title":"SIAM J. Optim."},{"key":"8427_CR17","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0898-1221(99)00203-5","volume":"38","author":"S. Y. Wu","year":"1999","unstructured":"S. Y. Wu and S. C. Fang, Solving convex programs with infinitely many constraints by a relaxed cutting plane method, Comput. Math. Appl., 1999, 38: 23\u201333.","journal-title":"Comput. Math. Appl."},{"key":"8427_CR18","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10107-002-0332-z","volume":"96","author":"C. C. Gonzaga","year":"2003","unstructured":"C. C. Gonzaga and R. A. Castillo, A nonlinear programming algorithm based on non-coercive penalty functions, Math. Program. Ser. A, 2003, 96: 87\u2013101.","journal-title":"Math. Program. Ser. A"},{"key":"8427_CR19","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/mnsc.13.5.344","volume":"13","author":"W. I. Zangwill","year":"1967","unstructured":"W. I. Zangwill, Non-linear programming via penalty functions, Manage. Sci., 1967, 13: 344\u2013358.","journal-title":"Manage. Sci."},{"key":"8427_CR20","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1023\/A:1024814401713","volume":"27","author":"L. Qi","year":"2003","unstructured":"L. Qi, S. Y. Wu, and G. Zhou, Semismooth newton methods for solving semi-infinite programming problems, J. Glob. Optim., 2003, 27: 215\u2013232.","journal-title":"J. Glob. Optim."},{"key":"8427_CR21","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/S0377-2217(99)00042-9","volume":"121","author":"T. Ledn","year":"2000","unstructured":"T. Ledn, S. Sanrnatfas, and E. Vercher, On the numerical treatment of linearly constrained semiinfinite optimization problems, European J. Oper. Res., 2000, 121: 78\u201391.","journal-title":"European J. Oper. Res."},{"key":"8427_CR22","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF00940041","volume":"71","author":"R. Reemtsen","year":"1991","unstructured":"R. Reemtsen, Discretization methods for the solution of semi-infinite programming problems, J. Optim. Theory Appl., 1991, 71: 85\u2013103.","journal-title":"J. Optim. Theory Appl."},{"key":"8427_CR23","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1080\/10556780500094739","volume":"20","author":"S. Y. Wu","year":"2005","unstructured":"S. Y. Wu, D. H. Li, L. Qi, and G. Zhou, An iterative method for solving the kkt system of semi-infinite programming, Optim. Methods and Softw., 2005, 20: 629\u2013643.","journal-title":"Optim. Methods and Softw."}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-011-8427-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-011-8427-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-011-8427-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T01:33:07Z","timestamp":1560475987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-011-8427-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["8427"],"URL":"https:\/\/doi.org\/10.1007\/s11424-011-8427-3","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8]]}}}