{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T02:29:46Z","timestamp":1648693786547},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"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,6]]},"DOI":"10.1007\/s11424-011-8105-5","type":"journal-article","created":{"date-parts":[[2011,6,13]],"date-time":"2011-06-13T00:03:59Z","timestamp":1307923439000},"page":"604-618","source":"Crossref","is-referenced-by-count":1,"title":["A new \u025b-generalized projection method of strongly sub-feasible directions for inequality constrained optimization"],"prefix":"10.1007","volume":"24","author":[{"given":"Jinbao","family":"Jian","sequence":"first","affiliation":[]},{"given":"Guodong","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Chuanhao","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,14]]},"reference":[{"key":"8105_CR1","volume-title":"Methods of Feasible Directions","author":"G. Zoutendijk","year":"1960","unstructured":"G. Zoutendijk, Methods of Feasible Directions, Elsevier, Amsterdam, 1960."},{"issue":"1","key":"8105_CR2","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0108011","volume":"8","author":"J. B. Rosen","year":"1960","unstructured":"J. B. Rosen, The gradient projection method for nonlinear programming, part I, linear constraints, SIAM J. Appl. Math., 1960, 8(1): 181\u2013217.","journal-title":"SIAM J. Appl. Math."},{"issue":"2","key":"8105_CR3","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/0305018","volume":"5","author":"D. M. Topkis","year":"1967","unstructured":"D. M. Topkis and A. F. Veinott, On the convergence of some feasible direction algorithms for nonlinear programming, SIAM J. Control, 1967, 5(2): 268\u2013279.","journal-title":"SIAM J. Control"},{"issue":"10","key":"8105_CR4","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1137\/0710017","volume":"1","author":"O. Pironneau","year":"1973","unstructured":"O. Pironneau and E. Polak, Rate of convergence of a class of method of feasible directions, SIAM J. Num. Anal., 1973, 1(10): 161\u2013173.","journal-title":"SIAM J. Num. Anal."},{"key":"8105_CR5","first-page":"378","volume":"4","author":"D. Z. Du","year":"1983","unstructured":"D. Z. Du and J. Sun, A new gradient projection method, Math. Numer. Sinica, 1983, 4: 378\u2013386.","journal-title":"Math. Numer. Sinica"},{"key":"8105_CR6","first-page":"1444","volume":"19","author":"Z. Y. Gao","year":"1991","unstructured":"Z. Y. Gao and G. P. He, A generalized gradient projection method for constrained optimization, Kexue Tongbao, 1991, 19: 1444\u20131447.","journal-title":"Kexue Tongbao"},{"issue":"4","key":"8105_CR7","first-page":"374","volume":"15","author":"Y. L. Lai","year":"1995","unstructured":"Y. L. Lai and J. B. Jian, A generalized gradient projection method with initial point for the optimized problem with nonlinear constraints, J. Sys. Sci. and Math. Scis., 1995, 15(4): 374\u2013380.","journal-title":"J. Sys. Sci. and Math. Scis."},{"key":"8105_CR8","first-page":"7","volume":"8","author":"D. Z. Du","year":"1985","unstructured":"D. Z. Du, A gradient projection algorithm for nonlinear constraints, J. Acta Math. Appl. Sini., 1985, 8: 7\u201316.","journal-title":"J. Acta Math. Appl. Sini."},{"issue":"1","key":"8105_CR9","first-page":"27","volume":"18","author":"S. J. Xue","year":"1997","unstructured":"S. J. Xue and J. B. Jian, A generalized gradient projection method under nonlinear constraints, J. Jinan Univ., 1997, 18(1): 27\u201332.","journal-title":"J. Jinan Univ."},{"key":"8105_CR10","first-page":"301","volume":"28","author":"D. Z. Du","year":"1983","unstructured":"D. Z. Du, A modification of Rosen-Polak\u2019s algorithm, Kexue Tongbao, 1983, 28: 301\u2013305.","journal-title":"Kexue Tongbao"},{"key":"8105_CR11","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF01588225","volume":"17","author":"E. Polak","year":"1979","unstructured":"E. Polak, R. Trhan, and D. Q. Mayne, Combined Phase I-Phase II methods of feasible directions, Math. Prog., 1979, 17: 61\u201373.","journal-title":"Math. Prog."},{"issue":"1","key":"8105_CR12","first-page":"64","volume":"12","author":"J. B. Jian","year":"1995","unstructured":"J. B. Jian, Strong combined Phase I-Phase II methods of sub-feasible directions, J. Math. Econom., 1995, 12(1): 64\u201370.","journal-title":"J. Math. Econom."},{"key":"8105_CR13","volume-title":"Researches on superlinearly and quadratically convergent algorithms for nonlinearly constrained optimization","author":"J. B. Jian","year":"2000","unstructured":"J. B. Jian, Researches on superlinearly and quadratically convergent algorithms for nonlinearly constrained optimization, Ph. D. Thesis, School of Xi\u2019an Jiaotong Univ., Xi\u2019an, China, 2000."},{"issue":"8","key":"8105_CR14","first-page":"88","volume":"33","author":"J. B. Jian","year":"1999","unstructured":"J. B. Jian and K. C. Zhang, Sub-feasible direction method with strong convergence for inequality constrained optimization, J. Xi\u2019 an Jiaotong Univ., 1999, 33(8): 88\u2013103.","journal-title":"J. Xi\u2019 an Jiaotong Univ."},{"key":"8105_CR15","first-page":"207","volume":"12","author":"J. B. Jian","year":"2004","unstructured":"J. B. Jian and Y. M. Liang, Finitely convergent algorithm of generalized gradient projection for systems of nonlinear inequalities, Neural, Parallel and Sci. Comput., 2004, 12: 207\u2013218.","journal-title":"Neural, Parallel and Sci. Comput."},{"issue":"5","key":"8105_CR16","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.1109\/TAC.1982.1103081","volume":"27","author":"M. Fukushima","year":"1982","unstructured":"M. Fukushima, A finitely convergent algorithm for convex inequalities, IEEE Trams. Autom. Contr., 1982, 27(5): 1126\u20131127.","journal-title":"IEEE Trams. Autom. Contr."},{"issue":"4","key":"8105_CR17","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/j.aml.2006.05.007","volume":"20","author":"J. B. Jian","year":"2007","unstructured":"J. B. Jian, X. L. Zhang, and R. Quan, A new finitely convergent algorithm for systems of nonlinear inequalities, Appl. Math. Letter, 2007, 20(4): 405\u2013411.","journal-title":"Appl. Math. Letter"},{"issue":"9","key":"8105_CR18","doi-asserted-by":"crossref","first-page":"1715","DOI":"10.2514\/3.12815","volume":"33","author":"O. A. Elwakeil","year":"1995","unstructured":"O. A. Elwakeil and J. S. Arora, Methods for finding feasible points in constrained optimization, AIAA Journal, 1995, 33(9): 1715\u20131719.","journal-title":"AIAA Journal"},{"issue":"2","key":"8105_CR19","first-page":"1445","volume":"332","author":"J. B. Jian","year":"2007","unstructured":"J. B. Jian, W. X. Cheng, and X. Y. Ke, Finitely convergent \u025b-generalized projection algorithm for nonlinear systems, J. Math. Anal. Appl., 2007, 332(2): 1445\u20131458.","journal-title":"J. Math. Anal. Appl."},{"key":"8105_CR20","doi-asserted-by":"crossref","unstructured":"W. Hock and K. Schittkowski, Test examples for nonlinear programming codes, Lecture Notes in Economics and Mathematical Systems, Springer, 1981.","DOI":"10.1007\/978-3-642-48320-2"},{"key":"8105_CR21","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/200979.201043","volume":"21","author":"I. Bongartz","year":"1995","unstructured":"I. Bongartz, A. R. Conn, N. I. Gould, and PH. L. Toint, CUTE: Constrained and unconstrained testing environment, ACM Tras. Math. Software, 1995, 21: 123\u2013160.","journal-title":"ACM Tras. Math. Software"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-011-8105-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-011-8105-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-011-8105-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T17:30:24Z","timestamp":1560274224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-011-8105-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["8105"],"URL":"https:\/\/doi.org\/10.1007\/s11424-011-8105-5","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6]]}}}