{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T17:40:14Z","timestamp":1772818814796,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T00:00:00Z","timestamp":1129593600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[2006,5]]},"DOI":"10.1007\/s10589-005-3075-y","type":"journal-article","created":{"date-parts":[[2005,12,20]],"date-time":"2005-12-20T11:42:33Z","timestamp":1135078953000},"page":"5-33","source":"Crossref","is-referenced-by-count":22,"title":["A Robust SQP Method for Mathematical Programs with Linear Complementarity Constraints"],"prefix":"10.1007","volume":"34","author":[{"given":"Xinwei","family":"Liu","sequence":"first","affiliation":[]},{"given":"Georgia","family":"Perakis","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,10,18]]},"reference":[{"key":"3075_CR1","unstructured":"M. Anitescu, \u201cOn solving mathematical programs with complementarity constraints as nonlinear programs,\u201d Preprint ANL\/MCS-P864-1200, Argonne National Laboratory, Argonne, IL, 2000.,"},{"key":"3075_CR2","unstructured":"M.S. Bazaraa, H.D. Sherali, and C.M. Shetty, Nonlinear Programming, Theory and Algorithms, 2nd edition, John Wiley and Sons: New York, 1993.,"},{"key":"3075_CR3","doi-asserted-by":"crossref","unstructured":"J.V. Burke, \u201cA sequential quadratic programming method for potentially infeasible mathematical programs,\u201d J. Math. Anal. Appl., vol. 139, pp. 319\u2013351, 1989.,","DOI":"10.1016\/0022-247X(89)90111-X"},{"key":"3075_CR4","doi-asserted-by":"crossref","unstructured":"J.V. Burke and S.P. Han, \u201cA robust sequential quadratic programming method,\u201d Math. Prog., vol. 43, pp. 277\u2013303, 1989.,","DOI":"10.1007\/BF01582294"},{"key":"3075_CR5","unstructured":"A.V. De Miguel, M.P. Friedlander, F.J. Nogales and S. Scholtes, \u201cA superlinearly convergent interior-point method for MPECs,\u201d LBS working paper, 2003.,"},{"key":"3075_CR6","doi-asserted-by":"crossref","unstructured":"F. Facchinei, H.Y. Jiang, and L. Qi, \u201cA smoothing method for mathematical programs with equilibrium constraints,\u201d Math. Program., vol. 85, pp. 107\u2013134, 1999.,","DOI":"10.1007\/s10107990015a"},{"key":"3075_CR7","unstructured":"R. Fletcher, S. Leyffer, D. Ralph and S. Scholtes, \u201cLocal convergence of SQP methods for mathematical programs with equilibrium constraints,\u201d University of Dundee Report NA 209, 2002.,"},{"key":"3075_CR8","doi-asserted-by":"crossref","unstructured":"M. Fukushima, Z.-Q. Luo, and J.-S. Pang, \u201cA globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints,\u201d Comput. Optim. Appl., vol. 10, pp. 5\u201334, 1998.,","DOI":"10.1023\/A:1018359900133"},{"key":"3075_CR9","doi-asserted-by":"crossref","unstructured":"M. Fukushima and J.S. Pang, \u201cSome feasibility issues in mathematical programs with equilibrium constraints,\u201d SIAM J. Optim., vol. 8, pp. 673\u2013681, 1998.,","DOI":"10.1137\/S105262349731577X"},{"key":"3075_CR10","doi-asserted-by":"crossref","unstructured":"M. Fukushima and J.S. Pang, \u201cConvergence of a smoothing continuation method for mathematical programs with complementarity constraints,\u201d in Ill-posed Variational Problems and Regularization Techniques, M. The\u0155a and R. Tichatschke (Eds.), Springer-Verlag: New York, pp. 99\u2013110, 1999.,","DOI":"10.1007\/978-3-642-45780-7_7"},{"key":"3075_CR11","doi-asserted-by":"crossref","unstructured":"M. Fukushima and P. Tseng, \u201cAn implementable active-set algorithm for computing a B-stationary point of a mathematical program with linear complementarity constraints,\u201d SIAM J. Optim., vol. 12, pp. 724\u2013739, 2002.,","DOI":"10.1137\/S1052623499363232"},{"key":"3075_CR12","doi-asserted-by":"crossref","unstructured":"H.Y. Jiang and D. Ralph, \u201cQPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints,\u201d Computational Optim. Appl., vol. 13, pp. 25\u201359, 1999.,","DOI":"10.1023\/A:1008696504163"},{"key":"3075_CR13","doi-asserted-by":"crossref","unstructured":"H.Y. Jiang and D. Ralph, \u201cSmooth SQP methods for mathematical programs with nonlinear complementarity constraints,\u201d SIAM J. Optim., vol. 10, pp. 779\u2013808, 2000.,","DOI":"10.1137\/S1052623497332329"},{"key":"3075_CR14","unstructured":"S. Leyffer, \u201cThe penalty interior point method fails to converge for mathematical programs with equilibrium constraints,\u201d to appear in a special issue of Optimization Methods and Software.,"},{"key":"3075_CR15","unstructured":"S. Leyffer, MacMPEC - www-unix.mcs.anl.gov\/ leyffer\/MacMPEC\/ (2002),"},{"key":"3075_CR16","unstructured":"S. Leyffer, \u201cComplementarity constraints as nonlinear equations: Theory and numerical experience,\u201d Preprint, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439, USA, 2003.,"},{"key":"3075_CR17","doi-asserted-by":"crossref","unstructured":"X.W. Liu and Y.X. Yuan, \u201cA robust algorithm for optimization with general equality and inequality constraints,\u201d SIAM J. Sci. Comput., vol. 22, pp. 517\u2013534, 2000.,","DOI":"10.1137\/S1064827598334861"},{"key":"3075_CR18","unstructured":"X.W. Liu and Y.X. Yuan, \u201cA robust trust region algorithm for solving general nonlinear programming,\u201d J. Comput. Math., vol. 19, pp. 309\u2013322, 2001.,"},{"key":"3075_CR19","doi-asserted-by":"crossref","unstructured":"Z.Q. Luo, J.S. Pang, and D. Ralph, Mathematical Programs with Equilibrium Constraints, Cambridge University Press, 1996.,","DOI":"10.1017\/CBO9780511983658"},{"key":"3075_CR20","unstructured":"A. Raghunathan and L. Biegler, \u201cMPEC formulations and algorithms in process engineering,\u201d Technical report, Carnegie Mellon University, Department of Chemical Engineering, Pittsburgh, PA, 2002.,"},{"key":"3075_CR21","unstructured":"D. Ralph, \u201cSequential quadratic programming for mathematical programs with linear complementarity constraints,\u201d in Computational Techniques and Applications: CTAC95, R.L. May and A.K. Easton (Eds.), World Scientific, 1996, pp. 663\u2013668.,"},{"key":"3075_CR22","unstructured":"R.T. Rockafellar, The Theory of Subgradients and its Applications to Problems in Optimization: Convex and Nonoconvex Functions, Helderman Verlag, Berlin, 1981.,"},{"key":"3075_CR23","doi-asserted-by":"crossref","unstructured":"S. Scholtes, \u201cConvergence properties of a regularization scheme for mathematical programs with complementarity constraints,\u201d SIAM J. Optim., vol. 11, pp. 918\u2013936, 2001.,","DOI":"10.1137\/S1052623499361233"},{"key":"3075_CR24","doi-asserted-by":"crossref","unstructured":"S. Scholtes and M. St\u00f6hr, \u201cExact penalization of mathematical programs with equilibrium constraints,\u201d SIAM J. Control Optim., vol. 37, pp. 617\u2013652, 1999.,","DOI":"10.1137\/S0363012996306121"},{"key":"3075_CR25","doi-asserted-by":"crossref","unstructured":"S. Scholtes and M. St\u00f6hr, \u201cHow stringent is the linear independence assumption for mathematical programs with complementarity constraints,\u201d Math. Oper. Res., vol. 26, pp. 851\u2013863, 2001.,","DOI":"10.1287\/moor.26.4.851.10007"},{"key":"3075_CR26","doi-asserted-by":"crossref","unstructured":"Y. Yuan, \u201cOn the convergence of a new trust region algorithm,\u201d Numer. Math., vol. 70, pp. 515\u2013539, 1995.,","DOI":"10.1007\/s002110050133"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-3075-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-005-3075-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-3075-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:29Z","timestamp":1559288189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-005-3075-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,18]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,5]]}},"alternative-id":["3075"],"URL":"https:\/\/doi.org\/10.1007\/s10589-005-3075-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10,18]]}}}