{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T16:08:58Z","timestamp":1725984538380},"publisher-location":"Singapore","reference-count":10,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811316500"},{"type":"electronic","value":"9789811316517"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-981-13-1651-7_13","type":"book-chapter","created":{"date-parts":[[2018,7,20]],"date-time":"2018-07-20T10:20:29Z","timestamp":1532082029000},"page":"152-162","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Dual Internal Point Filter Algorithm Based on Orthogonal Design"],"prefix":"10.1007","author":[{"given":"Yijin","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianyu","family":"Huo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Lan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanyou","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,21]]},"reference":[{"issue":"2","key":"13_CR1","first-page":"239","volume":"91","author":"NIM Gould","year":"2010","unstructured":"Gould, N.I.M., Toint, P.L.: Nonlinear programming without a penalty function or a filter. Math. Program. 91(2), 239\u2013269 (2010)","journal-title":"Math. Program."},{"issue":"22","key":"13_CR2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s10107-016-1003-9","volume":"161","author":"FE Curtis","year":"2017","unstructured":"Curtis, F.E., Gould, N.I.M., Robinson, D.P., Toint, P.L.: An interior-point trust-funnel algorithm for nonlinear optimization. Math. Program. 161(22), 73\u2013134 (2017)","journal-title":"Math. Program."},{"key":"13_CR3","unstructured":"Bohme, T.J., Frank, B.: Introduction to nonlinear programming, pp. 3\u201318. Springer, Potsdam (2017)"},{"key":"13_CR4","first-page":"1","volume":"12","author":"Z Darvay","year":"2017","unstructured":"Darvay, Z., Tak\u00e1cs, P.R.: New method for determining search directions for interior-point algorithms in linear optimization. Optim. Lett. 12, 1\u201318 (2017)","journal-title":"Optim. Lett."},{"issue":"4","key":"13_CR5","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1080\/01630563.2016.1138127","volume":"37","author":"X Yang","year":"2016","unstructured":"Yang, X., Zhang, Y., Liu, H., Shen, P.: A new second-order infeasible primal-dual path-following algorithm for symmetric optimization. Numer. Funct. Anal. Optim. 37(4), 499\u2013519 (2016)","journal-title":"Numer. Funct. Anal. Optim."},{"issue":"1","key":"13_CR6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A Wachter","year":"2006","unstructured":"Wachter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."},{"issue":"6","key":"13_CR7","first-page":"1","volume":"2014","author":"Q Zhang","year":"2014","unstructured":"Zhang, Q., Zeng, S., Wu, C.: Orthogonal design method for optimizing roughly designed antenna. Int. J. Antennas Propag. 2014(6), 1\u20139 (2014)","journal-title":"Int. J. Antennas Propag."},{"issue":"2","key":"13_CR8","first-page":"37","volume":"19","author":"RH Byrd","year":"1998","unstructured":"Byrd, R.H., Liu, G., Nocedal, J.: On the local behavior of an interior point method for nonlinear programming. Numer. Anal. 19(2), 37\u201356 (1998)","journal-title":"Numer. Anal."},{"issue":"2","key":"13_CR9","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s101070100244","volume":"91","author":"R Fletcher","year":"2002","unstructured":"Fletcher, R., Leyffer, S.: Nonlinear programming without a penalty function. Math. Program. 91(2), 239\u2013269 (2002)","journal-title":"Math. Program."},{"issue":"2","key":"13_CR10","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF00932517","volume":"21","author":"JT Betts","year":"1977","unstructured":"Betts, J.T.: An accelerated multiplier method for nonlinear programming. J. Optim. Theory Appl. 21(2), 137\u2013174 (1977)","journal-title":"J. Optim. Theory Appl."}],"container-title":["Communications in Computer and Information Science","Computational Intelligence and Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-1651-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,20]],"date-time":"2018-07-20T10:26:20Z","timestamp":1532082380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-1651-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9789811316500","9789811316517"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-1651-7_13","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]}}}