Skip to main content
Log in

Projection methods for non-linear programming

  • Published:
Mathematical Programming Submit manuscript

Abstract

Several algorithms are presented for solving the non-linear programming problem, based on “variable-metric” projections of the gradient of the objective function into a local approximation to the constraints. The algorithms differ in the nature of this approximation. Inequality constraints are dealt with by selecting at each step a subset of “active” constraints to treat as equalities, this subset being the smallest necessary to ensure that the new point remains feasible. Some numerical results are given for the Colville problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Abadie and J. Carpentier, “Generalization of the Wolfe reduced gradient method to the case of non-linear constraints”, in:Optimization, Ed. R. Fletcher (Academic Press, New York, 1969).

    Google Scholar 

  2. J. Abadie and J. Guigou, “Numerical experiments with the GRG method”, in:Integer and nonlinear programming, Ed. J. Abadie (North-Holland, Amsterdam, 1970).

    Google Scholar 

  3. K.J. Arrow and R.M. Solow, in:Studies in linear and non-linear programming, Eds. K.J. Arrow, L. Hurwicz and H. Uzawa (Stanford University Press, Stanford, Calif., 1958).

    Google Scholar 

  4. E. Bodewig,Matrix calculus (North-Holland, Amsterdam, 1956) 66, 69.

    Google Scholar 

  5. A.R. Colville, “A comparative study on nonlinear programming codes”, IBM New York Scientific Center Report No. 320-2949 (1968). See also new reported results inInteger and nonlinear programming, Ed. J. Abadie (North-Holland, Amsterdam, 1970).

  6. R. Courant, “Variational methods for the solution of problems of equilibrium and vibrations”,Bulletin of the American Mathematical Society (January 1943).

  7. W.C. Davidon, “Variable metric method for minimization”, AEC Research and Development Report No. ANL-5990 (Rev.) (1959).

  8. A.V. Fiacco and G.P. McCormick,Nonlinear programming — sequential unconstrained minimization techniques (Wiley, New York, 1968).

    Google Scholar 

  9. R. Fletcher, “A class of methods for non-linear programming with termination and convergence properties”, Atomic Energy Research Establishment Report No. HL 69/2370 (1969).

  10. B.A. Murtagh and R.W.H. Sargent, “A constrained minimization method with quadratic convergence”, in:Optimization, Ed. R. Fletcher (Academic Press, New York, 1969).

    Google Scholar 

  11. B.A. Murtagh and R.W.H. Sargent, “Computational experience with quadratically convergent minimization methods”,Computer Journal 13 (2) (1970) 185.

    Google Scholar 

  12. M.J.D. Powell, “Rank one methods for unconstrained minimization”, Atomic Energy Research Establishment Report No. TP 372 (1969).

  13. J.B. Rosen, “The gradient projection method for non-linear programming; Part I, Linear constraints; Part II, Non-linear constraints,Journal of the Society for Industrial and Applied Mathematics 8 (1960) 181; 9 (1961) 514.

    Google Scholar 

  14. R.W.H. Sargent, “The convergence of variable-metric projection algorithms”, to be published.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sargent, R.W.H., Murtagh, B.A. Projection methods for non-linear programming. Mathematical Programming 4, 245–268 (1973). https://doi.org/10.1007/BF01584669

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01584669

Keywords

Navigation