{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:15:52Z","timestamp":1743102952033,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":98,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_573","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:09:38Z","timestamp":1219662578000},"page":"3345-3354","source":"Crossref","is-referenced-by-count":0,"title":["Rosen\u2019s Method, Global Convergence, and Powell\u2019s Conjecture"],"prefix":"10.1007","author":[{"given":"Ding-Zhu","family":"Du","sequence":"first","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"573_CR1_573","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/BF02591740","volume":"37","author":"E. Allen","year":"1987","unstructured":"Allen E, Helgason R, Kennington J (1987) A\u00a0generalization of Polyak's convergence result for subgradient optimization. Math\n\tProgram 37:309\u2013318","journal-title":"Math. Program."},{"key":"573_CR2_573","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2140\/pjm.1966.16.1","volume":"16","author":"L. Armijo","year":"1966","unstructured":"Armijo L (1966) Minimization of functions having Lipschitz continuous first partial derivatives. Pacific J Math\n\t16:1\u20133","journal-title":"Pacific J. Math."},{"key":"573_CR3_573","volume-title":"Nonlinear programming: Analysis and methods","author":"M. Avriel","year":"1976","unstructured":"Avriel M (1976) Nonlinear programming: Analysis and methods. Prentice-Hall, Englewood Cliffs"},{"key":"573_CR4_573","volume-title":"Nonlinear programming: Theory and algorithms","author":"M.S. Bazaraa","year":"1979","unstructured":"Bazaraa MS, Shetty CM (1979) Nonlinear programming: Theory and algorithms. Wiley, New York"},{"issue":"2","key":"573_CR5_573","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/moor.2.2.103","volume":"2","author":"R.G. Bland","year":"1977","unstructured":"Bland RG (1977) New finite pivoting rules for the simplex method. Math Oper Res 2(2):103\u2013107","journal-title":"Math. Oper. Res."},{"key":"573_CR6_573","doi-asserted-by":"publisher","first-page":"577","DOI":"10.2307\/2003941","volume":"19","author":"C.G. Broyden","year":"1965","unstructured":"Broyden CG (1965) A\u00a0class of methods for solving nonlinear simultaneous equations. Math Comput 19:577\u2013593","journal-title":"Math. Comput."},{"key":"573_CR7_573","doi-asserted-by":"publisher","first-page":"368","DOI":"10.2307\/2003239","volume":"21","author":"C.G. Broyden","year":"1967","unstructured":"Broyden CG (1967) Quasi-Newton methods and their application to function minimization. Math Comput 21:368\u2013381","journal-title":"Math. Comput."},{"key":"573_CR8_573","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1093\/imamat\/6.1.76","volume":"6","author":"C.G. Broyden","year":"1970","unstructured":"Broyden CG (1970) The convergence of a\u00a0class of double-rank minimization algorithms 1: general consideration. J\u00a0Inst Math Appl\n\t6:76\u201390","journal-title":"J. Inst. Math. Appl."},{"key":"573_CR9_573","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1093\/imamat\/6.3.222","volume":"6","author":"C.G. Broyden","year":"1970","unstructured":"Broyden CG (1970) The convergence of a\u00a0class of double-rank minimization algorithms 2: the new algorithms. J\u00a0Inst Math Appl\n\t6:222\u2013231","journal-title":"J. Inst. Math. Appl."},{"key":"573_CR10_573","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01580443","volume":"8","author":"A. Buckley","year":"1975","unstructured":"Buckley A (1975) An alternate implementation of Goldfarb's minimization algorithm. Math Program 8:207\u2013231","journal-title":"Math. Program."},{"key":"573_CR11_573","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01586093","volume":"32","author":"R.H. Byrd","year":"1985","unstructured":"Byrd RH (1985) An example of irregular convergence in some constrained optimization methods that use the projected Hessian. Math\n\tProgram 32:232\u2013237","journal-title":"Math. Program."},{"key":"573_CR12_573","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1137\/0724077","volume":"24","author":"R.H. Byrd","year":"1987","unstructured":"Byrd RH, Nocedal J, Yuan Y (1987) Global convergence of a\u00a0class of quasi-Newton method on convex problems. SIAM J Numer Anal\n\t24:1171\u20131190","journal-title":"SIAM J. Numer. Anal."},{"key":"573_CR13_573","unstructured":"Byrd RH, Shultz GA. A\u00a0practical\n      class of globally convergent active set strategies for linearly constrained optimization. Manuscript (unpublished)"},{"key":"573_CR14_573","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF02592073","volume":"39","author":"P.H. Calamai","year":"1987","unstructured":"Calamai PH, More JJ (1987) Projected gradient methods for linearly constrained problems. Math Program 39:93\u2013116","journal-title":"Math. Program."},{"key":"573_CR15_573","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1137\/0721051","volume":"1","author":"T.F. Coleman","year":"1984","unstructured":"Coleman TF, Conn AR (1984) On the local convergence of a\u00a0quasi-Newton method for the nonlinear programming problem. SIAM J Numer\n\tAnal 1:755\u2013769","journal-title":"SIAM J. Numer. Anal."},{"key":"573_CR16_573","doi-asserted-by":"crossref","unstructured":"Davidon WC (1959) Variable metric\n      method for minimization. AEC Res Developm Report ANL-5990, no. nov","DOI":"10.2172\/4252678"},{"key":"573_CR17_573","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1093\/comjnl\/10.4.406","volume":"10","author":"W.C. Davidon","year":"1968","unstructured":"Davidon WC (1968) Variable metric method for minimization. Comput J 10:406\u2013410","journal-title":"Computer J."},{"key":"573_CR18_573","unstructured":"Dax A (1978) The gradient\n      projection method for quadratic programming. Report, Inst Math, Hebrew Univ, Jerusalem"},{"key":"573_CR19_573","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF02591957","volume":"31","author":"R.S. Dembo","year":"1985","unstructured":"Dembo RS, Klincewicz JG (1985) Dealing with degeneracy in reduced gradient algorithms. Math Program 31:257\u2013363","journal-title":"Math. Program."},{"key":"573_CR20_573","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/BF01584554","volume":"2","author":"L.C.W. Dixon","year":"1972","unstructured":"Dixon LCW (1972) Quasi-Newton algorithms generate identical points. Math Program 2:383\u2013387","journal-title":"Math. Program."},{"key":"573_CR21_573","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF01585007","volume":"3","author":"L.C.W. Dixon","year":"1972","unstructured":"Dixon LCW (1972) Quasi-Newton algorithms generate identical points II, the proof of four new theorems. Math Program\n\t3:345\u2013358","journal-title":"Math. Program."},{"key":"573_CR22_573","first-page":"301","volume":"28","author":"D.-Z. Du","year":"1983","unstructured":"Du D-Z (1983) A\u00a0modification of Rosen-Polak's algorithm. Kexue Tongbao 28:301\u2013305","journal-title":"Kexue Tongbao"},{"issue":"2","key":"573_CR23_573","first-page":"142","volume":"8","author":"D.-Z. Du","year":"1985","unstructured":"Du D-Z (1985) Changing of point-to-set maps and point-to-set map families for continuities. Acta Math Applic Sinica 8(2):142\u2013150, in Chinese","journal-title":"Acta Math. Applic. Sinica"},{"key":"573_CR24_573","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01666514","volume":"2","author":"D.-Z. Du","year":"1985","unstructured":"Du D-Z (1985) A\u00a0family of gradient projection algorithms. Acta Math Applic Sinica, English Ser 2:1\u201313","journal-title":"Acta Math. Applic. Sinica, English Ser."},{"key":"573_CR25_573","first-page":"7","volume":"8","author":"D.-Z. Du","year":"1985","unstructured":"Du D-Z (1985) A\u00a0gradient projection algorithm for convex programming with nonlinear constraints. Acta Math Applic Sinica\n\t8:7\u201316, in Chinese","journal-title":"Acta Math. Applic. Sinica"},{"key":"573_CR26_573","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/BF02007671","volume":"3","author":"D.-Z Du","year":"1987","unstructured":"Du D-Z (1987) Remarks on the convergence of Rosen's gradient projection method. Acta Math Applic Sinica, English Ser\n\t3:270\u2013279","journal-title":"Acta Math. Applic. Sinica, English Ser."},{"key":"573_CR27_573","volume-title":"Gradient projection methods in linear and nonlinear programming","author":"D.-Z Du","year":"1988","unstructured":"Du D-Z (1988) Gradient projection methods in linear and nonlinear programming. Hadronic Press, Palm Harbor"},{"key":"573_CR28_573","volume-title":"Convergence theory of feasible direction methods","author":"D.-Z Du","year":"1991","unstructured":"Du D-Z (1991) Convergence theory of feasible direction methods. Sci Press, Marrickville, Australia"},{"key":"573_CR29_573","first-page":"68","volume-title":"Advances in Optimization and Parallel Computing","author":"D.-Z Du","year":"1992","unstructured":"Du D-Z (1992) Rosen's method and slope lemmas. In: Pardalos PM (ed) Advances in Optimization and Parallel Computing. Elsevier,\n\tAmsterdam, pp 68\u201384"},{"key":"573_CR30_573","first-page":"4","volume":"1","author":"D.-Z. Du","year":"1980","unstructured":"Du D-Z, Sun J, Song T-T (1980) A\u00a0counterexample for Rosen's gradient projection method. Math Assortment 1:4\u20136, in Chinese","journal-title":"Math. Assortment"},{"key":"573_CR31_573","unstructured":"Du D-Z, Du X-F. A\u00a0convergent\n      reduced gradient algorithm without using special pivot. Math Numer Sinica, to appear"},{"key":"573_CR32_573","first-page":"378","volume":"4","author":"D.-Z Du","year":"1983","unstructured":"Du D-Z, Sun J (1983) A\u00a0new gradient projection method. Math Numer Sinica 4:378\u2013386, in Chinese","journal-title":"Math. Numer. Sinica"},{"key":"573_CR33_573","first-page":"142","volume":"7","author":"D.-Z Du","year":"1984","unstructured":"Du D-Z, Sun J, Song T-T (1984) Simplified finite pivoting processes in the reduced gradient algorithms. Acta Math Applic Sinica\n\t7:142\u2013146, in Chinese","journal-title":"Acta Math. Applic. Sinica"},{"key":"573_CR34_573","unstructured":"Du D-Z, Wu F, Zhang X-S. On Rosen's\n      gradient projection methods. Ann Oper Res, to appear"},{"key":"573_CR35_573","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF02592021","volume":"36","author":"D.-Z Du","year":"1986","unstructured":"Du D-Z, Zhang X-S (1986) A\u00a0convergence theorem of Rosen's gradient projection method. Math Program\n\t36:135\u2013144","journal-title":"Math. Program."},{"key":"573_CR36_573","doi-asserted-by":"crossref","unstructured":"Du D-Z, Zhang X-S (1989) Global\n      convergence of Rosen's gradient projection methods. Math Program 44","DOI":"10.1007\/BF01587098"},{"key":"573_CR37_573","unstructured":"Du D-Z, Zhang X-S (1989) Notes on\n      a\u00a0new gradient projection method. System Sci and Math Sci 2"},{"key":"573_CR38_573","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1137\/0319022","volume":"19","author":"J.C. Dunn","year":"1981","unstructured":"Dunn JC (1981) Global and asymptotic convergence rate estimates for a\u00a0class of projected gradient processes. SIAM J Control Optim\n\t19:368\u2013400","journal-title":"SIAM J. Control Optim."},{"key":"573_CR39_573","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BF00939081","volume":"55","author":"J.C. Dunn","year":"1987","unstructured":"Dunn JC (1987) On the convergence of projected gradient processes to singular critical point. J\u00a0Optim Th Appl\n\t55:203\u2013216","journal-title":"J. Optim. Th. Appl."},{"key":"573_CR40_573","volume-title":"Practical methods of optimization, unconstrained optimization","author":"R. Fletcher","year":"1987","unstructured":"Fletcher R (1987) Practical methods of optimization, unconstrained optimization. Wiley, New York"},{"key":"573_CR41_573","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1093\/comjnl\/6.2.163","volume":"6","author":"R. Fletcher","year":"1963","unstructured":"Fletcher R, Powell MJD (1963) A\u00a0rapidly convergent descent method for minimization. Comput J 6:163\u2013168","journal-title":"Computer J."},{"key":"573_CR42_573","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1137\/0117067","volume":"17","author":"D. Goldfarb","year":"1969","unstructured":"Goldfarb D (1969) Extension of Davidon's variable metric method to maximization under linear inequality and equality constraints. SIAM\n\tJ Appl Math 17:739\u2013764","journal-title":"SIAM J. Appl. Math."},{"key":"573_CR43_573","doi-asserted-by":"publisher","first-page":"23","DOI":"10.2307\/2004873","volume":"24","author":"D. Goldfarb","year":"1970","unstructured":"Goldfarb D (1970) A\u00a0family of variable metric methods derived by variational means. Math Comput 24:23\u201326","journal-title":"Math. Comput."},{"key":"573_CR44_573","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2004872","volume":"24","author":"J. Goldstein","year":"1970","unstructured":"Goldstein J (1970) Variations on variable-metric methods. Math Comput 24:1\u201322","journal-title":"Math. Comput."},{"key":"573_CR45_573","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BF01883895","volume":"1","author":"X.-Y Gui","year":"1984","unstructured":"Gui X-Y, Du D-Z (1984) A\u00a0superlinearly convergent method to linearly constrained optimization problems under degeneracy. Acta Math\n\tApplic Sinica, English Ser 1:76\u201384","journal-title":"Acta Math. Applic. Sinica, English Ser."},{"key":"573_CR46_573","first-page":"615","volume":"20","author":"A. Haraux","year":"1977","unstructured":"Haraux A (1977) How to differentiate the projection on a\u00a0convex set in Hilbert space: Some applications to variational\n\tinequalities. J\u00a0Math Soc Japan 20:615\u2013631","journal-title":"J. Math. Soc. Japan"},{"key":"573_CR47_573","doi-asserted-by":"crossref","unstructured":"He G-Z (1990) Proof of convergence of\n      Rosen's gradient projection method. Acta Math Applic Sinica 1","DOI":"10.1007\/BF02014710"},{"key":"573_CR48_573","unstructured":"Hu X-D (1989) Nonlinear programming:\n      A\u00a0unified approach and the upper bound of partial concentrator. PhD Thesis, Inst Appl Math, Chinese Acad Sci"},{"key":"573_CR49_573","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF00927440","volume":"5","author":"H.Y. Huang","year":"1970","unstructured":"Huang HY (1970) Unified approach to quadratically convergent algorithms for function minimization. J\u00a0Optim Th Appl\n\t5:405\u2013423","journal-title":"J. Optim. Th. Appl."},{"key":"573_CR50_573","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/BF01580449","volume":"8","author":"P. Huard","year":"1975","unstructured":"Huard P (1975) Optimization algorithms and point-to-set maps. Math Program 8:308\u2013331","journal-title":"Math. Program."},{"key":"573_CR51_573","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/BFb0120846","volume":"10","author":"P. Huard","year":"1979","unstructured":"Huard P (1979) Extensions of Zangwill's theorem. Math Program Stud 10:98\u2013103","journal-title":"Math. Program. Stud."},{"key":"573_CR52_573","unstructured":"Kalfon P, Ribiere G, Sogno JC (1969)\n      A\u00a0method of feasible directions using projection operators. Proc IFIP congr 68: Information Processing, 1 North-Holland"},{"key":"573_CR53_573","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"Karmarkar N (1984) A\u00a0new polynomial-time algorithm for linear programming. Combinatorica 4:373\u2013395","journal-title":"Combinatorica"},{"key":"573_CR54_573","volume-title":"Inequalities","author":"V. Klee","year":"1972","unstructured":"Klee V, Minty GJ (1972) How good is the simplex algorithm? In: Shisha O (ed) Inequalities III. Acad Press, New York"},{"key":"573_CR55_573","volume-title":"O.R. 1978","author":"H.-Y Kwei","year":"1979","unstructured":"Kwei H-Y, Gui X-Y, Wu F, Lai Y-L (1979) Extension of a\u00a0variable metric algorithm to a\u00a0linearly constrained optimization\n\tproblem: A\u00a0variation of Goldfarb's algorithm. In: Haley KB (ed) O.R. 1978. North-Holland, Amsterdam"},{"issue":"5","key":"573_CR56_573","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(66)90114-5","volume":"6","author":"E.S. Levitin","year":"1966","unstructured":"Levitin ES, Polyak BT (1966) Constrained minimization methods. USSR Comput Math Math Phys 6(5):1\u201350","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"573_CR57_573","volume-title":"Introduction to linear and nonlinear programming","author":"D.G. Luenberger","year":"1973","unstructured":"Luenberger DG (1973) Introduction to linear and nonlinear programming. Addison-Wesley, Reading"},{"key":"573_CR58_573","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1287\/mnsc.15.5.311","volume":"15","author":"G.P. McCormick","year":"1969","unstructured":"McCormick GP (1969) Anti-zigzagging by bending. Managem Sci 15:315\u2013320","journal-title":"Managem. Sci."},{"key":"573_CR59_573","volume-title":"Nonlinear Programming","author":"G.P. McCormick","year":"1990","unstructured":"McCormick GP (1990) A\u00a0second order method for the linearly constrained nonlinear programming problem. In: Rosen JB, Mangasarian\n\tOL, Ritter K (eds) Nonlinear Programming. Acad Press, New York"},{"key":"573_CR60_573","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1137\/0310009","volume":"10","author":"G.P. McCormick","year":"1972","unstructured":"McCormick GP, Tapia RA (1972) The gradient projection method under mild differentiability conditions. SIAM J Control Optim\n\t10:93\u201398","journal-title":"SIAM J. Control Optim."},{"key":"573_CR61_573","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/0308003","volume":"8","author":"R.R. Meyer","year":"1970","unstructured":"Meyer RR (1970) The validity of a\u00a0family of optimization methods. SIAM J Control Optim 8:41\u201354","journal-title":"SIAM J. Control Optim."},{"key":"573_CR62_573","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/S0022-0000(76)80021-9","volume":"12","author":"R.R. Meyer","year":"1976","unstructured":"Meyer RR (1976) Sufficient conditions for the convergence of monotonic mathematical programming algorithms. J\u00a0Comput Syst Sci\n\t12:108\u2013121","journal-title":"J. Comput. Syst. Sci."},{"key":"573_CR63_573","volume-title":"Optimization","author":"B.A. Murtagh","year":"1969","unstructured":"Murtagh BA, Sargent RWH (1969) A\u00a0constrained minimization method with quadratic convergence. In: Fletcher R (ed) Optimization. Acad Press, New York"},{"key":"573_CR64_573","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF01588950","volume":"14","author":"B.A. Murtagh","year":"1978","unstructured":"Murtagh BA, Saunders MA (1978) Large-scale linearly constrained optimization. Math Program 14:14\u201372","journal-title":"Math. Program."},{"key":"573_CR65_573","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1137\/0722050","volume":"1","author":"J. Nocedal","year":"1985","unstructured":"Nocedal J, Overton ML (1985) Projected Hessian updating algorithms for nonlinearly constrained optimization. SIAM J Numer Anal\n\t1:821\u2013850","journal-title":"SIAM J. Numer. Anal."},{"key":"573_CR66_573","first-page":"17","volume":"3","author":"E. Polak","year":"1969","unstructured":"Polak E (1969) On the convergence of optimization algorithms. Revue Franc Inform Rech Oper 3:17\u201334","journal-title":"Revue Franc. Inform. Rech. Oper."},{"key":"573_CR67_573","volume-title":"Computational methods in optimization","author":"E. Polak","year":"1971","unstructured":"Polak E (1971) Computational methods in optimization. Acad Press, New York"},{"key":"573_CR68_573","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0097-3165(78)90058-4","volume":"24","author":"H.O. Pollak","year":"1978","unstructured":"Pollak HO (1978) Some remarks on the Steiner problem. J\u00a0Combin Th A\u00a024:278\u2013295","journal-title":"J. Combin. Th. A"},{"key":"573_CR69_573","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1093\/imamat\/7.1.21","volume":"7","author":"M.J.D. Powell","year":"1971","unstructured":"Powell MJD (1971) On the convergence of the variable metric algorithm. J\u00a0Inst Math Appl 7:21\u201336","journal-title":"J. Inst. Math. Appl."},{"key":"573_CR70_573","volume-title":"Numerical Methods for Nonlinear Optimization","author":"M.J.D. Powell","year":"1972","unstructured":"Powell MJD (1972) Some properties of the variable metric algorithm. In: Lootsma FA (ed) Numerical Methods for Nonlinear\n\tOptimization. Acad Press, New York"},{"key":"573_CR71_573","first-page":"31","volume-title":"Mathematical Programming Theory and Practice","author":"M.J.D. Powell","year":"1974","unstructured":"Powell MJD (1974) Unconstrained minimization and extensions for constraints. In: Hammer PL, Zoutendijk G (eds) Mathematical\n\tProgramming Theory and Practice. North-Holland, Amsterdam, pp 31\u201379"},{"key":"573_CR72_573","volume-title":"Nonlinear Programming","author":"M.J.D. Powell","year":"1976","unstructured":"Powell MJD (1976) Some global convergence properties of a\u00a0variable metric algorithm for minimization without exact line\n\tsearches. In: Cottle RW, Lemke CE (eds) Nonlinear Programming. Amer Math Soc, Providence"},{"key":"573_CR73_573","first-page":"27","volume-title":"Nonlinear Programming","author":"M.J.D. Powell","year":"1978","unstructured":"Powell MJD (1978) The convergence of variable metric methods for nonlinearly constrained optimization calculations. In: Mangasarian O,\n\tMeyer R, Robinson S (eds) Nonlinear Programming 3. Acad Press, New York, pp 27\u201363"},{"key":"573_CR74_573","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF01588787","volume":"49","author":"M.J.D. Powell","year":"1991","unstructured":"Powell MJD, Yuan Y (1991) A\u00a0trust region algorithm for equality unconstrained optimization. Math Program\n\t49:189\u2013211","journal-title":"Math. Program."},{"key":"573_CR75_573","first-page":"207","volume":"9","author":"D. Pu","year":"1992","unstructured":"Pu D (1992) A\u00a0class of DFP algorithm without exact linear search. Asia-Pacific J Oper Res 9:207\u2013220","journal-title":"Asia-Pacific J. Oper. Res."},{"key":"573_CR76_573","first-page":"289","volume":"10","author":"D. Pu","year":"1997","unstructured":"Pu D (1997) The convergence of Broyden algorithms without convexity assumption. System Sci and Math Sci\n\t10:289\u2013298","journal-title":"System Sci. and Math. Sci."},{"issue":"3","key":"573_CR77_573","first-page":"63","volume":"14","author":"D. Pu","year":"1988","unstructured":"Pu D, Yu W (1988) On convergence property of DFP algorithm. J\u00a0Q\u00fcfu Normal Univ 14(3):63\u201369","journal-title":"J. Q\u00fcfu Normal Univ."},{"key":"573_CR78_573","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/BF01584646","volume":"4","author":"K. Ritter","year":"1973","unstructured":"Ritter K (1973) A\u00a0superlinearly convergent method for minimization problems with linear inequality constraints. Math Program\n\t4:44\u201371","journal-title":"Math. Program."},{"key":"573_CR79_573","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1137\/0712024","volume":"12","author":"K. Ritter","year":"1975","unstructured":"Ritter K (1975) A\u00a0method of conjugate directions for linearly constrained nonlinear programming problems. SIAM J Numer Anal\n\t12:272\u2013303","journal-title":"SIAM J. Numer. Anal."},{"key":"573_CR80_573","first-page":"221","volume-title":"Nonlinear Optimization: Theory and Algorithms","author":"K. Ritter","year":"1980","unstructured":"Ritter K (1980) Convergence and superlinear convergence of algorithms for linearly constrained minimization problems. In: Dixon LCW,\n\tSpedicado E, Szego GP (eds) Nonlinear Optimization: Theory and Algorithms II. Birkh\u00e4user, Basel, pp 221\u2013251"},{"key":"573_CR81_573","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/BFb0120928","volume":"14","author":"K. Ritter","year":"1981","unstructured":"Ritter K (1981) Global and superlinear convergence of a\u00a0class of variable metric methods. Math Program Stud\n\t14:178\u2013205","journal-title":"Math. Program. Stud."},{"key":"573_CR82_573","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1137\/0108011","volume":"8","author":"J.B. Rosen","year":"1960","unstructured":"Rosen JB (1960) The gradient projection method for nonlinear programming, Part I: linear constraints. SIAM J Appl Math\n\t8:181\u2013217","journal-title":"SIAM J. Appl. Math."},{"key":"573_CR83_573","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1137\/0109044","volume":"9","author":"J.B. Rosen","year":"1961","unstructured":"Rosen JB (1961) The gradient projection method for nonlinear programming, Part II: nonlinear constraints. SIAM J Appl Math\n\t9:514\u2013553","journal-title":"SIAM J. Appl. Math."},{"key":"573_CR84_573","doi-asserted-by":"publisher","first-page":"647","DOI":"10.2307\/2004840","volume":"24","author":"D.F. Shanno","year":"1970","unstructured":"Shanno DF (1970) Conditioning of quasi-Newton methods for function minimization. Math Comput 24:647\u2013656","journal-title":"Math. Comput."},{"key":"573_CR85_573","first-page":"37","volume":"4","author":"C.Y. Wang","year":"1981","unstructured":"Wang CY (1981) Simplifications of a\u00a0new pivoting rule and Levitin-Polyak gradient projection method and their convergent\n\tproperty. Acta Math Applic Sinica 4:37\u201352, in Chinese","journal-title":"Acta Math. Applic. Sinica"},{"key":"573_CR86_573","first-page":"577","volume":"28","author":"C.Y. Wang","year":"1983","unstructured":"Wang CY (1983) On convergence property of an improved reduced gradient method. Kexue Tongbao 28:577\u2013582","journal-title":"Kexue Tongbao"},{"key":"573_CR87_573","unstructured":"Wolfe P (1963) Methods of nonlinear programming. In: Graves RL, Wolfe P (eds) Recent Advances in Mathematical\n\tProgramming"},{"key":"573_CR88_573","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1137\/1011036","volume":"11","author":"P. Wolfe","year":"1969","unstructured":"Wolfe P (1969) Convergence conditions for ascent methods. SIAM Rev 11:226\u2013235","journal-title":"SIAM Rev."},{"key":"573_CR89_573","volume-title":"Integer and Nonlinear Programming","author":"P. Wolfe","year":"1970","unstructured":"Wolfe P (1970) Convergence theory in nonlinear programming. In: Abadie J (ed) Integer and Nonlinear Programming. North-Holland,\n\tAmsterdam"},{"key":"573_CR90_573","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1147\/rd.164.0407","volume":"16","author":"P. Wolfe","year":"1972","unstructured":"Wolfe P (1972) On the convergence of gradient methods under constraints. IBM J Res Developm 16:407\u2013411","journal-title":"IBM J. Res. Developm."},{"key":"573_CR91_573","first-page":"921","volume":"24","author":"F. Wu","year":"1981","unstructured":"Wu F, Gui X (1981) A class of variable metric methods with n+1 parameters. Acta Math 24:921\u2013930","journal-title":"Acta Math."},{"key":"573_CR92_573","first-page":"1099","volume":"22","author":"M. Yue","year":"1979","unstructured":"Yue M, Han J (1979) A\u00a0new reduced gradient method. Sci Sinica 22:1099\u20131113","journal-title":"Sci. Sinica"},{"key":"573_CR93_573","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF01883894","volume":"1","author":"M. Yue","year":"1984","unstructured":"Yue M, Han J (1984) A\u00a0unified approach to the feasible direction methods for nonlinear programming with linear constraints. Acta\n\tMath Applic Sinica, English Ser 1:63\u201373","journal-title":"Acta Math. Applic. Sinica, English Ser."},{"key":"573_CR94_573","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.16.1.1","volume":"16","author":"W.I. Zangwill","year":"1969","unstructured":"Zangwill WI (1969) Convergence conditions for nonlinear programming algorithms. Managem Sci 16:1\u201313","journal-title":"Managem. Sci."},{"key":"573_CR95_573","volume-title":"Nonlinear programming: A\u00a0unified approach","author":"W.I. Zangwill","year":"1969","unstructured":"Zangwill WI (1969) Nonlinear programming: A\u00a0unified approach. Prentice-Hall, Englewood Cliffs"},{"key":"573_CR96_573","first-page":"257","volume":"2","author":"X.-S Zhang","year":"1979","unstructured":"Zhang X-S (1979) An improved Rosen-Polak method. Acta Math Applic Sinica 2:257\u2013267, in Chinese","journal-title":"Acta Math. Applic. Sinica"},{"key":"573_CR97_573","doi-asserted-by":"crossref","unstructured":"Zhang X-S (1985 1987) On the convergence of Rosen's gradient projection method. Acta Math Applic Sinica 8:125\u2013128, in Chinese. Also in: English Ser 3:280\u2013288","DOI":"10.1007\/BF02007672"},{"key":"573_CR98_573","volume-title":"Methods of feasible direction methods","author":"G. Zoutendijk","year":"1960","unstructured":"Zoutendijk G (1960) Methods of feasible direction methods. Elsevier, Amsterdam"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_573","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T10:04:54Z","timestamp":1720692294000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_573"}},"subtitle":["FSP"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":98,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_573","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}