{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T12:47:23Z","timestamp":1750942043476},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,9,2]],"date-time":"2006-09-02T00:00:00Z","timestamp":1157155200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2007,11,30]]},"DOI":"10.1007\/s10107-006-0020-5","type":"journal-article","created":{"date-parts":[[2006,9,1]],"date-time":"2006-09-01T10:07:01Z","timestamp":1157105221000},"page":"335-369","source":"Crossref","is-referenced-by-count":12,"title":["Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs"],"prefix":"10.1007","volume":"112","author":[{"given":"Giovanni","family":"Giallombardo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Ralph","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,9,2]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1137\/S1052623402401221","volume":"15","author":"M. Anitescu","year":"2005","unstructured":"Anitescu M. (2005) On using the elastic mode in nonlinear programming approaches to mathematical programs with complementarity constraints. SIAM J. Optim. 15, 1203\u20131236","journal-title":"SIAM J. Optim."},{"key":"20_CR2","unstructured":"Anitescu, M., Tseng, P., Wright, S.J.: Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties. Technical ANL\/MCS P1242-0405, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, USA, May 2005"},{"key":"20_CR3","unstructured":"Benson, H.Y., Shanno, D.F., Vanderbei, R.J.: Interior-point methods for nonconvex nonlinear programming: complementarity constraints. Technical Report ORFE 02-02, Department of Operations Research and Financial Engineering, Princeton University, July 2002. Math. Program. Ser. A (to appear)"},{"key":"20_CR4","volume-title":"Nonlinear Programming","author":"D.P. Bertsekas","year":"1995","unstructured":"Bertsekas D.P. (1995) Nonlinear Programming. Athena Scientific Belmont, Massachussets"},{"key":"20_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1394-9","volume-title":"Perturbation Analysis of Optimization Problems","author":"J.F. Bonnans","year":"2000","unstructured":"Bonnans J.F., Shapiro A. (2000) Perturbation Analysis of Optimization Problems. Springer, Berlin Heidelberg New York"},{"key":"20_CR6","first-page":"27","volume":"100","author":"R.H. Byrd","year":"2004","unstructured":"Byrd R.H., Gould N.I.M., Nocedal J., Waltz R.H. (2004) An algorithm for nonlinear optimization using linear programming and equality constrained subproblems. Math. Program. 100, 27\u201348","journal-title":"Math. Program."},{"key":"20_CR7","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/S1052623403426532","volume":"16","author":"R.H. Byrd","year":"2005","unstructured":"Byrd R.H., Gould N.I.M., Nocedal J., Waltz R.H. (2005) On the convergence of successive linear-quadratic programming algorithms. SIAM J. Optim. 16, 471\u2013489","journal-title":"SIAM J. Optim."},{"key":"20_CR8","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF02592073","volume":"39","author":"P.H. Calamai","year":"1987","unstructured":"Calamai P.H., Mor\u00e9 J.J. (1987) Projected gradient methods for linearly constrained problems. Math. Program. 39, 93\u2013116","journal-title":"Math. Program."},{"key":"20_CR9","unstructured":"Chin, C.M., Fletcher, R.: Numerical performance of an SLP-filter algorithm that takes EQP steps. Technical Report NA\/202, Department of Mathematics, University of Dundee, Dundee, UK (2001)"},{"key":"20_CR10","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10107-003-0378-6","volume":"96","author":"C.M. Chin","year":"2003","unstructured":"Chin C.M., Fletcher R. (2003) On the global convergence of an SLP-filter algorithm that takes EQP steps. Math. Program. 96, 161\u2013177","journal-title":"Math. Program."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Conn A.R., Gould N.I.M., Toint Ph.L. Trust-region methods. MPS-SIAM (2000)","DOI":"10.1137\/1.9780898719857"},{"key":"20_CR12","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1137\/04060754x","volume":"16","author":"A.V. Miguel de","year":"2005","unstructured":"de Miguel A.V., Friedlander M., Nogales F., Scholtes S. (2005) An interior-point method for MPECS based on strictly feasible relaxations. SIAM J. Optim. 16, 587\u2013609","journal-title":"SIAM J. Optim."},{"key":"20_CR13","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s10107990015a","volume":"85","author":"F. Facchinei","year":"1999","unstructured":"Facchinei F., Jiang H., Qi L. (1999) A smoothing method for mathematical programs with equilibrium constraints. Math. Program. 85, 81\u2013106","journal-title":"Math. Program."},{"key":"20_CR14","volume-title":"Finite-dimensional variational inequalities and complementarity problems, Vol I Springer series in operations research","author":"F. Facchinei","year":"2003","unstructured":"Facchinei F., Pang J.S. (2003) Finite-dimensional variational inequalities and complementarity problems, Vol I Springer series in operations research. Springer, Berlin Heidelberg New York"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Ferris, M.C., Ralph, D.: Projected gradient methods for nonlinear complementarity problems via normal maps. In: Du, D.Z., Qi, L., Womersley, R.S. (eds.) Recent Advances in Nonsmooth Optimization. World Scientific Publishing (1995)","DOI":"10.1142\/9789812812827_0005"},{"key":"20_CR16","unstructured":"Fiacco A.V. Introduction to sensitivity and stability analysis in nonlinear programming. Math. Sci. Eng. 165, Academic, London (1983)"},{"key":"20_CR17","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1287\/moor.24.3.699","volume":"24","author":"A. Fischer","year":"1999","unstructured":"Fischer A. (1999) Modified Wilson method for nonlinear programs with nonunique multipliers. Math. Oper. Res. 24, 699\u2013727","journal-title":"Math. Oper. Res."},{"key":"20_CR18","volume-title":"Practical Methods of Optimization","author":"R. Fletcher","year":"1987","unstructured":"Fletcher R. (1987) Practical Methods of Optimization. Wiley, New York"},{"key":"20_CR19","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1080\/10556780410001654241","volume":"19","author":"R. Fletcher","year":"2004","unstructured":"Fletcher R., Leyffer S. (2004) Solving mathematical programs with complementarity constraints as nonlinear programs. Optim. Methods Softw. 19, 15\u201340","journal-title":"Optim. Methods Softw."},{"key":"20_CR20","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1137\/S1052623402407382","volume":"17","author":"R. Fletcher","year":"2006","unstructured":"Fletcher R., Leyffer S., Ralph D., Scholtes S. (2006) Local convergence of SQP methods for mathematical programs with equilibrium constraints. SIAM J. Optim. 17, 259\u2013286","journal-title":"SIAM J. Optim."},{"key":"20_CR21","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF01582292","volume":"43","author":"R. Fletcher","year":"1989","unstructured":"Fletcher R., Sainz de la Maza E. (1989) Nonlinear programming and nonsmooth optimization by successive linear programming. Math. Program. 43, 235\u2013256","journal-title":"Math. Program."},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Fukushima, M., Pang, J.S.: Convergence of a smoothing continuation method for mathematical programs with complementarity constraints. In: Th\u00e9ra, M., Tichatschke, R. (eds.) Ill-posed Variational Problems and Regularization Techniques, vol. 447 of Lecture Notes in Economics and Mathematical Systems, Berlin\/Heidelberg, pp. 99\u2013110 (1999)","DOI":"10.1007\/978-3-642-45780-7_7"},{"key":"20_CR23","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1137\/S1052623499363232","volume":"12","author":"M. Fukushima","year":"2002","unstructured":"Fukushima M., Tseng P. (2002) An implementable active-set\u00a0algorithm for computing a B-stationary point of a mathematical program with linear complementarity constraints. SIAM J. Optim. 12, 724\u2013739","journal-title":"SIAM J. Optim."},{"key":"20_CR24","volume-title":"Large Scale Optimization: State of the Art.","author":"S.A. Gabriel","year":"1994","unstructured":"Gabriel S.A., Pang J.S. (1994) A trust region method for constrained nonsmooth equations. In: Hager W.W., Hearn D.W., Pardalos P.M. (eds) Large Scale Optimization: State of the Art. Kluwer, Dordrecht"},{"key":"20_CR25","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10957-004-5154-0","volume":"123","author":"X. Hu","year":"2004","unstructured":"Hu X., Ralph D. (2004) Convergence of a penalty method for mathematical programming with complementarity constraints. J. Optim. Theory Appl. 123, 365\u2013390","journal-title":"J. Optim. Theory Appl."},{"key":"20_CR26","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1080\/01630560500538797","volume":"27","author":"X.X. Huang","year":"2006","unstructured":"Huang X.X., Yang X.Q., Zhu D.L. (2006) A sequential smooth penalization approach to mathematical programs with complementarity constraints. Num. Funct. Anal. Optim. 27, 71\u201398","journal-title":"Num. Funct. Anal. Optim."},{"key":"20_CR27","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1137\/S1052623495296541","volume":"8","author":"H. Jiang","year":"1998","unstructured":"Jiang H., Fukushima M., Qi L., Sun D. (1998) A trust region method for solving generalized complementarity problems. SIAM J. Optim. 8, 140\u2013157","journal-title":"SIAM J. Optim."},{"key":"20_CR28","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1023\/A:1008696504163","volume":"13","author":"H. Jiang","year":"1999","unstructured":"Jiang H., Ralph D. (1999) QPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints. Comput. Optim. Appl. 13, 25\u201359","journal-title":"Comput. Optim. Appl."},{"key":"20_CR29","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1137\/S1052623497332329","volume":"10","author":"H. Jiang","year":"2000","unstructured":"Jiang H., Ralph D. (2000) Smooth SQP methods for mathematical programs with nonlinear complementarity constraints. SIAM J. Optim. 10, 779\u2013808","journal-title":"SIAM J. Optim."},{"key":"20_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10957-005-7549-y","volume":"128","author":"G.H. Lin","year":"2006","unstructured":"Lin G.H., Fukushima M. (2006) Hybrid algorithms with active set identification for mathematical programs with complementarity constraints. J. Optim. Theory Appl. 128, 1\u201328","journal-title":"J. Optim. Theory Appl."},{"key":"20_CR31","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10589-005-3075-y","volume":"34","author":"X. Liu","year":"2006","unstructured":"Liu X., Perakis G., Sun J. (2006) A robust SQP methods for mathematical programs with complementarity constraints. Comput. Optim. Appl. 34, 5\u201333","journal-title":"Optim. Appl."},{"key":"20_CR32","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511983658","volume-title":"Mathematical Programs With Equilibrium Constraints","author":"Z.Q. Luo","year":"1996","unstructured":"Luo Z.Q., Pang J.S., Ralph D. (1996) Mathematical Programs With Equilibrium Constraints. Cambridge University Press, Cambridge"},{"key":"20_CR33","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/978-1-4613-0307-7_9","volume-title":"Multilevel Optimization: Algorithms, Complexity and Applications.","author":"Z.Q. Luo","year":"1998","unstructured":"Luo Z.Q., Pang J.S., Ralph D. (1998) Piecewise sequential quadratic programming for mathematical programs with nonlinear complementarity constraints. In: Migdalas A., Pardalos P.M., V\u00e4rbrand P. (eds) Multilevel Optimization: Algorithms, Complexity and Applications. Kluwer, Norwell, pp. 209\u2013229"},{"key":"20_CR34","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0141-0296(82)90042-6","volume":"4","author":"G. Maier","year":"1982","unstructured":"Maier G., Giannessi F., Nappi A. (1982) Indirect identification of yield limits by mathematical programming. Eng. Struct. 4, 86\u201398","journal-title":"Eng. Struct."},{"key":"20_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2825-5","volume-title":"Nonsmooth Approach to Optimization Problems with Equilibrium Constraints","author":"J.V. Outrata","year":"1998","unstructured":"Outrata J.V., Kocvara M., Zowe J. (1998) Nonsmooth Approach to Optimization Problems with Equilibrium Constraints. Kluwer, Dordrecht"},{"key":"20_CR36","volume-title":"Computational Methods in Optimization: A Unified Approach","author":"E. Polak","year":"1971","unstructured":"Polak E. (1971) Computational Methods in Optimization: A Unified Approach. Academic, New York"},{"key":"20_CR37","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1137\/S1052623403429081","volume":"15","author":"A.U. Raghunathan","year":"2005","unstructured":"Raghunathan A.U., Biegler L.T. (2005) Interior point methods for mathematical programs with complementarity constraints. SIAM J. Optim. 15, 720\u2013750","journal-title":"SIAM J. Optim."},{"key":"20_CR38","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1080\/10556780410001709439","volume":"19","author":"D. Ralph","year":"2004","unstructured":"Ralph D., Wright S.J. (2004) Some properties of regularization and penalization schemes for MPECs. Optim. Methods Softw. 19, 527\u2013556","journal-title":"Optim. Methods Softw."},{"key":"20_CR39","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar R.T. (1970) Convex Analysis. Princeton University Press, Princeton"},{"key":"20_CR40","first-page":"1","volume":"25","author":"H. Scheel","year":"2000","unstructured":"Scheel H., Scholtes S. (2000) Mathematical programs with complementarity constraints: stationarity, optimality, and sensitivity. Math. Oper. Res. 25, 1\u201322","journal-title":"Oper. Res."},{"key":"20_CR41","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1137\/S1052623499361233","volume":"11","author":"S. Scholtes","year":"2001","unstructured":"Scholtes S. (2001) Convergence properties of a regularization scheme for mathematical programs with complementarity constraints. SIAM J. Optim. 11, 918\u2013936","journal-title":"SIAM J. Optim."},{"key":"20_CR42","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1287\/opre.1030.0102","volume":"52","author":"S. Scholtes","year":"2004","unstructured":"Scholtes S. (2004) Nonconvex structures in nonlinear programming. Oper. Res. 52, 368\u2013383","journal-title":"Oper. Res."},{"key":"20_CR43","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1137\/S0363012996306121","volume":"37","author":"S. Scholtes","year":"1999","unstructured":"Scholtes S., St\u00f6hr M. (1999) Exact penalization of mathematical programs with equilibrium constraints. SIAM J. Control Optim. 37, 617\u2013652","journal-title":"SIAM J. Control Optim."},{"key":"20_CR44","volume-title":"Nonsmooth Trust Region Methods and Their Applications to Mathematical Programs With Equilibrium Constraints","author":"M. St\u00f6hr","year":"1999","unstructured":"St\u00f6hr M. (1999) Nonsmooth Trust Region Methods and Their Applications to Mathematical Programs With Equilibrium Constraints. Shaker-Verlag, Aachen Germany"},{"key":"20_CR45","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1023\/A:1011226232107","volume":"19","author":"J. Zhang","year":"2001","unstructured":"Zhang J., Liu G. (2001) A new extreme point algorithm and its application in PSQP algorithms for solving mathematical programs with linear complementarity constraints. J. Global Optim. 19, 335\u2013361","journal-title":"J. Global Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0020-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0020-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0020-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:50:00Z","timestamp":1559109000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-006-0020-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9,2]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,11,30]]}},"alternative-id":["20"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0020-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,9,2]]}}}