On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming

Abstract

Previous article Next article On the Convergence of Some Feasible Direction Algorithms for Nonlinear ProgrammingDonald M. Topkis and Arthur F. Veinott, Jr.Donald M. Topkis and Arthur F. Veinott, Jr.https://doi.org/10.1137/0305018PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] Edward W. Barankin, Bounds for the characteristic roots of a matrix, Bull. Amer. Math. Soc., 51 (1945), 767–770 MR0013118 0061.01507 CrossrefISIGoogle Scholar[2] A. Cauchy, Méthode générale pour la résolution des systèmes d'équations simultanées, C. R. Acad. Sci. Paris, 25 (1847), 536–538 Google Scholar[3] Jean Bronfenbrenner Crockett and , Herman Chernoff, Gradient methods of maximization, Pacific J. Math., 5 (1955), 33–50 MR0075676 0066.10103 CrossrefGoogle Scholar[4] Haskell B. Curry, The method of steepest descent for non-linear minimization problems, Quart. Appl. Math., 2 (1944), 258–261 MR0010667 0061.26801 CrossrefGoogle Scholar[5] D. A. D'Esopo, A convex programming procedure, Naval Res. Logist. Quart., 6 (1959), 33–42 MR0104520 CrossrefGoogle Scholar[6] R. Fletcher and , M. J. D. Powell, A rapidly convergent descent method for minimization, Comput. J., 6 (1963/1964), 163–168 MR0152116 0132.11603 CrossrefISIGoogle Scholar[7] Marguerite Frank and , Philip Wolfe, An algorithm for quadratic programming, Naval Res. Logist. Quart., 3 (1956), 95–110 MR0089102 CrossrefGoogle Scholar[8] F. R. Gantmacher, The theory of matrices. Vol. 1, Translated by K. A. Hirsch, Chelsea Publishing Co., New York, 1959Vol. 1, pp. x+374 MR0107649 Google Scholar[9] A. A. Goldstein, Cauchy's method of minimization, Numer. Math., 4 (1962), 146–150 10.1007/BF01386306 MR0141222 0105.10201 CrossrefGoogle Scholar[10] A. A. Goldstein, On steepest descent, J. Soc. Indust. Appl. Math. Ser. A Control, 3 (1965), 147–151 MR0184777 0221.65094 LinkGoogle Scholar[11] A. A. Goldstein, Minimizing functionals on normed-linear spaces, SIAM J. Control, 4 (1966), 81–89 10.1137/0304008 MR0196900 0147.12701 LinkGoogle Scholar[12] G. Hadley, Nonlinear and dynamic programming, Addison-Wesley Publishing Co., Inc., Reading, Mass.-London, 1964, 296–305 MR0173543 0179.24601 Google Scholar[13] Alston S. Householder, Principles of numerical analysis, McGraw-Hill Book Company, Inc., New York-Toronto-London, 1953, 132–134 MR0059056 0051.34602 Google Scholar[14] V. Ivanov, A general approximation method for solving linear problems, Soviet Math. Dokl., 3 (1962), 415–418 0168.13203 Google Scholar[15] V. V. Ivanov, Algorithms of rapid descent, Soviet Math. Dokl., 3 (1962), 476–479 Google Scholar[16] Kenneth Levenberg, A method for the solution of certain non-linear problems in least squares, Quart. Appl. Math., 2 (1944), 164–168 MR0010666 0063.03501 CrossrefGoogle Scholar[17] M. J. D. Powell, An efficient method for finding the minimum of a function of several variables without calculating derivatives, Comput. J., 7 (1964), 155–162 10.1093/comjnl/7.2.155 MR0187376 0132.11702 CrossrefISIGoogle Scholar[18] J. B. Rosen, The gradient projection method for nonlinear programming. I. Linear constraints, J. Soc. Indust. Appl. Math., 8 (1960), 181–217 10.1137/0108011 MR0112750 0099.36405 LinkISIGoogle Scholar[19] J. B. Rosen, The gradient projection method for nonlinear programming. II. Nonlinear constraints, J. Soc. Indust. Appl. Math., 9 (1961), 514–532 10.1137/0109044 MR0135991 0231.90048 LinkISIGoogle Scholar[20] Samuel Schechter, Iteration methods for nonlinear problems, Trans. Amer. Math. Soc., 104 (1962), 179–189 MR0152142 0106.31801 CrossrefGoogle Scholar[21] B. V. Shah, , R. J. Buehler and , O. Kempthorne, Some algorithms for minimizing a function of several variables, J. Soc. Indust. Appl. Math., 12 (1964), 74–92 10.1137/0112007 MR0165655 0127.33902 LinkISIGoogle Scholar[22] H. A. Spang, III, A review of minimization techniques for nonlinear functions, SIAM Rev., 4 (1962), 343–365 10.1137/1004089 MR0145642 0112.12205 LinkISIGoogle Scholar[23] Josef Stoer, Duality in nonlinear programming and the minimax theorem, Numer. Math., 5 (1963), 371–379 10.1007/BF01385903 MR0172719 0152.38104 CrossrefGoogle Scholar[24] P. Wolfe, On the convergence of gradient methods under constraints, Research Report, RZ 204, IBM, Zurich, Switzerland, 1966 Google Scholar[25] G. Zoutendijk, Methods of feasible directions: A study in linear and non-linear programming, Elsevier Publishing Co., Amsterdam-London-New York-Princeton, N.J., 1960ii+127, Chap. 7. MR0129119 0097.35408 Google Scholar[26] S. Zuhovickii, , R. Poljak and , M. Primak, An algorithm for the solution of a problem of convex Cebysev approximation, Soviet Math. Dokl., 4 (1963), 901–904 0143.17801 Google Scholar Previous article Next article FiguresRelatedReferencesCited byDetails An Efficient Method of Feasible DirectionsGerard G. L. Meyer17 February 2012 | SIAM Journal on Control and Optimization, Vol. 21, No. 1AbstractPDF (1058 KB)On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations AlgorithmsC. Gonzaga and E. Polak18 July 2006 | SIAM Journal on Control and Optimization, Vol. 17, No. 4AbstractPDF (1816 KB)On Finding the Maximal Range of Validity of a Constrained SystemShmuel Gal, Boris Bachelis, and Aharon Ben-Tal18 July 2006 | SIAM Journal on Control and Optimization, Vol. 16, No. 3AbstractPDF (2826 KB)A Comparison of the Forcing Function and Point-to-Set Mapping Approaches to Convergence AnalysisR. R. Meyer1 August 2006 | SIAM Journal on Control and Optimization, Vol. 15, No. 4AbstractPDF (2060 KB)A Finitely Solvable Class of Approximating ProblemsGerard G. L. Meyer18 July 2006 | SIAM Journal on Control and Optimization, Vol. 15, No. 3AbstractPDF (730 KB)A General Theory of Convergence for Constrained Optimization Algorithms that Use Antizigzagging ProvisionsR. Klessig1 August 2006 | SIAM Journal on Control, Vol. 12, No. 4AbstractPDF (1105 KB)A Kuhn–Tucker AlgorithmHilbert K. Schultz18 July 2006 | SIAM Journal on Control, Vol. 11, No. 3AbstractPDF (738 KB)An Historical Survey of Computational Methods in Optimal ControlE. Polak2 August 2006 | SIAM Review, Vol. 15, No. 2AbstractPDF (3413 KB)Rate of Convergence of a Class of Methods of Feasible DirectionsO. Pironneau and E. Polak14 July 2006 | SIAM Journal on Numerical Analysis, Vol. 10, No. 1AbstractPDF (1147 KB)A Convergence Theory for a Class of Nonlinear Programming ProblemsSteven W. Rauch14 July 2006 | SIAM Journal on Numerical Analysis, Vol. 10, No. 1AbstractPDF (2034 KB)A Drivable Method of Feasible DirectionsGerard G. L. Meyer18 July 2006 | SIAM Journal on Control, Vol. 11, No. 1AbstractPDF (534 KB)Abstract Models for the Synthesis of Optimization AlgorithmsGerard G. L. Meyer and E. Polak18 July 2006 | SIAM Journal on Control, Vol. 9, No. 4AbstractPDF (1450 KB)The Validity of a Family of Optimization MethodsRobert Meyer18 July 2006 | SIAM Journal on Control, Vol. 8, No. 1AbstractPDF (1604 KB)Convergence Conditions for Ascent MethodsPhilip Wolfe18 July 2006 | SIAM Review, Vol. 11, No. 2AbstractPDF (973 KB) Volume 5, Issue 2| 1967SIAM Journal on Control History Submitted:05 August 1966Published online:18 July 2006 InformationCopyright © 1967 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0305018Article page range:pp. 268-279ISSN (print):0036-1402Publisher:Society for Industrial and Applied Mathematics