{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:50:08Z","timestamp":1783011008708,"version":"3.54.6"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,3,18]],"date-time":"2014-03-18T00:00:00Z","timestamp":1395100800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10957-014-0530-x","type":"journal-article","created":{"date-parts":[[2014,3,18]],"date-time":"2014-03-18T03:55:17Z","timestamp":1395114917000},"page":"234-245","source":"Crossref","is-referenced-by-count":2,"title":["Boundedness of a Type of Iterative Sequences in Two-Dimensional Quadratic Programming"],"prefix":"10.1007","volume":"164","author":[{"given":"Hoang Ngoc","family":"Tuan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,3,18]]},"reference":[{"key":"530_CR1","volume-title":"Nonlinear Parametric Optimization","author":"B Bank","year":"1983","unstructured":"Bank, B., Guddat, J., Klatte, D., Kummer, B., Tammer, K.: Nonlinear Parametric Optimization. Birkhuser Verlag, Basel-Boston (1983)"},{"key":"530_CR2","volume-title":"The Linear Complementarity Problem","author":"RW Cottle","year":"1992","unstructured":"Cottle, R.W., Pang, J.-S., Stone, R.E.: The Linear Complementarity Problem. Academic Press, New York (1992)"},{"key":"530_CR3","unstructured":"Lee, G.M., Tam, N.N., Yen, N.D.: Quadratic Programming and Affine Variational Inequalities: A Qualitative Study. Nonconvex Optimization and Its Applications, vol. 78. Springer, New York (2005)"},{"key":"530_CR4","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Nav. Res. Logist. Q. 3, 95\u2013110 (1956)","journal-title":"Nav. Res. Logist. Q."},{"key":"530_CR5","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF01584097","volume":"1","author":"A Majthay","year":"1971","unstructured":"Majthay, A.: Optimality conditions for quadratic programming. Math. Program. 1, 359\u2013365 (1971)","journal-title":"Math. Program."},{"key":"530_CR6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01396705","volume":"34","author":"L Contesse","year":"1980","unstructured":"Contesse, L.: Une caract\u00e9risation compl\u00e8te des minima locaux en programmation quadratique. Numer. Math. 34, 315\u2013332 (1980)","journal-title":"Numer. Math."},{"key":"530_CR7","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/moor.17.1.77","volume":"17","author":"MS Gowda","year":"1992","unstructured":"Gowda, M.S., Pang, J.-S.: On solution stability of the linear complementarity problem. Math. Oper. Res. 17, 77\u201383 (1992)","journal-title":"Math. Oper. Res."},{"key":"530_CR8","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s101070050052","volume":"85","author":"NN Tam","year":"1999","unstructured":"Tam, N.N., Yen, N.D.: Continuity properties of the Karush\u2013Kuhn\u2013Tucker point set in quadratic programming problems. Math. Program. A 85, 193\u2013206 (1999)","journal-title":"Math. Program. A"},{"key":"530_CR9","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/PL00011404","volume":"89","author":"HX Phu","year":"2001","unstructured":"Phu, H.X., Yen, N.D.: On the stability of solutions to quadratic programming problems. Math. Program. A 89, 385\u2013394 (2001)","journal-title":"Math. Program. A"},{"key":"530_CR10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1014011906646","volume":"23","author":"NN Tam","year":"2002","unstructured":"Tam, N.N.: Continuity of the optimal value function in indefinite quadratic programming. J. Glob. Optim. 23, 43\u201361 (2002)","journal-title":"J. Glob. Optim."},{"key":"530_CR11","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s10898-004-1944-z","volume":"32","author":"GM Lee","year":"2005","unstructured":"Lee, G.M., Tam, N.N., Yen, N.D.: On the optimal value function of a linearly perturbed quadratic program. J. Glob. Optim. 32, 119\u2013134 (2005)","journal-title":"J. Glob. Optim."},{"key":"530_CR12","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/s10957-006-9076-x","volume":"129","author":"GM Lee","year":"2006","unstructured":"Lee, G.M., Tam, N.N., Yen, N.D.: Continuity of the solution map in quadratic programs under linear perturbations. J. Optim. Theory Appl. 129, 415\u2013423 (2006)","journal-title":"J. Optim. Theory Appl."},{"key":"530_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01096531","volume":"4","author":"IM Bomze","year":"1994","unstructured":"Bomze, I.M., Danninger, G.: A finite algorithm for solving general quadratic problems. J. Glob. Optim. 4, 1\u201316 (1994)","journal-title":"J. Glob. Optim."},{"key":"530_CR14","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s10898-004-6095-8","volume":"33","author":"R Cambini","year":"2005","unstructured":"Cambini, R., Sodini, C.: Decomposition methods for solving nonconvex quadratic programs via Branch and Bound. J. Glob. Optim. 33, 313\u2013336 (2005)","journal-title":"J. Glob. Optim."},{"key":"530_CR15","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1008288411710","volume":"11","author":"T Pham Dinh","year":"1997","unstructured":"Pham Dinh, T., Le Thi, H.A.: Solving a class of linearly constrained indefinite quadratic programming problems by D.C. algorithms. J. Glob. Optim. 11, 253\u2013285 (1997)","journal-title":"J. Glob. Optim."},{"key":"530_CR16","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1023\/A:1008240227198","volume":"13","author":"T Pham Dinh","year":"1998","unstructured":"Pham Dinh, T., Le Thi, H.A.: A branch and bound method via DC optimization algorithm and ellipsoidal techniques for box constrained nonconvex quadratic programming problems. J. Glob. Optim. 13, 171\u2013206 (1998)","journal-title":"J. Glob. Optim."},{"key":"530_CR17","first-page":"289","volume":"22","author":"T Pham Dinh","year":"1997","unstructured":"Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to D.C. programming: theory, algorithms and applications. Acta Math. Vietnam. 22, 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam."},{"key":"530_CR18","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1080\/10556780802263990","volume":"23","author":"T Pham Dinh","year":"2008","unstructured":"Pham Dinh, T., Le Thi, H.A., Akoa, F.: Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming. Optim. Methods Softw. 23, 609\u2013629 (2008)","journal-title":"Optim. Methods Softw."},{"key":"530_CR19","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/s10898-010-9573-1","volume":"49","author":"HA Thi Le","year":"2011","unstructured":"Le Thi, H.A., Pham Dinh, T., Yen, N.D.: Properties of two DC algorithms in quadratic programming. J. Glob. Optim. 49, 481\u2013495 (2011)","journal-title":"J. Glob. Optim."},{"key":"530_CR20","unstructured":"Polyak, B.T.: Introduction to Optimization. Translated from the Russian. Optimization Software, Inc., Publications Division, New York (1987)"},{"key":"530_CR21","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"T Pham Dinh","year":"1998","unstructured":"Pham Dinh, T., Le Thi, H.A.: A D.C. optimization algorithm for solving the trust-region subproblem. SIAM J. Optim. 8, 476\u2013505 (1998)","journal-title":"SIAM J. Optim."},{"key":"530_CR22","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s10898-011-9696-z","volume":"53","author":"HA Thi Le","year":"2012","unstructured":"Le Thi, H.A., Pham Dinh, T., Yen, N.D.: Behavior of DCA sequences for solving the trust-region subproblem. J. Glob. Optim. 53, 317\u2013329 (2012)","journal-title":"J. Glob. Optim."},{"key":"530_CR23","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s10898-011-9820-0","volume":"55","author":"HN Tuan","year":"2013","unstructured":"Tuan, H.N., Yen, N.D.: Convergence of Pham Dinh\u2013Le Thi Algorithm for the trust-region subproblem. J. Glob. Optim. 55, 337\u2013347 (2013)","journal-title":"J. Glob. Optim."},{"key":"530_CR24","doi-asserted-by":"crossref","first-page":"904","DOI":"10.1007\/s10957-012-0041-6","volume":"154","author":"HN Tuan","year":"2012","unstructured":"Tuan, H.N.: Convergence rate of Pham Dinh\u2013Le Thi algorithm for the trust-region subproblem. J. Optim. Theory Appl. 154, 904\u2013915 (2012)","journal-title":"J. Optim. Theory Appl."},{"key":"530_CR25","volume-title":"Convex Analysis. Princeton Mathematical Series","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton Mathematical Series. Princeton University Press, Princeton (1970)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-014-0530-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-014-0530-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-014-0530-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:58:36Z","timestamp":1559469516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-014-0530-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,18]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["530"],"URL":"https:\/\/doi.org\/10.1007\/s10957-014-0530-x","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,18]]}}}