Summary
The paper represents an outcome of an extensive comparative study of nonlinear optimization algorithms. This study indicates that quadratic approximation methods which are characterized by solving a sequence of quadratic subproblems recursively, belong to the most efficient and reliable nonlinear programming algorithms available at present. The purpose of this paper is to analyse the theoretical convergence properties and to investigate the numerical performance in more detail. In Part 1, the exactL 1-penalty function of Han and Powell is replaced by a differentiable augmented Lagrange function for the line search computation to the able to prove the global convergence and to show that the steplength one is chosen in the neighbourhood of a solution. In Part 2, the quadratic subproblem is exchanged by a linear least squares problem to improve the efficiency, and to test the dependence of the performance from different solution methods for the quadratic or least squares subproblems.
Similar content being viewed by others
References
Bartholomew-Biggs, M.C.: An improved implementation of the recursive quadratic programming method for constrained minimization. Technical Report No. 105, Numerical Optimisation Centre, The Hatfield Polytechnic, Hatfield, England, 1979
Crane, R.L., Garbow, B.S., Hillstrom, K.E., Minkoff, M.: LCLSQ: An implementation of an algorithm for linearly constrained linear least squares problems, ANL-80-116, Argonne National Laboratory, Argonne, Illinois, 1980
Fletcher, R.: A general quadratic programming algorithm. J. Inst. Math. Appl.7, 76–91 (1971)
Gill, P.E., Murray, W., Saunders, M.A.: Methods for computing and modifying the LDV factors of a matrix. Math. Comput.29, 1051–1077 (1975)
Han, S.-P.: A globally convergent method for nonlinear programming. J. Optimization Theory Appl.22, 297–309 (1977)
Lawson, C.L., Hanson, R.J.: Solving least squares problems, Englewood Cliffs, New Jersey: Prentice Hall, 1974
Powell, M.J.D.: A fast algorithm for nonlinearly constrained optimization calculations. In: Numerical Analysis. Proceedings of the Biennial Conference Held at Dundee, June 1977 (G.A. Watson, ed.). Lecture Notes in Mathematic, Vol. 630. Berlin, Heidelberg, New York: Springer 1978
Schittkowski, K.: Nonlinear programming codes. Information, tests, performance. Lecture Notes in Economics and Mathematical Systems, Vol. 183. Berlin, Heidelberg, New York: Springer 1980
Schittkowski, K., Stoer, J.: A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes. Numer. Math.31, 431–463 (1979)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Schittkowski, K. The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. Numer. Math. 38, 115–127 (1982). https://doi.org/10.1007/BF01395811
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01395811