Computational Mathematical Programming pp 209-247 | Cite as

# Model Building and Practical Aspects of Nonlinear Programming

## Abstract

This survey paper has two main purposes: to summarize (briefly) certain aspects of modelling that influence the performance of optimization algorithms, and to describe recent advances in methods for nonlinear programming that influence the solution of practical problems. These two themes are not unconnected. A well constructed mathematical model should be such that the bad effects of ill-conditioning, degeneracy and inconsistent constraints are minimized. Ironically, the purpose of good software is to deal effectively with precisely these problems. Therefore it is not surprising that much of the insight necessary to construct a well- posed mathematical model is pertinent to the formulation of robust algorithms.

## Keywords

Search Direction Lagrangian Function Sequential Quadratic Programming Merit Function Problem Function## Preview

Unable to display preview. Download preview PDF.

## References

- Bartholomew-Biggs, M. C. (1982). “Recursive quadratic programming methods for nonlinear constraints”, in
*Nonlinear Optimization, 1981*, (M. J. D. Powell, ed.), pp. 213-221, Academic Press, London.Google Scholar - Biggs, M. C. (1972a). “Constrained minimization using recursive equality quadratic programming”, in
*Numerical Methods for Non-Linear Optimization*(F. A. Lootsma, ed.), pp. 411-428, Academic Press, London and New York.Google Scholar - Biggs, M. C. (1972b). Minimization algorithms making use of non-quadratic properties of the objective function, J.
*Inst. Maths. Applics*. 8, pp. 315-327.Google Scholar - Boggs, P. T., Tolle, J. W. and Wang, P. (1982). On the local convergence of quasi-Newton methods for constrained optimization,
*SIAM J. Control and Optimization*20, pp. 161-171.Google Scholar - Bracken, J. and McCormick, G. P. (1968).
*Selected Applications of Nonlinear Programming*, John Wiley and Sons, New York and Toronto.Google Scholar - Brent, R. P. (1973).
*Algorithms for Minimization without Derivatives*, Prentice-Hall, Inc., Engle-wood Cliffs, New Jersey.Google Scholar - Bunch, J. R. and Kaufman, L. C. (1980). A computational method for the indefinite quadratic programming problem, Linear
*Algebra and its Applies*. 34, pp. 341-370.Google Scholar - Coleman, T. F. and Conn, A. R. (1982). Nonlinear programming via an exact penalty function,
*Math. Prog*. 24, pp. 123-161.Google Scholar - Coleman, T. F. and Sorensen, D. C. (1984). A note on the computation of an orthogonal basis for the null space of a matrix,
*Math. Prog*. 29, pp. 234-242.Google Scholar - Dembo, R. S. (1976). A set of geometric test problems and their solutions,
*Math. Prog*.**10**, pp. 192-213.Google Scholar - Dennis, J. E., Jr. and More, J. J. (1977). Quasi-Newton methods, motivation and theory,
*SIAM Review*19, pp. 46-89.Google Scholar - Dennis, J. E., Jr. and Schnabel, R. E. (1981). “A new derivation of symmetric positive definite secant updates”,
*Nonlinear Programming 4*(O. L. Mangasarian, R. R. Meyer and S. M. Robinson, eds.), pp. 167-199, Academic Press, London and New York.Google Scholar - Dennis, J. E., Jr. and Schnabel, R. B. (1983).
*Numerical Methods for Unconstrained Optimization and Nonlinear Equations*, Prentice-Hall, Inc., Englewood Cliffs, New Jersey.Google Scholar - Fiacco, A. V. and McCormick, G. P. (1968).
*Nonlinear Programming: Sequential Unconstrained Minimization Techniques*, John Wiley and Sons, New York and Toronto.Google Scholar - Fletcher, R. (1981).
*Practical Methods of Optimization, Volume 2, Constrained Optimization*, John Wiley and Sons, New York and Toronto.Google Scholar - Fletcher, R. (1983). “Penalty functions”, in
*Mathematical Programming: The State of the Art*, (A. Bachern, M. Grötschel and B. Korte, eds.), pp. 87-114, Springer-Verlag, Berlin, Heidelberg, New York and Tokyo.Google Scholar - Gabay, D. (1982). Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization,
*Math. Prog. Study*16, pp. 18-44.Google Scholar - Gill, P. E., Golub, G. H., Murray, W. and Saunders, M. A. (1974). Methods for modifying matrix factorizations,
*Math. Comp*. 28, pp. 505-535.Google Scholar - Gill, P. E. and Murray, W. (1972). Quasi-Newton methods for unconstrained optimization, J. Just.
*Maths. Applics*. 9, pp. 91-108.Google Scholar - Gill, P. E, and Murray, W. (1974). Newton-type methods for unconstrained and linearly constrained optimization,
*Math. Prog*. 28, pp. 311-350.Google Scholar - Gill, P. E. and Murray, W. (1978). Numerically stable methods for quadratic programming,
*Math. Prog*. 14, pp. 349-372.Google Scholar - Gill, P. E., Murray, W., Saunders, M. A. and Wright, M. II. (1984a). User’s guide for QPSOL (Version 3.2): a Fortran package for quadratic programming, Report SOL 84-6, Department of Operations Research, Stanford University, California.Google Scholar
- Gill, P. E., Murray, W., Saunders, M. A. and Wright, M. H. (1984b). User’s guide for NPSOL (Version 2.1): a Fortran package for nonlinear programming, Report SOL 84-7, Department of Operations Research, Stanford University, California.Google Scholar
- Gill, P. E., Murray, W., Saunders, M. A. and Wright, M. H. (1984c). Procedures for optimization problems with a mixture of bounds and general linear constraints,
*ACM Transactions on Mathematical Software***10**, pp. 282-298.Google Scholar - Gill, P. E., Murray, W., Saunders, M. A. and Wright, M. H. (1984d). Software and its relationship to methods, Report SOL 84-10, Department of Operations Research, Stanford University, California.Google Scholar
- Gill, P. E., Murray, W., Saunders, M. A., Stewart, G. W. and Wright, M. H. (1985a). Properties of a representation of a basis for the null space, Report SOL 85-1, Department of Operations Research, Stanford University, California.Google Scholar
- Gill, P. E., Murray, W., Saunders, M. A. and Wright, M. H. (1985b). The design and implementation of a quadratic programming algorithm, to appear, Department of Operations Research, Stanford University, California.Google Scholar
- Gill, P. E., Murray, W. and Wright, M. H. (1981).
*Practical Optimization*, Academic Press, London and New York.Google Scholar - Goldfarb, D. and Idnani, A. (1983). A numerically stable dual method for solving strictly convex quadratic programs.
*Math. Prog*.**27**, pp. 1-33.Google Scholar - Han, S.-P. (1976). Superlinearly convergent variable metric algorithms for general nonlinear programming problems,
*Math. Prog*.**11**, pp. 263-282.Google Scholar - Harris, P. M. J. (1973). Pivot selection methods of the Devex LP code,
*Math. Prog*.**5**, pp. 1-28. [Reprinted in*Math. Prog. Study***4**(1975), pp. 30-57.]Google Scholar - Hock, W. and Schittkowski, K. (1981). Test examples for nonlinear programming,
*Lecture Notes in Economics and Mathematical Systems*, Volume 187, Springer Verlag, Berlin, Heidelberg and New York.Google Scholar - McCormick, G. P. (1983).
*Nonlinear programming*, Wiley, Wiley-Interscience.Google Scholar - Murray, W. (1971). An algorithm for finding a local minimum of an indefinite quadratic program, Report NAC 1, National Physical Laboratory, England.Google Scholar
- Murray, W. and Wright, M. H. (1978). Methods for nonlinearly constrained optimization based on the trajectories of penalty and barrier functions, Report SOL 78-23, Department of Operations Research, Stanford University.Google Scholar
- Murray, W. and Wright, M. II. (1982). Computation of the search direction in constrained optimization algorithms,
*Math. Prog. Study***16**, pp. 63-83.Google Scholar - Murtagh, B. A. and Saunders, M. A. (1978). Large-scale linearly constrained optimization,
*Math. Prog*.**14**, pp. 41-72.Google Scholar - Nocedal, J. and Overton, M. (1983). Projected Hessian updating algorithms for nonlinearly constrained optimization, Report 95, Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, New York.Google Scholar
- Powell, M. J. D. (1974). “Introduction to constrained optimization”, in
*Numerical Methods for Constrained Optimization*(P. E. Gill and W. Murray, eds.), pp. 1-28, Academic Press, London and New York.Google Scholar - Powell, M. J. D. (1977). “A fast algorithm for nonlinearly constrained optimization calculations”, in
*Numerical Analysis, Dundee, 1977*(G. A. Watson, ed.), pp. 144-157, Springer-Verlag Lecture Notes in Mathematics, Volume 630, Berlin, Heidelberg and New York.Google Scholar - Powell, M. J. D. (1983a). “Variable metric methods for constrained optimization”, in
*Mathematical Programming: The State of the Art*, (A. Bachern, M. Grötschel and B. Korte, eds.), pp. 288-311, Springer-Verlag, Berlin, Heidelberg, New York and Tokyo.Google Scholar - Powell, M. J. D. (1983b). ZQPCVX a Fortran subroutine for convex quadratic programming, Report DAMTP 83/NA17, Department of Applied Mathematics and Theoretical Physics, University of Cambridge, England.Google Scholar
- Robinson, S. M. (1974). Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear programming algorithms,
*Math. Prog*.**7**, pp. 1-16.Google Scholar - Schittkowski, K. (1981). The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function,
*Numerische Mathematik***38**, pp. 83-114.Google Scholar - Schittkowski, K. (1983). On the convergence of a sequential quadratic programming method with an augmented Lagrangian line search function, Math. Operationsforsch, u. Statist., Ser. Optimization
**14**, pp. 197-216.Google Scholar - Stewart, G. W. (1973).
*Introduction to matrix computations*, Academic Press, London and New York.Google Scholar - Stoer, J. (1985). Foundations of recursive quadratic programming methods for solving nonlinear programs. This volume.Google Scholar
- Tone, K. (1983). Revisions of constraint approximations in the successive QP method for nonlinear programming, Math.
*Prog*.**26**, pp. 144-152.Google Scholar - Wilson, R. B. (1963).
*A Simplicial Algorithm for Concave Programming*, Ph. D. Thesis, Harvard University.Google Scholar - Wright, M. H. (1976). Numerical Methods for Nonlinearly Constrained Optimization, Ph. D. Thesis, Stanford University.Google Scholar