References
- Coleman , T.F. Large-scale numerical optimization:introduction and overview , 14853 – 15201 . Ithaca, NY : Cornell University . Technical report CTC91 TR89/91, Cornell Theory Center
- Conn , A.R. , Gould , N.I.M. and Toint , P.L. 1991 . A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds . SIAMJ. Numer. Anal , 28 : 545 – 572 .
- Conn , A.R. , Gould , N.I.M. and Toint , P.L. 1992 . Numerical experiments with the LANCELOT packag (Release A) for large-scale nonlinear optimization
- Conn , A.R. , Gould , N.I.M. and Toint , P.L. 1992 . “ LANCELOT:a Fortran package for large-scale nonlinea optimization (Release A) ” . In Springer Series in Computational Mathematics , Berlin, New York : Springer Verlag Heidelberg . Number 17
- Eldersveld , S.K. 1992 . Large-scale sequential quadratic programming algorithms , Stanford University . Technical Report SOI 92-4
- Fletcher , R. 1981 . “ Practical Methods of Optimization ” . In Constrained Optimization , Vol. 2 , England : John Wiley am Sons Chichester .
- Gill , P.E. , Murry , W. and Wright , M.H. 1981 . Practical Optimization , London, , England : Academic Press .
- Han , S.P. 1976 . Superlinear convergent variable metric algorithm for general nonlinear programming problems . Math. Prog , 11 : 261 – 282 .
- Han , S.P. 1977 . A globally convergent method for nonlinear programming . JOTA , 22 : 297 – 309 .
- Hock , W. and Schittkowski , K. 1981 . “ Test Examples for Nonlinear Programming Codes ” . In Lecture Notes ir Economics and Mathematical Systems , Vol. 187 , Berlin : Springer . Heidelberg
- Liu , D.C. and Nocedal , J. 1989 . On the limited memory BFGS method for large scale optimization . Math Prog , 45 : 503 – 528 .
- Moré , J.J. and Toraldo , G. 1991 . On the solution of large quadratic programming problems with bounc constraints . SIAM J. Optimization , 1 : 93 – 113 .
- Murgh , B.A. and Sauders , M.A. 1982 . A projected Lagrangian algorithm and its implementation for sparse linear constraints . Math. Prog. Study , 16 : 84 – 117 .
- Ni , Q. 1989 . Unconstrained optimization methods with adaptive scaling of variables . Nanjing Daxue Xuebao Shuxue Bannian Kan , 6 : 79 – 87 .
- Ni Q. General Large-Scale Nonlinear Programming Using Sequential Quadratic Programming Methods Mathematishe Schriften Mathematisches Institut, Universität Bayreuther 1993 45 133 236 Ph.D.Dissertation, Bayreuth, 95440 Bayreuth, F.R. Garmay
- Nickel , R.H. and Tolle , J.W. 1989 . A sparse sequential quadratic programming algorithm . JOTA , 60 : 453 – 473 .
- Nocedal , J. 1980 . Updating quasi-Newton matrices with limited storage . Math. Comp , 35 : 773 – 782 .
- Powell , M.J.D. 1978 . A fast algorithm for nonlinearly constrained optimization calculations . Lecture Notes in Mathematics , 630 : 144 – 157 .
- Schittkowski , K. 1978 . “ Nonlinear Programming Codes, Information, Tests,Performance ” . In Lecture Notes in Economics and Mathematical Systems , Vol. 183 , Berlin, New York : Springer . Heidelberg
- Schittkowski , K. 1981 . The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line seach function, Part I . convergence analysis, Numer. Math , 38 : 83 – 114 .
- Schittkowski , K. 1981 . The nonlinear programming method of Wilson, Han, and Powell with augmented Lagrangian type line search function, Part II, an efficient implementation with linear squares subproblems . Numer. Math , 38 : 115 – 127 .
- Schittkowski , K. 1983 . On the convergence of a sequential quadratic programming method with an augmented Lagrangian line search function Math. Operationsforch. u. Statist., sen . Optimization , 14 : 197 – 216 .
- 1987 . “ More Test Examples for Nonlinear Programming Codes ” . In Lecture Notes in Economics and Mathematical Systems , Vol. 282 , Berlin : Springer . Heidelberg
- Tolle , J.W. 1986 . “ Duality in quadratic programming ” . In Curriculum in Operations Research and Systems Analysis , Chapel Hill, North Carolina : University of North Carolina . Technical Report No. 86-11
- Wilson , R.B. 1963 . “ A simplical algorithm for concave programming ” . In Ph.D.Dissertation , Boston : Harvard University . Graduate School of Business Administration