{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:57:47Z","timestamp":1760245067001},"reference-count":25,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[1999,7]]},"DOI":"10.1016\/s0096-3003(98)10025-5","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T22:33:30Z","timestamp":1049495610000},"page":"257-272","source":"Crossref","is-referenced-by-count":22,"title":["A generalization of the norm-relaxed method of feasible directions"],"prefix":"10.1016","volume":"102","author":[{"given":"X.B.","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.M.","family":"Kostreva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0096-3003(98)10025-5_BIB1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01758824","article-title":"An optimization algorithm based on the method of feasible directions","volume":"9","author":"Belegundu","year":"1995","journal-title":"Struct. Optimiz."},{"key":"10.1016\/S0096-3003(98)10025-5_BIB2","unstructured":"G.N. Vanderplaats, Numerical Optimization Techniques for Engineering Design, McGraw-Hill, New York, 1984"},{"key":"10.1016\/S0096-3003(98)10025-5_BIB3","doi-asserted-by":"crossref","first-page":"1633","DOI":"10.2514\/3.8829","article-title":"Efficient feasible directions algorithm for design synthesis","volume":"22","author":"Vanderplaats","year":"1984","journal-title":"AIAA J."},{"key":"10.1016\/S0096-3003(98)10025-5_BIB4","unstructured":"G.N. Vanderplaats, DOT\/DOC Users Manual, Vanderplaats, Miura and Associates, 1993"},{"key":"10.1016\/S0096-3003(98)10025-5_BIB5","unstructured":"E. Polak, Computational Methods in Optimization, Academic Press, New York, 1971"},{"key":"10.1016\/S0096-3003(98)10025-5_BIB6","unstructured":"G. Zoutendijk, Methods of Feasible Directions, Elsevier, Amsterdam, 1960"},{"key":"10.1016\/S0096-3003(98)10025-5_BIB7","unstructured":"P. Wolfe, On the convergence of gradient methods under constraints, IBM Research Report RC 1752, Yorktown Heights, New York, 1967"},{"key":"10.1016\/S0096-3003(98)10025-5_BIB8","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/0305018","article-title":"On the convergence of some feasible direction algorithms for nonlinear programming","volume":"5","author":"Topkis","year":"1967","journal-title":"SIAM J. Control"},{"key":"10.1016\/S0096-3003(98)10025-5_BIB9","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1007\/BF01584544","article-title":"On the rate of convergence of certain methods of centers","volume":"2","author":"Pironneau","year":"1972","journal-title":"Math. Program."},{"key":"10.1016\/S0096-3003(98)10025-5_BIB10","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1137\/0710017","article-title":"Rate of convergence of a class of methods of feasible directions","volume":"10","author":"Pironneau","year":"1973","journal-title":"SIAM J. Num. Anal."},{"key":"10.1016\/S0096-3003(98)10025-5_BIB11","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF00933624","article-title":"On the Pironneau\u2013Polak method of centers","volume":"20","author":"Chaney","year":"1976","journal-title":"J. Optimiz. Theory Applications"},{"key":"10.1016\/S0096-3003(98)10025-5_BIB12","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00933625","article-title":"On the rate of convergence of some feasible direction algorithm","volume":"20","author":"Chaney","year":"1976","journal-title":"J. Optimiz. Theory Applications"},{"key":"10.1016\/S0096-3003(98)10025-5_BIB13","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF01371083","article-title":"A generalized quadratic programming-based phase I\u2013phase II method for inequality constrained optimization","volume":"26","author":"Wiest","year":"1992","journal-title":"J. Appl. Math. and Optimiz."},{"key":"10.1016\/S0096-3003(98)10025-5_BIB14","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF01588225","article-title":"Combined phase I\u2013phase II methods of feasible directions","volume":"17","author":"Polak","year":"1979","journal-title":"Math. Program."},{"key":"10.1016\/S0096-3003(98)10025-5_BIB15","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF02591987","article-title":"A two-stage feasible directions algorithm for nonlinear constrained optimization","volume":"36","author":"Herskovits","year":"1986","journal-title":"Math. Program."},{"key":"10.1016\/S0096-3003(98)10025-5_BIB16","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF02190059","article-title":"Norm-relaxed method of feasible directions for solving nonlinear programming problems","volume":"83","author":"Cawood","year":"1994","journal-title":"J. Optimiz. Theory Applications"},{"key":"10.1016\/S0096-3003(98)10025-5_BIB17","unstructured":"J.A. Korycki, Norm-relaxed method of feasible directions, Ph.D. Dissertation, Department of Mathematical Sciences, Clemson University (1995)"},{"key":"10.1016\/S0096-3003(98)10025-5_BIB18","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF02190102","article-title":"Convergence analysis of norm-relaxed method of feasible directions","volume":"91","author":"Korycki","year":"1996","journal-title":"J. Optimiz. Theory Applications"},{"key":"10.1016\/S0096-3003(98)10025-5_BIB19","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01197034","article-title":"Norm-relaxed method of feasible directions: Application in structural optimization","volume":"11","author":"Korycki","year":"1996","journal-title":"Struct. Optimiz."},{"key":"10.1016\/S0096-3003(98)10025-5_BIB20","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1023\/A:1022655129695","article-title":"Self-tuning norm-relaxed method of feasible directions","volume":"92","author":"Korycki","year":"1997","journal-title":"J. Optimiz. Theory Applications"},{"key":"10.1016\/S0096-3003(98)10025-5_BIB21","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF00939630","article-title":"Generalization of Murty's direct algorithm to linear and convex quadratic programming","volume":"62","author":"Kostreva","year":"1989","journal-title":"J. Optimiz. Theory Applications"},{"key":"10.1016\/S0096-3003(98)10025-5_BIB22","doi-asserted-by":"crossref","unstructured":"M.M. Kostreva, X.B. Chen, J.A. Korycki, A norm-relaxed method of feasible directions for solving nonlinear programming problems, in: Proc. Sixth AIAA\/USAF\/NASA\/ISSMO Symposium on Multidisciplinary Analysis and Optimization, Bellevue, WA, September 1996","DOI":"10.2514\/6.1996-4006"},{"key":"10.1016\/S0096-3003(98)10025-5_BIB23","unstructured":"M.S. Bazaraa, H.D. Sherali, C.M. Shetty, Nonlinear Programming: Theory and Algorithms, second edition, Wiley, 1993"},{"key":"10.1016\/S0096-3003(98)10025-5_BIB24","doi-asserted-by":"crossref","unstructured":"W. Hock, K. Schittkowski, Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems, vol. 187, Springer, Berlin, 1981","DOI":"10.1007\/978-3-642-48320-2"},{"key":"10.1016\/S0096-3003(98)10025-5_BIB25","doi-asserted-by":"crossref","unstructured":"K. Schittkowski, More Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems, vol. 282, Springer, Berlin, 1987","DOI":"10.1007\/978-3-642-61582-5"}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300398100255?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300398100255?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T06:24:22Z","timestamp":1555050262000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300398100255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":25,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["S0096300398100255"],"URL":"https:\/\/doi.org\/10.1016\/s0096-3003(98)10025-5","relation":{},"ISSN":["0096-3003"],"issn-type":[{"value":"0096-3003","type":"print"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}