Numerical optimization

Springer Series in Operations Research and Financial Engineering

Volumn , Issue , 2006, Pages 1-664

  Nocedal, Jorge ^a   Wright, Stephen J ^b  

^a NORTHWESTERN UNIVERSITY   (United States)

^b University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85098056778     PISSN: 14318598     EISSN: 21971773     Source Type: Book Series    
DOI: None     Document Type: Chapter

References (322)

1. R. K. AHUJA, T. L. MAGNANTI, AND J. B. ORLIN, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, N.J., 1993.
2. H. AKAIKE, On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method, Annals of the Institute of Statistical Mathematics, 11 (1959), pp. 1–17.
3. M. AL-BAALI, Descent property and global convergence of the Fletcher-Reeves method with inexact line search, I.M.A. Journal on Numerical Analysis, 5 (1985), pp. 121–124.
4. E. D. ANDERSEN AND K. D. ANDERSEN, Presolving in linear programming, Mathematical Programming, 71 (1995), pp. 221–245.
5. , The MOSEK interior point optimizer for linear programming: an implementation of the homogeneous algorithm, in High Performance Optimization, T. T. H. Frenk, K. Roos and S. Zhang, eds., Kluwer Academic Publishers, 2000, pp. 197–232.
6. E. D. ANDERSEN, J. GONDZIO, C. MÉSZÁROS, AND X. XU, Implementation of interior-point methods for large scale linear programming, in Interior Point Methods in Mathematical Programming, T. Terlaky, ed., Kluwer, 1996, ch. 6, pp. 189–252.
7. E. ANDERSON, Z. BAI, C. BISCHOF, J. DEMMEL, J. DONGARRA, J. DU CROZ, A. GREENBAUM, S. HAM-MARLING, A. MCKENNEY, S. OSTROUCHOV, AND D. SORENSEN, LAPACK User’s Guide, SIAM, Philadelphia, 1992.
8. M. ANITESCU, On solving mathematical programs with complementarity constraints as nonlinear programs, SIAM Journal on Optimization, 15 (2005), pp. 1203–1236.
9. ARKI CONSULTING AND DEVELOPMENT A/S, CONOPT version 3, 2004.
10. B. M. AVERICK, R. G. CARTER, J. J. MORÉ, AND G. XUE, The MINPACK-2 test problem collection, Preprint MCS–P153–0692, Argonne National Laboratory, 1992.
11. P. BAPTIST AND J. STOER, On the relation between quadratic termination and convergence properties of minimization algorithms, Part II: Applications, Numerische Mathematik, 28 (1977), pp. 367– 392.
12. R. H. BARTELS AND G. H. GOLUB, The simplex method of linear programming using LU decomposition, Communications of the ACM, 12 (1969), pp. 266–268.
13. R. BARTLETT AND L. BIEGLER, rSQP++: An object-oriented framework for successive quadratic programming, in Large-Scale PDE-Constrained Optimization, L. T. Biegler, O. Ghat-tas, M. Heinkenschloss, and B. van Bloemen Waanders, eds., vol. 30, New York, 2003, Springer-Verlag, pp. 316–330. Lecture Notes in Computational Science and Engineering.
14. M. BAZARAA, H. SHERALI, AND C. SHETTY, Nonlinear Programming, Theory and Applications., John Wiley & Sons, New York, second ed., 1993.
15. A. BEN-TAL AND A. NEMIROVSKI, Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, MPS-SIAM Series on Optimization, SIAM, 2001.
16. H. Y. BENSON, A. SEN, D. F. SHANNO, AND R. J. VANDERBEI, Interior-point algorithms, penalty methods and equilibrium problems, Technical Report ORFE-03-02, Operations Research and Financial Engineering, Princeton University, 2003.
17. S. BENSON AND J. MORÉ, A limited-memory variable-metric algorithm for bound constrained minimization, Numerical Analysis Report P909-0901, ANL, Argonne, IL, USA, 2001.
18. D. P. BERTSEKAS, Constrained Optimization and Lagrange Multiplier Methods, Academic Press, New York, 1982.
19. Nonlinear Programming, Athena Scientific, Belmont, MA, second ed., 1999.
20. M. BERZ, C. BISCHOF, C. F. CORLISS, AND A. GRIEWANK, eds., Computational Differentiation: Techniques, Applications, and Tools, SIAM Publications, Philadelphia, PA, 1996.
21. J. BETTS, S. K. ELDERSVELD, P. D. FRANK, AND J. G. LEWIS, An interior-point nonlinear programming algorithm for large scale optimization, Technical report MCT TECH-003, Mathematics and Computing Technology, The Boeing Company, P.O. Box 3707, Seattle, WA 98124-2207, 2000.
22. J. R. BIRGE AND F. LOUVEAUX, Introduction to Stochastic Programming, Springer-Verlag, New York, 1997.
23. E. G. BIRGIN, J. M. MARTINEZ, AND M. RAYDAN, Algorithm 813: SPG software for convex-constrained optimization, ACM Transactions on Mathematical Software, 27 (2001), pp. 340–349.
24. C. BISCHOF, A. BOUARICHA, P. KHADEMI, AND J. J. MORÉ, Computing gradients in large-scale optimization using automatic differentiation, INFORMS Journal on Computing, 9 (1997), pp. 185–194.
25. C. BISCHOF, A. CARLE, P. KHADEMI, AND A. MAUER, ADIFOR 2.0: Automatic differentiation of FORTRAN 77 programs, IEEE Computational Science & Engineering, 3 (1996), pp. 18–32.
26. C. BISCHOF, G. CORLISS, AND A. GRIEWANK, Structured second-and higher-order derivatives through univariate Taylor series, Optimization Methods and Software, 2 (1993), pp. 211–232.
27. C. BISCHOF, P. KHADEMI, A. BOUARICHA, AND A. CARLE, Efficient computation of gradients and Jaco-bians by transparent exploitation of sparsity in automatic differentiation, Optimization Methods and Software, 7 (1996), pp. 1–39.
28. C. BISCHOF, L. ROH, AND A. MAUER, ADIC: An extensible automatic differentiation tool for ANSI-C, Software—Practice and Experience, 27 (1997), pp. 1427–1456.
29. Å. BJÖRCK, Numerical Methods for Least Squares Problems, SIAM Publications, Philadelphia, PA, 1996.
30. P. T. BOGGS, R. H. BYRD, AND R. B. SCHNABEL, A stable and efficient algorithm for nonlinear orthogonal distance regression, SIAM Journal on Scientific and Statistical Computing, 8 (1987), pp. 1052–1078.
31. P. T. BOGGS, J. R. DONALDSON, R. H. BYRD, AND R. B. SCHNABEL, ODRPACK—Software for weighted orthogonal distance regression, ACM Transactions on Mathematical Software, 15 (1981), pp. 348– 364.
32. P. T. BOGGS AND J. W. TOLLE, Convergence properties of a class of rank-two updates, SIAM Journal on Optimization, 4 (1994), pp. 262–287.
33. Sequential quadratic programming, Acta Numerica, 4 (1996), pp. 1–51.
34. P. T. BOGGS, J. W. TOLLE, AND P. WANG, On the local convergence of quasi-Newton methods for constrained optimization, SIAM Journal on Control and Optimization, 20 (1982), pp. 161–171.
35. I. BONGARTZ, A. R. CONN, N. I. M. GOULD, AND P. L. TOINT, CUTE: Constrained and unconstrained testing environment, Research Report, IBM T.J. Watson Research Center, Yorktown Heights, NY, 1993.
36. J. F. BONNANS, E. R. PANIER, A. L. TITS, AND J. L. ZHOU, Avoiding the Maratos effect by means of a nonmonotone line search. II. Inequality constrained problems — feasible iterates, SIAM Journal on Numerical Analysis, 29 (1992), pp. 1187–1202.
37. S. BOYD, L. EL GHAOUI, E. FERON, AND V. BALAKRISHNAN, Linear Matrix Inequalities in Systems and Control Theory, SIAM Publications, Phildelphia, 1994.
38. S. BOYD AND L. VANDENBERGHE, Convex Optimization, Cambridge University Press, Cambridge, 2003.
39. R. P. BRENT, Algorithms for minimization without derivatives, Prentice Hall, Englewood Cliffs, NJ, 1973.
40. H. M. BÜCKER, G. F. CORLISS, P. D. HOVLAND, U. NAUMANN, AND B. NORRIS, eds., Automatic Differentiation: Applications, Theory, and Implementations, vol. 50 of Lecture Notes in Computational Science and Engineering, Springer, New York, 2005.
41. R. BULIRSCH AND J. STOER, Introduction to Numerical Analysis, Springer-Verlag, New York, 1980.
42. J. R. BUNCH AND L. KAUFMAN, Some stable methods for calculating inertia and solving symmetric linear systems, Mathematics of Computation, 31 (1977), pp. 163–179.
43. J. R. BUNCH AND B. N. PARLETT, Direct methods for solving symmetric indefinite systems of linear equations, SIAM Journal on Numerical Analysis, 8 (1971), pp. 639–655.
44. J. V. BURKE AND J. J. MORÉ, Exposing constraints, SIAM Journal on Optimization, 4 (1994), pp. 573–595.
45. W. BURMEISTER, Die konvergenzordnung des Fletcher-Powell algorithmus, Zeitschrift für Angewandte Mathematik und Mechanik, 53 (1973), pp. 693–699.
46. R. BYRD, J. NOCEDAL, AND R. WALTZ, Knitro: An integrated package for nonlinear optimization, Technical Report 18, Optimization Technology Center, Evanston, IL, June 2005.
47. R. BYRD, J. NOCEDAL, AND R. A. WALTZ, Steering exact penalty methods, Technical Report OTC 2004/07, Optimization Technology Center, Northwestern University, Evanston, IL, USA, April 2004.
48. R. H. BYRD, J.-C. GILBERT, AND J. NOCEDAL, A trust region method based on interior point techniques for nonlinear programming, Mathematical Programming, 89 (2000), pp. 149–185.
49. R. H. BYRD, N. I. M. GOULD, J. NOCEDAL, AND R. A. WALTZ, An algorithm for nonlinear optimization using linear programming and equality constrained subproblems, Mathematical Programming, Series B, 100 (2004), pp. 27–48.
50. R. H. BYRD, M. E. HRIBAR, AND J. NOCEDAL, An interior point method for large scale nonlinear programming, SIAM Journal on Optimization, 9 (1999), pp. 877–900.
51. R. H. BYRD, H. F. KHALFAN, AND R. B. SCHNABEL, Analysis of a symmetric rank-one trust region method, SIAM Journal on Optimization, 6 (1996), pp. 1025–1039.
52. R. H. BYRD, J. NOCEDAL, AND R. B. SCHNABEL, Representations of quasi-Newton matrices and their use in limited-memory methods, Mathematical Programming, Series A, 63 (1994), pp. 129–156.
53. R. H. BYRD, J. NOCEDAL, AND Y. YUAN, Global convergence of a class of quasi-Newton methods on convex problems, SIAM Journal on Numerical Analysis, 24 (1987), pp. 1171–1190.
54. R. H. BYRD, R. B. SCHNABEL, AND G. A. SCHULTZ, Approximate solution of the trust regions problem by minimization over two-dimensional subspaces, Mathematical Programming, 40 (1988), pp. 247–263.
55. R. H. BYRD, R. B. SCHNABEL, AND G. A. SHULTZ, A trust region algorithm for nonlinearly constrained optimization, SIAM Journal on Numerical Analysis, 24 (1987), pp. 1152–1170.
56. M. R. CELIS, J. E. DENNIS, AND R. A. TAPIA, A trust region strategy for nonlinear equality constrained optimization, in Numerical Optimization, P. T. Boggs, R. H. Byrd, and R. B. Schnabel, eds., SIAM, 1985, pp. 71–82.
57. R. CHAMBERLAIN, C. LEMARECHAL, H. C. PEDERSEN, AND M. J. D. POWELL, The watchdog technique for forcing convergence in algorithms for constrained optimization, Mathematical Programming, 16 (1982), pp. 1–17.
58. S. H. CHENG AND N. J. HIGHAM, A modified Cholesky algorithm based on a symmetric indefinite factorization, SIAM Journal of Matrix Analysis and Applications, 19 (1998), pp. 1097–1100.
59. C. M. CHIN AND R. FLETCHER, On the global convergence of an SLP-filter algorithm that takes EQP steps, Mathematical Programming, Series A, 96 (2003), pp. 161–177.
60. T. D. CHOI AND C. T. KELLEY, Superlinear convergence and implicit filtering, SIAM Journal on Optimization, 10 (2000), pp. 1149–1162.
61. V. CHVÁTAL, Linear Programming, W. H. Freeman and Company, New York, 1983.
62. F. H. CLARKE, Optimization and Nonsmooth Analysis, John Wiley & Sons, New York, 1983 (Reprinted by SIAM Publications, 1990).
63. A. COHEN, Rate of convergence of several conjugate gradient algorithms, SIAM Journal on Numerical Analysis, 9 (1972), pp. 248–259.
64. T. F. COLEMAN, Linearly constrained optimization and projected preconditioned conjugate gradients, in Proceedings of the Fifth SIAM Conference on Applied Linear Algebra, J. Lewis, ed., Philadelphia, USA, 1994, SIAM, pp. 118–122.
65. T. F. COLEMAN AND A. R. CONN, Non-linear programming via an exact penalty-function: Asymptotic analysis, Mathematical Programming, 24 (1982), pp. 123–136.
66. T. F. COLEMAN, B. GARBOW, AND J. J. MORÉ, Software for estimating sparse Jacobian matrices, ACM Transactions on Mathematical Software, 10 (1984), pp. 329–345.
67. , Software for estimating sparse Hessian matrices, ACM Transactions on Mathematical Software, 11 (1985), pp. 363–377.
68. T. F. COLEMAN AND J. J. MORÉ, Estimation of sparse Jacobian matrices and graph coloring problems, SIAM Journal on Numerical Analysis, 20 (1983), pp. 187–209.
69. , Estimation of sparse Hessian matrices and graph coloring problems, Mathematical Programming, 28 (1984), pp. 243–270.
70. A. R. CONN, N. I. M. GOULD, AND P. L. TOINT, Testing a class of algorithms for solving minimization problems with simple bounds on the variables, Mathematics of Computation, 50 (1988), pp. 399– 430.
71. Convergence of quasi-Newton matrices generated by the symmetric rank one update, Mathematical Programming, 50 (1991), pp. 177–195.
72. LANCELOT: a FORTRAN package for large-scale nonlinear optimization (Release A), no. 17 in Springer Series in Computational Mathematics, Springer-Verlag, New York, 1992.
73. , Numerical experiments with the LANCELOT package (Release A) for large-scale nonlinear optimization, Report 92/16, Department of Mathematics, University of Namur, Belgium, 1992.
74. A. R. CONN, N. I. M. GOULD, AND P. L. TOINT, Trust-Region Methods, MPS-SIAM Series on Optimization, SIAM, 2000.
75. A. R. CONN, K. SCHEINBERG, AND P. L. TOINT, On the convergence of derivative-free methods for unconstrained optimization, in Approximation Theory and Optimization: Tributes to M. J. D. Powell, A. Iserles and M. Buhmann, eds., Cambridge University Press, Cambridge, UK, 1997, pp. 83–108.
76. , Recent progress in unconstrained nonlinear optimization without derivatives, Mathematical Programming, Series B, 79 (1997), pp. 397–414.
77. W. J. COOK, W. H. CUNNINGHAM, W. R. PULLEYBLANK, AND A. SCHRIJVER, Combinatorial Optimization, John Wiley & Sons, New York, 1997.
78. B. F. CORLISS AND L. B. RALL, An introduction to automatic differentiation, in Computational Differentiation: Techniques, Applications, and Tools, M. Berz, C. Bischof, G. F. Corliss, and A. Griewank, eds., SIAM Publications, Philadelphia, PA, 1996, ch. 1.
79. T. H. CORMEN, C. E. LEISSERSON, AND R. L. RIVEST, Introduction to Algorithms, MIT Press, 1990.
80. R. W. COTTLE, J.-S. PANG, AND R. E. STONE, The Linear Complementarity Problem, Academic Press, San Diego, 1992.
81. R. COURANT, Variational methods for the solution of problems with equilibrium and vibration, Bulletin of the American Mathematical Society, 49 (1943), pp. 1–23.
82. H. P. CROWDER AND P. WOLFE, Linear convergence of the conjugate gradient method, IBM Journal of Research and Development, 16 (1972), pp. 431–433.
83. A. CURTIS, M. J. D. POWELL, AND J. REID, On the estimation of sparse Jacobian matrices, Journal of the Institute of Mathematics and its Applications, 13 (1974), pp. 117–120.
84. J. CZYZYK, S. MEHROTRA, M. WAGNER, AND S. J. WRIGHT, PCx: An interior-point code for linear programming, Optimization Methods and Software, 11/12 (1999), pp. 397–430.
85. Y. DAI AND Y. YUAN, A nonlinear conjugate gradient method with a strong global convergence property, SIAM Journal on Optimization, 10 (1999), pp. 177–182.
86. G. B. DANTZIG, Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1963.
87. W. C. DAVIDON, Variable metric method for minimization, Technical Report ANL–5990 (revised), Argonne National Laboratory, Argonne, IL, 1959.
88. , Variable metric method for minimization, SIAM Journal on Optimization, 1 (1991), pp. 1–17.
89. R. S. DEMBO, S. C. EISENSTAT, AND T. STEIHAUG, Inexact Newton methods, SIAM Journal on Numerical Analysis, 19 (1982), pp. 400–408.
90. J. E. DENNIS, D. M. GAY, AND R. E. WELSCH, Algorithm 573 — NL2SOL, An adaptive nonlinear least-squares algorithm, ACM Transactions on Mathematical Software, 7 (1981), pp. 348–368.
91. J. E. DENNIS AND J. J. MORÉ, Quasi-Newton methods, motivation and theory, SIAM Review, 19 (1977), pp. 46–89.
92. J. E. DENNIS AND R. B. SCHNABEL, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, NJ, 1983. Reprinted by SIAM Publications, 1993.
93. J. E. DENNIS AND R. B. SCHNABEL, A view of unconstrained optimization, in Optimization, vol. 1 of Handbooks in Operations Research and Management, Elsevier Science Publishers, Amsterdam, The Netherlands, 1989, pp. 1–72.
94. I. I. DIKIN, Iterative solution of problems of linear and quadratic programming, Soviet Mathematics-Doklady, 8 (1967), pp. 674–675.
95. I. S. DUFF AND J. K. REID, The multifrontal solution of indefinite sparse symmetric linear equations, ACM Transactions on Mathematical Software, 9 (1983), pp. 302–325.
96. I. S. DUFF AND J. K. REID, The design of MA48: A code for the direct solution of sparse unsymmetric linear systems of equations, ACM Transactions on Mathematical Software, 22 (1996), pp. 187– 226.
97. I. S. DUFF, J. K. REID, N. MUNKSGAARD, AND H. B. NEILSEN, Direct solution of sets of linear equations whose matrix is sparse symmetric and indefinite, Journal of the Institute of Mathematics and its Applications, 23 (1979), pp. 235–250.
98. A. V. FIACCO AND G. P. MCCORMICK, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, John Wiley & Sons, New York, N.Y., 1968. Reprinted by SIAM Publications, 1990.
99. R. FLETCHER, A general quadratic programming algorithm, Journal of the Institute of Mathematics and its Applications, 7 (1971), pp. 76–91.
100. Second order corrections for non-differentiable optimization, in Numerical Analysis, D. Griffiths, ed., Springer Verlag, 1982, pp. 85–114. Proceedings Dundee 1981.
101. , Practical Methods of Optimization, John Wiley & Sons, New York, second ed., 1987.
102. , An optimal positive definite update for sparse Hessian matrices, SIAM Journal on Optimization, 5 (1995), pp. 192–218.
103. , Stable reduced hessian updates for indefinite quadratic programming, Mathematical Programming, 87 (2000), pp. 251–264.
104. R. FLETCHER, A. GROTHEY, AND S. LEYFFER, Computing sparse Hessian and Jacobian approximations with optimal hereditary properties, technical report, Department of Mathematics, University of Dundee, 1996.
105. R. FLETCHER AND S. LEYFFER, Nonlinear programming without a penalty function, Mathematical Programming, Series A, 91 (2002), pp. 239–269.
106. R. FLETCHER, S. LEYFFER, AND P. L. TOINT, On the global convergence of an SLP-filter algorithm, Numerical Analysis Report NA/183, Dundee University, Dundee, Scotland, UK, 1999.
107. R. FLETCHER AND C. M. REEVES, Function minimization by conjugate gradients, Computer Journal, 7 (1964), pp. 149–154.
108. R. FLETCHER AND E. SAINZ DE LA MAZA, Nonlinear programming and nonsmooth optimization by successive linear programming, Mathematical Programming, 43 (1989), pp. 235–256.
109. C. FLOUDAS AND P. PARDALOS, eds., Recent Advances in Global Optimization, Princeton University Press, Princeton, NJ, 1992.
110. J. J. H. FORREST AND J. A. TOMLIN, Updated triangular factors of the basis to maintain sparsity in the product form simplex method, Mathematical Programming, 2 (1972), pp. 263–278.
111. A. FORSGREN, P. E. GILL, AND M. H. WRIGHT, Interior methods for nonlinear optimization, SIAM Review, 44 (2003), pp. 525–597.
112. R. FOURER, D. M. GAY, AND B. W. KERNIGHAN, AMPL: A Modeling Language for Mathematical Programming, The Scientific Press, South San Francisco, CA, 1993.
113. R. FOURER AND S. MEHROTRA, Solving symmetric indefinite systems in an interior-point method for linear programming, Mathematical Programming, 62 (1993), pp. 15–39.
114. M. P. FRIEDLANDER AND M. A. SAUNDERS, A globally convergent linearly constrained Lagrangian method for nonlinear optimization, SIAM Journal on Optimization, 15 (2005), pp. 863–897.
115. K. R. FRISCH, The logarithmic potential method of convex programming, Technical Report, University Institute of Economics, Oslo, Norway, 1955.
116. D. GABAY, Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization, Mathematical Programming Studies, 16 (1982), pp. 18–44.
117. U. M. GARCIA-PALOMARES AND O. L. MANGASARIAN, Superlinearly convergent quasi-Newton methods for nonlinearly constrained optimization problems, Mathematical Programming, 11 (1976), pp. 1–13.
118. D. M. GAY, More AD of nonlinear AMPL models: computing Hessian information and exploiting partial separability, in Computational Differentiation: Techniques, Applications, and Tools, M. Berz, C. Bischof, G. F. Corliss, and A. Griewank, eds., SIAM Publications, Philadelphia, PA, 1996, pp. 173–184.
119. R.-P. GE AND M. J. D. POWELL, The convergence of variable metric matrices in unconstrained optimization, Mathematical Programming, 27 (1983), pp. 123–143.
120. A. H. GEBREMEDHIN, F. MANNE, AND A. POTHEN, What color is your Jacobian? Graph coloring for computing derivatives, SIAM Review, 47 (2005), pp. 629–705.
121. E. M. GERTZ AND S. J. WRIGHT, Object-oriented software for quadratic programming, ACM Transactions on Mathematical Software, 29 (2003), pp. 58–81.
122. J. GILBERT AND C. LEMARÉCHAL, Some numerical experiments with variable-storage quasi-Newton algorithms, Mathematical Programming, Series B, 45 (1989), pp. 407–435.
123. J. GILBERT AND J. NOCEDAL, Global convergence properties of conjugate gradient methods for optimization, SIAM Journal on Optimization, 2 (1992), pp. 21–42.
124. P. E. GILL, G. H. GOLUB, W. MURRAY, AND M. A. SAUNDERS, Methods for modifying matrix factorizations, Mathematics of Computation, 28 (1974), pp. 505–535.
125. P. E. GILL AND M. W. LEONARD, Limited-memory reduced-Hessian methods for unconstrained optimization, SIAM Journal on Optimization, 14 (2003), pp. 380–401.
126. P. E. GILL AND W. MURRAY, Numerically stable methods for quadratic programming, Mathematical Programming, 14 (1978), pp. 349–372.
127. P. E. GILL, W. MURRAY, AND M. A. SAUNDERS, User’s guide for SNOPT (Version 5.3): A FOR-TRAN package for large-scale nonlinear programming, Technical Report NA 97-4, Department of Mathematics, University of California, San Diego, 1997.
128. , SNOPT: An SQP algorithm for large-scale constrained optimization, SIAM Journal on Optimization, 12 (2002), pp. 979–1006.
129. P. E. GILL, W. MURRAY, M. A. SAUNDERS, AND M. H. WRIGHT, User’s guide for SOL/QPSOL, Technical Report SOL84–6, Department of Operations Research, Stanford University, Stanford, California, 1984.
130. P. E. GILL, W. MURRAY, AND M. H. WRIGHT, Practical Optimization, Academic Press, 1981.
131. , Numerical Linear Algebra and Optimization, Vol. 1, Addison Wesley, Redwood City, California, 1991.
132. D. GOLDFARB, Curvilinear path steplength algorithms for minimization which use directions of negative curvature, Mathematical Programming, 18 (1980), pp. 31–40.
133. D. GOLDFARB AND J. FORREST, Steepest edge simplex algorithms for linear programming, Mathematical Programming, 57 (1992), pp. 341–374.
134. D. GOLDFARB AND J. K. REID, A practicable steepest-edge simplex algorithm, Mathematical Programming, 12 (1977), pp. 361–373.
135. G. GOLUB AND D. O’LEARY, Some history of the conjugate gradient methods and the Lanczos algorithms: 1948–1976, SIAM Review, 31 (1989), pp. 50–100.
136. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, The Johns Hopkins University Press, Baltimore, third ed., 1996.
137. J. GONDZIO, HOPDM (version 2.12): A fast LP solver based on a primal-dual interior point method, European Journal of Operations Research, 85 (1995), pp. 221–225.
138. , Multiple centrality corrections in a primal-dual method for linear programming, Computational Optimization and Applications, 6 (1996), pp. 137–156.
139. J. GONDZIO AND A. GROTHEY, Parallel interior point solver for structured quadratic programs: Application to financial planning problems, Technical Report MS-03-001, School of Mathematics, University of Edinburgh, Scotland, 2003.
140. N. I. M. GOULD, On the accurate determination of search directions for simple differentiable penalty functions, I.M.A. Journal on Numerical Analysis, 6 (1986), pp. 357–372.
141. , On the convergence of a sequential penalty function method for constrained minimization, SIAM Journal on Numerical Analysis, 26 (1989), pp. 107–128.
142. , An algorithm for large scale quadratic programming, I.M.A. Journal on Numerical Analysis, 11 (1991), pp. 299–324.
143. N. I. M. GOULD, M. E. HRIBAR, AND J. NOCEDAL, On the solution of equality constrained quadratic problems arising in optimization, SIAM Journal on Scientific Computing, 23 (2001), pp. 1375– 1394.
144. N.I.M. GOULD, S. LEYFFER, AND P. L. TOINT, A multidimensional filter algorithm for nonlinear equations and nonlinear least squares, SIAM Journal on Optimization, 15 (2004), pp. 17–38.
145. N. I. M. GOULD, S. LUCIDI, M. ROMA, AND P. L. TOINT, Solving the trust-region subproblem using the Lanczos method. SIAM Journal on Optimization, 9 (1999), pp. 504–525.
146. N. I. M. GOULD, D. ORBAN, AND P. L. TOINT, GALAHAD—a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization, ACM Transactions on Mathematical Software, 29 (2003), pp. 353–372.
147. N. I. M. GOULD, D. ORBAN, AND P. L. TOINT, Numerical methods for large-scale nonlinear optimization, Acta Numerica, 14 (2005), pp. 299–361.
148. N. I. M. GOULD AND P. L. TOINT, An iterative working-set method for large-scale non-convex quadratic programming, Applied Numerical Mathematics, 43 (2002), pp. 109–128.
149. , Numerical methods for large-scale non-convex quadratic programming, in Trends in Industrial and Applied Mathematics, A. H. Siddiqi and M. Kočvara, eds., Dordrecht, The Netherlands, 2002, Kluwer Academic Publishers, pp. 149–179.
150. A. GRIEWANK, Achieving logarithmic growth of temporal and spatial complexity in reverse automatic differentiation, Optimization Methods and Software, 1 (1992), pp. 35–54.
151. , Automatic directional differentiation of nonsmooth composite functions, in Seventh French-German Conference on Optimization, 1994.
152. A. GRIEWANK, Evaluating Derivatives: Principles and Techniques of Automatic Differentiation, vol. 19 of Frontiers in Applied Mathematics, SIAM, 2000.
153. A. GRIEWANK AND G. F. CORLISS, eds., Automatic Differentition of Algorithms, SIAM Publications, Philadelphia, Penn., 1991.
154. A. GRIEWANK, D. JUEDES, AND J. UTKE, ADOL-C, A package for the automatic differentiation of algorithms written in C/C++, ACM Transactions on Mathematical Software, 22 (1996), pp. 131–167.
155. A. GRIEWANK AND P. L. TOINT, Local convergence analysis of partitioned quasi-Newton updates, Numerische Mathematik, 39 (1982), pp. 429–448.
156. , Partitioned variable metric updates for large structured optimization problems, Numerische Mathematik, 39 (1982), pp. 119–137.
157. J. GRIMM, L. POTTIER, AND N. ROSTAING-SCHMIDT, Optimal time and minimum space time product for reversing a certain class of programs, in Computational Differentiation, Techniques, Applications, and Tools, M. Berz, C. Bischof, G. Corliss, and A. Griewank, eds., SIAM, Philadelphia, 1996, pp. 95–106.
158. L. GRIPPO, F. LAMPARIELLO, AND S. LUCIDI, A nonmonotone line search technique for Newton’s method, SIAM Journal on Numerical Analysis, 23 (1986), pp. 707–716.
159. C. GUÉRET, C. PRINS, AND M. SEVAUX, Applications of optimization with Xpress-MP, Dash Optimization, 2002.
160. W. W. HAGER, Minimizing a quadratic over a sphere, SIAM Journal on Optimization, 12 (2001), pp. 188–208.
161. W. W. HAGER AND H. ZHANG, A new conjugate gradient method with guaranteed descent and an efficient line search, SIAM Journal on Optimization, 16 (2005), pp. 170–192.
162. , A survey of nonlinear conjugate gradient methods. To appear in the Pacific Journal of Optimization, 2005.
163. S. P. HAN, Superlinearly convergent variable metric algorithms for general nonlinear programming problems, Mathematical Programming, 11 (1976), pp. 263–282.
164. , A globally convergent method for nonlinear programming, Journal of Optimization Theory and Applications, 22 (1977), pp. 297–309.
165. S. P. HAN AND O. L. MANGASARIAN, Exact penalty functions in nonlinear programming, Mathematical Programming, 17 (1979), pp. 251–269.
166. HARWELL SUBROUTINE LIBRARY, A catalogue of subroutines (release 13), AERE Harwell Laboratory, Harwell, Oxfordshire, England, 1998.
167. M. R. HESTENES, Multiplier and gradient methods, Journal of Optimization Theory and Applications, 4 (1969), pp. 303–320.
168. M. R. HESTENES AND E. STIEFEL, Methods of conjugate gradients for solving linear systems, Journal of Research of the National Bureau of Standards, 49 (1952), pp. 409–436.
169. N. J. HIGHAM, Accuracy and Stability of Numerical Algorithms, SIAM Publications, Philadelphia, 1996.
170. J.-B. HIRIART-URRUTY AND C. LEMARECHAL, Convex Analysis and Minimization Algorithms, Springer-Verlag, Berlin, New York, 1993.
171. P. HOUGH, T. KOLDA, AND V. TORCZON, Asynchronous parallel pattern search for nonlinear optimization, SIAM Journal on Optimization, 23 (2001), pp. 134–156.
172. ILOG CPLEX 8.0, User’s Manual, ILOG SA, Gentilly, France, 2002.
173. D. JONES, C. PERTTUNEN, AND B. STUCKMAN, Lipschitzian optimization without the Lipschitz constant, Journal of Optimization Theory and Applications, 79 (1993), pp. 157–181.
174. P. KALL AND S. W. WALLACE, Stochastic Programming, John Wiley & Sons, New York, 1994.
175. N. KARMARKAR, A new polynomial-time algorithm for linear programming, Combinatorics, 4 (1984), pp. 373–395.
176. C. KELLER, N. I. M. GOULD, AND A. J. WATHEN, Constraint preconditioning for indefinite linear systems, SIAM Journal on Matrix Analysis and Applications, 21 (2000), pp. 1300–1317.
177. C. T. KELLEY, Iterative Methods for Linear and Nonlinear Equations, SIAM Publications, Philadelphia, PA, 1995.
178. C. T. KELLEY, Detection and remediation of stagnation in the Nelder-Mead algorithm using a sufficient decrease condition, SIAM Journal on Optimization, 10 (1999), pp. 43–55.
179. , Iterative Methods for Optimization, no. 18 in Frontiers in Applied Mathematics, SIAM Publications, Philadelphia, PA, 1999.
180. L. G. KHACHIYAN, A polynomial algorithm in linear programming, Soviet Mathematics Doklady, 20 (1979), pp. 191–194.
181. H. F. KHALFAN, R. H. BYRD, AND R. B. SCHNABEL, A theoretical and experimental study of the symmetric rank one update, SIAM Journal on Optimization, 3 (1993), pp. 1–24.
182. V. KLEE AND G. J. MINTY, How good is the simplex algorithm? in Inequalities, O. Shisha, ed., Academic Press, New York, 1972, pp. 159–175.
183. T. G. KOLDA, R. M. LEWIS, AND V. TORCZON, Optimization by direct search: New perspectives on some classical and modern methods, SIAM Review, 45 (2003), pp. 385–482.
184. M. KOČVARA AND M. STINGL, PENNON, a code for nonconvex nonlinear and semidefinite programming, Optimization Methods and Software, 18 (2003), pp. 317–333.
185. H. W. KUHN AND A. W. TUCKER, Nonlinear programming, in Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, J. Neyman, ed., Berkeley, CA, 1951, University of California Press, pp. 481–492.
186. J. W. LAGARIAS, J. A. REEDS, M. H. WRIGHT, AND P. E. WRIGHT, Convergence properties of the Nelder-Mead simplex algorithm in low dimensions, SIAM Journal on Optimization, 9 (1998), pp. 112–147.
187. S. LANG, Real Analysis, Addison-Wesley, Reading, MA, second ed., 1983.
188. C. L. LAWSON AND R. J. HANSON, Solving Least Squares Problems, Prentice-Hall, Englewood Cliffs, NJ, 1974.
189. C. LEMARÉCHAL, A view of line searches, in Optimization and Optimal Control, W. Oettli and J. Stoer, eds., no. 30 in Lecture Notes in Control and Information Science, Springer-Verlag, 1981, pp. 59–78.
190. K. LEVENBERG, A method for the solution of certain non-linear problems in least squares, Quarterly of Applied Mathematics, 2 (1944), pp. 164–168.
191. S. LEYFFER, G. LOPEZ-CALVA, AND J. NOCEDAL, Interior methods for mathematical programs with complementarity constraints, technical report 8, Optimization Technology Center, Northwestern University, Evanston, IL, 2004.
192. C. LIN AND J. MORÉ, Newton’s method for large bound-constrained optimization problems, SIAM Journal on Optimization, 9 (1999), pp. 1100–1127.
193. C. LIN AND J. J. MORÉ, Incomplete Cholesky factorizations with limited memory, SIAM Journal on Scientific Computing, 21 (1999), pp. 24–45.
194. D. C. LIU AND J. NOCEDAL, On the limited-memory BFGS method for large scale optimization, Mathematical Programming, 45 (1989), pp. 503–528.
195. D. LUENBERGER, Introduction to Linear and Nonlinear Programming, Addison Wesley, second ed., 1984.
196. L. LUKŠAN AND J. VLČEK, Indefinitely preconditioned inexact Newton method for large sparse equality constrained nonlinear programming problems, Numerical Linear Algebra with Applications, 5 (1998), pp. 219–247.
197. Macsyma User’s Guide, second ed., 1996.
198. O. L. MANGASARIAN, Nonlinear Programming, McGraw-Hill, New York, 1969. Reprinted by SIAM Publications, 1995.
199. N. MARATOS, Exact penalty function algorithms for finite dimensional and control optimization problems, PhD thesis, University of London, 1978.
200. M. MARAZZI AND J. NOCEDAL, Wedge trust region methods for derivative free optimization, Mathematical Programming, Series A, 91 (2002), pp. 289–305.
201. H. M. MARKOWITZ, Portfolio selection, Journal of Finance, 8 (1952), pp. 77–91.
202. , The elimination form of the inverse and its application to linear programming, Management Science, 3 (1957), pp. 255–269.
203. D. W. MARQUARDT, An algorithm for least squares estimation of non-linear parameters, SIAM Journal, 11 (1963), pp. 431–441.
204. D. Q. MAYNE AND E. POLAK, A superlinearly convergent algorithm for constrained optimization problems, Mathematical Programming Studies, 16 (1982), pp. 45–61.
205. L. MCLINDEN, An analogue of Moreau’s proximation theorem, with applications to the nonlinear complementarity problem, Pacific Journal of Mathematics, 88 (1980), pp. 101–161.
206. N. MEGIDDO, Pathways to the optimal set in linear programming, in Progress in Mathematical Programming: Interior-Point and Related Methods, N. Megiddo, ed., Springer-Verlag, New York, NY, 1989, ch. 8, pp. 131–158.
207. S. MEHROTRA, On the implementation of a primal-dual interior point method, SIAM Journal on Optimization, 2 (1992), pp. 575–601.
208. S. MIZUNO, M. TODD, AND Y. YE, On adaptive step primal-dual interior-point algorithms for linear programming, Mathematics of Operations Research, 18 (1993), pp. 964–981.
209. J. L. MORALES AND J. NOCEDAL, Automatic preconditioning by limited memory quasi-newton updating, SIAM Journal on Optimization, 10 (2000), pp. 1079–1096.
210. J. J. MORÉ, The Levenberg-Marquardt algorithm: Implementation and theory, in Lecture Notes in Mathematics, No. 630–Numerical Analysis, G. Watson, ed., Springer-Verlag, 1978, pp. 105–116.
211. , Recent developments in algorithms and software for trust region methods, in Mathematical Programming: The State of the Art, Springer-Verlag, Berlin, 1983, pp. 258–287.
212. , A collection of nonlinear model problems, in Computational Solution of Nonlinear Systems of Equations, vol. 26 of Lectures in Applied Mathematics, American Mathematical Society, Providence, RI, 1990, pp. 723–762.
213. J. J. MORÉ AND D. C. SORENSEN, On the use of directions of negative curvature in a modified Newton method, Mathematical Programming, 16 (1979), pp. 1–20.
214. , Computing a trust region step, SIAM Journal on Scientific and Statistical Computing, 4 (1983), pp. 553–572.
215. , Newton’s method, in Studies in Numerical Analysis, vol. 24 of MAA Studies in Mathematics, The Mathematical Association of America, 1984, pp. 29–82.
216. J. J. MORÉ AND D. J. THUENTE, Line search algorithms with guaranteed sufficient decrease, ACM Transactions on Mathematical Software, 20 (1994), pp. 286–307.
217. J. J. MORÉ AND S. J. WRIGHT, Optimization Software Guide, SIAM Publications, Philadelphia, 1993.
218. B. A. MURTAGH AND M. A. SAUNDERS, MINOS 5.1 User’s guide, Technical Report SOL-83-20R, Stanford University, 1987.
219. K. G. MURTY AND S. N. KABADI, Some NP-complete problems in quadratic and nonlinear programming, Mathematical Programming, 19 (1987), pp. 200–212.
220. S. G. NASH, Newton-type minimization via the Lanczos method, SIAM Journal on Numerical Analysis, 21 (1984), pp. 553–572.
221. , SUMT (Revisited), Operations Research, 46 (1998), pp. 763–775.
222. U. NAUMANN, Optimal accumulation of Jacobian matrices by elimination methods on the dual computational graph, Mathematical Programming, 99 (2004), pp. 399–421.
223. J. A. NELDER AND R. MEAD, A simplex method for function minimization, The Computer Journal, 8 (1965), pp. 308–313.
224. G. L. NEMHAUSER AND L. A. WOLSEY, Integer and Combinatorial Optimization, John Wiley & Sons, New York, 1988.
225. A. S. NEMIROVSKII AND D. B. YUDIN, Problem complexity and method efficiency, John Wiley & Sons, New York, 1983.
226. Y. E. NESTEROV AND A. S. NEMIROVSKII, Interior Point Polynomial Methods in Convex Programming, SIAM Publications, Philadelphia, 1994.
227. G. N. NEWSAM AND J. D. RAMSDELL, Estimation of sparse Jacobian matrices, SIAM Journal on Algebraic and Discrete Methods, 4 (1983), pp. 404–418.
228. J. NOCEDAL, Updating quasi-Newton matrices with limited storage, Mathematics of Computation, 35 (1980), pp. 773–782.
229. , Theory of algorithms for unconstrained optimization, Acta Numerica, 1 (1992), pp. 199– 242.
230. J. M. ORTEGA AND W. C. RHEINBOLDT, Iterative solution of nonlinear equations in several variables, Academic Press, New York and London, 1970.
231. M. R. OSBORNE, Nonlinear least squares—the Levenberg algorithm revisited, Journal of the Australian Mathematical Society, Series B, 19 (1976), pp. 343–357.
232. , Finite Algorithms in Optimization and Data Analysis, John Wiley & Sons, New York, 1985.
233. M. L. OVERTON, Numerical Computing with IEEE Floating Point Arithmetic, SIAM, Philadelphia, PA, 2001.
234. C. C. PAIGE AND M. A. SAUNDERS, LSQR: An algorithm for sparse linear equations and sparse least squares, ACM Transactions on Mathematical Software, 8 (1982), pp. 43–71.
235. C. H. PAPADIMITRIOU AND K. STEIGLITZ, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, Englewood Cliffs, NJ, 1982.
236. E. POLAK, Optimization: Algorithms and Consistent Approximations, no. 124 in Applied Mathematical Sciences, Springer, 1997.
237. E. POLAK AND G. RIBIÈRE, Note sur la convergence de méthodes de directions conjuguées, Revue Française d’Informatique et de Recherche Opérationnelle, 16 (1969), pp. 35–43.
238. B. T. POLYAK, The conjugate gradient method in extremal problems, U.S.S.R. Computational Mathematics and Mathematical Physics, 9 (1969), pp. 94–112.
239. M. J. D. POWELL, An efficient method for finding the minimum of a function of several variables without calculating derivatives, Computer Journal, 91 (1964), pp. 155–162.
240. , A method for nonlinear constraints in minimization problems, in Optimization, R. Fletcher, ed., Academic Press, New York, NY, 1969, pp. 283–298.
241. , A hybrid method for nonlinear equations, in Numerical Methods for Nonlinear Algebraic Equations, P. Rabinowitz, ed., Gordon & Breach, London, 1970, pp. 87–114.
242. , Problems related to unconstrained optimization, in Numerical Methods for Unconstrained Optimization, W. Murray, ed., Academic Press, 1972, pp. 29–55.
243. , On search directions for minimization algorithms, Mathematical Programming, 4 (1973), pp. 193–201.
244. , Convergence properties of a class of minimization algorithms, in Nonlinear Programming 2, O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, eds., Academic Press, New York, 1975, pp. 1–27.
245. , Some convergence properties of the conjugate gradient method, Mathematical Programming, 11 (1976), pp. 42–49.
246. , Some global convergence properties of a variable metric algorithm for minimization without exact line searches, in Nonlinear Programming, SIAM-AMS Proceedings, Vol. IX, R. W. Cottle and C. E. Lemke, eds., SIAM Publications, 1976, pp. 53–72.
247. , A fast algorithm for nonlinearly constrained optimization calculations, in Numerical Analysis Dundee 1977, G. A. Watson, ed., Springer Verlag, Berlin, 1977, pp. 144–157.
248. , Restart procedures for the conjugate gradient method, Mathematical Programming, 12 (1977), pp. 241–254.
249. , Algorithms for nonlinear constraints that use Lagrangian functions, Mathematical Programming, 14 (1978), pp. 224–248.
250. , The convergence of variable metric methods for nonlinearly constrained optimization calculations, in Nonlinear Programming 3, Academic Press, New York and London, 1978, pp. 27–63.
251. , On the rate of convergence of variable metric algorithms for unconstrained optimization, Technical Report DAMTP 1983/NA7, Department of Applied Mathematics and Theoretical Physics, Cambridge University, 1983.
252. , Variable metric methods for constrained optimization, in Mathematical Programming: The State of the Art, Bonn, 1982, Springer-Verlag, Berlin, 1983, pp. 288–311.
253. , Nonconvex minimization calculations and the conjugate gradient method, Lecture Notes in Mathematics, 1066 (1984), pp. 122–141.
254. , The performance of two subroutines for constrained optimization on some difficult test problems, in Numerical Optimization, P. T. Boggs, R. H. Byrd, and R. B. Schnabel, eds., SIAM Publications, Philadelphia, 1984.
255. , Convergence properties of algorithms for nonlinear optimization, SIAM Review, 28 (1986), pp. 487–500.
256. , Direct search algorithms for optimization calculations, Acta Numerica, 7 (1998), pp. 287– 336.
257. , UOBYQA: unconstrained optimization by quadratic approximation, Mathematical Programming, Series B, 92 (2002), pp. 555–582.
258. , On trust-region methods for unconstrained minimization without derivatives, Mathematical Programming, 97 (2003), pp. 605–623.
259. , Least Frobenius norm updating of quadratic models that satisfy interpolation conditions, Mathematical Programming, 100 (2004), pp. 183–215.
260. , The NEWUOA software for unconstrained optimization without derivatives, Numerical Analysis Report DAMPT 2004/NA05, University of Cambridge, Cambridge, UK, 2004.
261. M. J. D. POWELL AND P. L. TOINT, On the estimation of sparse Hessian matrices, SIAM Journal on Numerical Analysis, 16 (1979), pp. 1060–1074.
262. R. L. RARDIN, Optimization in Operations Research, Prentice Hall, Englewood Cliffs, NJ, 1998.
263. F. RENDL AND H. WOLKOWICZ, A semidefinite framework for trust region subproblems with applications to large scale minimization, Mathematical Programming, 77 (1997), pp. 273–299.
264. J. M. RESTREPO, G. K. LEAF, AND A. GRIEWANK, Circumventing storage limitations in variational data assimilation studies, SIAM Journal on Scientific Computing, 19 (1998), pp. 1586–1605.
265. K. RITTER, On the rate of superlinear convergence of a class of variable metric methods, Numerische Mathematik, 35 (1980), pp. 293–313.
266. S. M. ROBINSON, A quadratically convergent algorithm for general nonlinear programming problems, Mathematical Programming, 3 (1972), pp. 145–156.
267. , Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms, Mathematical Programming, 7 (1974), pp. 1–16.
268. , Generalized equations and their solutions. Part II: Applications to nonlinear programming, Mathematical Programming Study, 19 (1982), pp. 200–221.
269. R. T. ROCKAFELLAR, The multiplier method of Hestenes and Powell applied to convex programming, Journal of Optimization Theory and Applications, 12 (1973), pp. 555–562.
270. , Lagrange multipliers and optimality, SIAM Review, 35 (1993), pp. 183–238.
271. J. B. ROSEN AND J. KREUSER, A gradient projection algorithm for nonlinear constraints, in Numerical Methods for Non-Linear Optimization, F. A. Lootsma, ed., Academic Press, London and New York, 1972, pp. 297–300.
272. , Iterative Methods for Sparse Linear Systems, SIAM Publications, Philadelphia, PA, second ed., 2003.
273. Y. SAAD AND M. SCHULTZ, GMRES: A generalized minimal residual algorithm for solving non-symmetric linear systems, SIAM Journal on Scientific and Statistical Computing, 7 (1986), pp. 856–869.
274. H. SCHEEL AND S. SCHOLTES, Mathematical programs with complementarity constraints: Stationarity, optimality and sensitivity, Mathematics of Operations Research, 25 (2000), pp. 1–22.
275. T. SCHLICK, Modified Cholesky factorizations for sparse preconditioners, SIAM Journal on Scientific Computing, 14 (1993), pp. 424–445.
276. R. B. SCHNABEL AND E. ESKOW, A new modified Cholesky factorization, SIAM Journal on Scientific Computing, 11 (1991), pp. 1136–1158.
277. R. B. SCHNABEL AND P. D. FRANK, Tensor methods for nonlinear equations, SIAM Journal on Numerical Analysis, 21 (1984), pp. 815–843.
278. G. SCHULLER, On the order of convergence of certain quasi-Newton methods, Numerische Mathematik, 23 (1974), pp. 181–192.
279. G. A. SCHULTZ, R. B. SCHNABEL, AND R. H. BYRD, A family of trust-region-based algorithms for unconstrained minimization with strong global convergence properties, SIAM Journal on Numerical Analysis, 22 (1985), pp. 47–67.
280. G. A. F. SEBER AND C. J. WILD, Nonlinear Regression, John Wiley & Sons, New York, 1989.
281. T. STEIHAUG, The conjugate gradient method and trust regions in large scale optimization, SIAM Journal on Numerical Analysis, 20 (1983), pp. 626–637.
282. J. STOER, On the relation between quadratic termination and convergence properties of minimization algorithms. Part I: Theory, Numerische Mathematik, 28 (1977), pp. 343–366.
283. K. TANABE, Centered Newton method for mathematical programming, in System Modeling and Optimization: Proceedings of the 13th IFIP conference, vol. 113 of Lecture Notes in Control and Information Systems, Berlin, 1988, Springer-Verlag, pp. 197–206.
284. M. J. TODD, Potential reduction methods in mathematical programming, Mathematical Programming, Series B, 76 (1997), pp. 3–45.
285. , Semidefinite optimization, Acta Numerica, 10 (2001), pp. 515–560.
286. , Detecting infeasibility in infeasible-interior-point methods for optimization, in Foundations of Computational Mathematics, Minneapolis, 2002, F. Cucker, R. DeVore, P. Olver, and E. Suli, eds., Cambridge University Press, Cambridge, 2004, pp. 157–192.
287. M. J. TODD AND Y. YE, A centered projective algorithm for linear programming, Mathematics of Operations Research, 15 (1990), pp. 508–529.
288. P. L. TOINT, On sparse and symmetric matrix updating subject to a linear equation, Mathematics of Computation, 31 (1977), pp. 954–961.
289. , Towards an efficient sparsity exploiting Newton method for minimization, in Sparse Matrices and Their Uses, Academic Press, New York, 1981, pp. 57–87.
290. L. TREFETHEN AND D. BAU, Numerical Linear Algebra, SIAM, Philadelphia, PA, 1997.
291. M. ULBRICH, S. ULBRICH, AND L. N. VICENTE, A globally convergence primal-dual interior-point filter method for nonlinear programming, Mathematical Programming, Series B, 100 (2004), pp. 379–410.
292. L. VANDENBERGHE AND S. BOYD, Semidefinite programming, SIAM Review, 38 (1996), pp. 49–95.
293. R. J. VANDERBEI, Linear Programming: Foundations and Extensions, Springer Verlag, New York, second ed., 2001.
294. ] R. J. VANDERBEI AND D. F. SHANNO, An interior point algorithm for nonconvex nonlinear programming, Computational Optimization and Applications, 13 (1999), pp. 231–252.
295. A. VARDI, A trust region algorithm for equality constrained minimization: convergence properties and implementation, SIAM Journal of Numerical Analysis, 22 (1985), pp. 575–591.
296. S. A. VAVASIS, Quadratic programming is NP, Information Processing Letters, 36 (1990), pp. 73– 77.
297. , Nonlinear Optimization, Oxford University Press, New York and Oxford, 1991.
298. A. WÄCHTER, An interior point algorithm for large-scale nonlinear optimization with applications in process engineering, PhD thesis, Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, PA, USA, 2002.
299. A. WÄCHTER AND L. T. BIEGLER, Failure of global convergence for a class of interior point methods for nonlinear programming, Mathematical Programming, 88 (2000), pp. 565–574.
300. , Line search filter methods for nonlinear programming: Motivation and global convergence, SIAM Journal on Optimization, 16 (2005), pp. 1–31.
301. , On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming, Mathematical Programming, 106 (2006), pp. 25–57.
302. H. WALKER, Implementation of the GMRES method using Householder transformations, SIAM Journal on Scientific and Statistical Computing, 9 (1989), pp. 815–825.
303. R. A. WALTZ, J. L. MORALES, J. NOCEDAL, AND D. ORBAN, An interior algorithm for nonlinear optimization that combines line search and trust region steps, Tech. Rep. 2003-6, Optimization Technology Center, Northwestern University, Evanston, IL, USA, June 2003.
304. WATERLOO MAPLE SOFTWARE, INC, Maple V software package, 1994.
305. L. T. WATSON, Numerical linear algebra aspects of globally convergent homotopy methods, SIAM Review, 28 (1986), pp. 529–545.
306. R. B. WILSON, A simplicial algorithm for concave programming, PhD thesis, Graduate School of Business Administration, Harvard University, 1963.
307. D. WINFIELD, Function and functional optimization by interpolation in data tables, PhD thesis, Harvard University, Cambridge, USA, 1969.
308. W. L. WINSTON, Operations Research, Wadsworth Publishing Co., third ed., 1997.
309. P. WOLFE, A duality theorem for nonlinear programming, Quarterly of Applied Mathematics, 19 (1961), pp. 239–244.
310. , The composite simplex algorithm, SIAM Review, 7 (1965), pp. 42–54.
311. S. WOLFRAM, The Mathematica Book, Cambridge University Press and Wolfram Media, Inc., third ed., 1996.
312. L. A. WOLSEY, Integer Programming, Wiley–Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, New York, NY, 1998.
313. M. H. WRIGHT, Interior methods for constrained optimization, in Acta Numerica 1992, Cambridge University Press, Cambridge, 1992, pp. 341–407.
314. , Direct search methods: Once scorned, now respectable, in Numerical Analysis 1995 (Pro-ceedings of the 1995 Dundee Biennial Conference in Numerical Analysis), Addison Wesley Longman, 1996, pp. 191–208.
315. S. J. WRIGHT, Applying new optimization algorithms to model predictive control, in Chemical Process Control-V, J. C. Kantor, ed., CACHE, 1997.
316. , Primal-Dual Interior-Point Methods, SIAM Publications, Philadelphia, PA, 1997.
317. , Modified Cholesky factorizations in interior-point algorithms for linear programming, SIAM Journal on Optimization, 9 (1999), pp. 1159–1191.
318. S. J. WRIGHT AND J. N. HOLT, An inexact Levenberg-Marquardt method for large sparse nonlinear least squares problems, Journal of the Australian Mathematical Society, Series B, 26 (1985), pp. 387–403.
319. E. A. YILDIRIM AND S. J. WRIGHT, Warm-start strategies in interior-point methods for linear programming, SIAM Journal on Optimization, 12 (2002), pp. 782–810.
320. Y. YUAN, On the truncated conjugate-gradient method, Mathematical Programming, Series A, 87 (2000), pp. 561–573.
321. Y. ZHANG, Solving large-scale linear programs with interior-point methods under the Matlab environment, Optimization Methods and Software, 10 (1998), pp. 1–31.
322. C. ZHU, R. H. BYRD, P. LU, AND J. NOCEDAL, Algorithm 778: L-BFGS-B, FORTRAN subroutines for large scale bound constrained optimization, ACM Transactions on Mathematical Software, 23 (1997), pp. 550–560.