Advertisement

Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Numerical study of some feasible direction methods in mathematical programming

  • 55 Accesses

Abstract

Some feasible direction methods for the minimization of a linearly constrained convex function are studied. Special emphasis is placed on the analysis of the procedures which find the search direction, by developing active set methods which use orthogonal or Gauss-Jordan-like transformations.

Numerical experiments are performed on a class of quadratic problems depending on two parameters, related to the conditioning of the matrix associated with the quadratic form and the matrix of active constraints at the optimal point. Results are given for the rate of convergence and the average iteration time.

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

References

  1. 1.

    Zoutendijk, G.,Mathematical Programming Methods, North-Holland, Amsterdam, Holland, 1976.

  2. 2.

    Rosen, J. B.,The Gradient Projection Methods for Nonlinear Programming, Part 1, Linear Constraints, SIAM Journal on Applied Mathematics, Vol. 8, No. 1, 1960.

  3. 3.

    Topkis, D. M., andVeinott, A. F.,On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming, SIAM Journal on Control, Vol. 5, No. 2, 1967.

  4. 4.

    Zoutendijk, G.,Methods of Feasible Directions, Elsevier, New York, New York, 1960.

  5. 5.

    Arioli, M., Laratta, A., andMenchi, O.,On the Computation of the Least Distance from a Polyhedral Convex Set, Istituto di Elaborazione dell'Informazione, Pisa, Italy, Report No. B80–29, 1980.

  6. 6.

    Golub, G. H.,Numerical Methods for Solving Linear Least Squares Problems, Numerische Mathematik, Vol. 7, pp. 206–216, 1965.

  7. 7.

    Lawson, C. L., andHanson, R. J.,Solving Least Squares Problems, Prentice-Hall, Englewood Cliffs, New Jersey, 1974.

  8. 8.

    Mifflin, R.,A Stable Method for Solving Certain Constrained Least Squares Problems, Mathematical Programming, Vol. 16, No. 2, 1979.

  9. 9.

    Schittkowski, K., andStoer, J.,A Factorization Method for the Solution of Constrained Linear Least Squares Problems Allowing Subsequent Data Changes, Numerische Mathematik, Vol. 31, pp. 431–463, 1979.

  10. 10.

    Stoer, J.,On the Numerical Solution of Constrained Least Squares Problems, SIAM Journal on Numerical Analysis, Vol. 8, No. 2, 1971.

  11. 11.

    Wilkinson, J. M.,The Algebraic Eigenvalue Problem, Oxford University Press, London, England, 1965.

  12. 12.

    Boot, J. G.,Quadratic Programming, North-Holland, Amsterdam, Holland, 1964.

  13. 13.

    Rosen, J. B., andSuzuki, S.,Construction of Nonlinear Programming Test Problems, Communications of ACM, Vol. 8, No. 2, 1965.

  14. 14.

    Chaney, K. W.,On the Rate of Convergence of Some Feasible Direction Algorithms, Journal of Optimization Theory and Applications, Vol. 20, No. 1, 1973.

  15. 15.

    Pironneau, O., andPolak, E.,Rate of Convergence of Methods of Feasible Directions, SIAM Journal on Numerical Analysis, Vol. 10, No. 1, 1973.

  16. 16.

    Ortega, J. A., andRheinboldt, W. C.,Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, New York, 1970.

  17. 17.

    Peters, G., andWilkinson, J. H.,On the Stability of Gauss-Jordan Elimination with Pivoting, Communications of ACM, Vol. 13, No. 3, 1975.

Download references

Author information

Additional information

This research was partially supported by the Progetto Finalizzato Informatica, CNR, Rome, Italy.

Communicated by I. Galligani

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Arioli, M., Laratta, A. & Menchi, O. Numerical study of some feasible direction methods in mathematical programming. J Optim Theory Appl 40, 1–23 (1983). https://doi.org/10.1007/BF00934629

Download citation

Key Words

  • Nonlinear programming
  • feasible directions
  • linear least squares
  • Householder orthogonal factorization
  • Gauss-Jordan factorization