A globally convergent method for nonlinear programming. (English) Zbl 0336.90046


90C30 Nonlinear programming
41A60 Asymptotic approximations, asymptotic expansions (steepest descent, etc.)
Full Text: DOI


[1] Robinson, S. M.,Perturbed Kuhn-Tucker Points and Rates of Convergence for a Class of Nonlinear-Programming Algorithms, Mathematical Programming, Vol. 7, pp. 1-16, 1974. · Zbl 0294.90078 · doi:10.1007/BF01585500
[2] Garcia-Palomares, U. M., andMangasarian, O. L.,Superlinearly Convergent Quasi-Newton Algorithms for Nonlinearly Constrained Optimization Problems, Mathematical Programming, Vol. 11, pp. 1-13, 1976. · Zbl 0362.90103 · doi:10.1007/BF01580366
[3] Han, S. P.,Superlinearly Convergent Variable Metric Algorithms for General Nonlinear Programming Problems, Mathematical Programming, Vol. 11, pp. 263-282, 1976. · Zbl 0364.90097 · doi:10.1007/BF01580395
[4] Kowalik, J., andOsborne, M. R.,Methods for Unconstrained Optimization Problems, American Elsevier, New York, New York, 1968. · Zbl 0304.90099
[5] Dem’yanov, V. F., andMalozemov, V. N.,Introduction to Minimax, John Wiley and Sons, New York, New York, 1974.
[6] Daniel, J. M.,Stability of the Solution of Definite Quadratic Programs, Mathematical Programming, Vol. 5, pp. 41-53, 1973. · Zbl 0269.90037 · doi:10.1007/BF01580110
[7] Mangasarian, O. L.,Nonlinear Programming, McGraw-Hill Book Company, New York, New York, 1969.
[8] Stoer, J., andWitzgall, C.,Convexity and Optimization in Finite Dimensions, I, Springer-Verlag, Berlin, Germany, 1970. · Zbl 0203.52203
[9] Han, S. P.,Dual Variable Metric Methods for Constrained Optimization Problems, SIAM Journal on Control and Optimization, Vol. 15, No. 4, 1977. · Zbl 0361.90074
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.