Skip to main content
Log in

On a class of hybrid methods for smooth constrained optimization

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

With reference to smooth nonlinearly constrained optimization problems, we consider combinations of locally superlinearly convergent methods with globally convergent ones. The aim of this paper is threefold: to give a survey on well-known as well as possible unknown hybrid optimization methods, based on a special construction principle; to present a general convergence result for the class of hybrid algorithms; and to derive further methods for this class with new convergence properties.

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.

Similar content being viewed by others

References

  1. Schwetlick, H.,Numerische Lösung Nichtlinearer Gleichungen, Deutscher Verlag der Wissenschaften, Berlin, Germany, 1979.

    Google Scholar 

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

    Google Scholar 

  3. Wilson, R. B.,A Simplicial Algorithm for Concave Programming, PhD Thesis, Harvard University, Cambridge, Massachusetts, 1963.

    Google Scholar 

  4. Burkhardt, S.,Untersuchungen zu Einbettungsverfahren in der Nichtlinearen Optimierung unter Besonderer Berücksichtigung von Nichtoptimalitätsmaßen, Dissertation A, Technische Universität Dresden, 1985.

  5. Richter, C.,Ein Implementierbares Einbettungsverfahren der Nichtlinearen Optimierung, Mathematische Operationsforschung und Statistik, Vol. 15, pp. 545–553, 1984.

    Google Scholar 

  6. Gfrerer, H., Guddat, J., andWacker, H.,A Globally Convergent Algorithm Based on Imbedding and Parametric Optimization, Computing, Vol. 30, pp. 225–252, 1983.

    Google Scholar 

  7. Han, S. P.,A Globally Convergent Method for Nonlinear Programming, Journal of Optimization Theory and Applications, Vol. 22, pp. 297–309, 1977.

    Google Scholar 

  8. Powell, M. J. D.,A Fast Algorithm for Nonlinear Constrained Optimization Calculations, Numerical Analysis Proceedings, Dundee 1977, Edited by G. A. Watson, Springer-Verlag, Berlin, Germany, pp. 144–157, 1978.

    Google Scholar 

  9. Richter, C.,Zur Globalen Konvergenz des Gedämpften Wilson-Verfahrens, Mathematische Operationsforschung und Statistik, Series Optimization, Vol. 10, pp. 213–218, 1979.

    Google Scholar 

  10. Ruszczynski, A.,O Zbieznsci Method Aproksymacji Kwadratowych. Preprint Politechnika Warszawska, Institut Automatyki, Sprawozdanie, Zadanie Badawcze, I.2.0.3.2, Warszawa, Poland, 1977.

  11. Schittkowski, K.,On the Convergence of a Sequential Quadratic Programming Method with an Augmented Lagrangian Line Search Function, Mathematische Operationsforschung und Statistik, Series Optimization, Vol. 14, pp. 197–216, 1983.

    Google Scholar 

  12. Körner, E.,Regularisierungen des Wilson-Verfahrens, Dissertation A, Technische Universität Dresden, 1987.

  13. Fletcher, R.,Practical Methods of Optimization, Vols. 1 and 2, Wiley and Sons, Chichester, England, 1980 and 1981.

    Google Scholar 

  14. Gill, P. E., Murray, W., andWright, M. H.,Practical Optimization, Academic Press, New York, New York, 1981.

    Google Scholar 

  15. Körner, E., andRichter, C.,Eine Global und Lokal Überlinear Konvergente Regularisierung des Wilson-Verfahrens, Proceedings of the 15th Jahrestagung “Mathematische Optimierung,” Sellin/Rügen, Humboldt-Universität zu Berlin, Seminarberichte, pp. 195–212, 1983.

  16. Tone, K.,Revisions of Constrained Approximations in the Successive QP Method for Nonlinear Programming Problems, Mathematical Programming, Vol. 26, pp. 144–246, 1983.

    Google Scholar 

  17. Powell, M. J. D.,A Hybrid Method for Nonlinear Equations, Numerical Methods for Nonlinear Algebraic Equations, Edited by P. Rabinowitz, Gordon and Breach, London, England, pp. 87–114, 1970.

    Google Scholar 

  18. Richter, C.,Über die Numerische Behandlung Nichtlinearer Optimierungsaufgaben mit Hilfe von Verallgemeinerten Variationsungleichungen und von Nichtoptimalitätsmaßen, Dissertation B, Technische Universität Dresden, 1980.

  19. Polak, E.,On the Global Stabilization of Locally Convergent Algorithms, Automatica, Vol. 12, pp. 337–342, 1976.

    Google Scholar 

  20. Schönefeld, K.,Hybrid Optimization Methods without Strict Complementary Slackness Conditions, Proceedings der Internationalen Konferenz “Mathematische Optimierung—Theorie und Anwendungen,” Eisenach, Germany, pp. 137–140, 1986.

  21. Kleinmichel, H., Koch, W., Richter, C., andSchönefeld, K.,Überlinear Konvergente Verfahren der Nichtlinearen Optimierung, I–VI, Studientext, Technische Universität Dresden, 1984.

  22. Levitin, E. S., andPoljak, B. T.,Methody Minimizacii pri Nalicii Ogranicenii, Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, Vol. 6, pp. 787–823, 1966.

    Google Scholar 

  23. Robinson, S. M.,A Quadratically Convergent Algorithm for General Nonlinear Programming Problems, Mathematical Programming, Vol. 3, pp. 145–156, 1972.

    Google Scholar 

  24. Kleinmichel, H., Richter, C., andSchönefeld, K.,On the Global and Superlinear Convergence of a Discretized Version of Wilson's Method, Computing, Vol. 29, pp. 289–307, 1982.

    Google Scholar 

  25. Powell, M. J. D.,A New Algorithm for Unconstrained Optimization, Nonlinear Programming, Edited by J. B. Rosen, O. L. Magasarian, and K. Ritter, Academic Press, New York, New York, pp. 31–65, 1970.

    Google Scholar 

  26. Kleinmichel, H.,Zur Anwendung von Quasi-Newton-Verfahren in der Nichtlinearen Optimierung, Dissertation B, Technische Universität Dresden, 1982.

  27. Polak, E., andMayne, D. Q.,A Robust Secant Method for Optimization Problems with Inequality Constraints, Journal of Optimization Theory and Applications, Vol. 33, pp. 463–477, 1981.

    Google Scholar 

  28. Polak, E., Trahan, R., andMayne, D. Q.,Combined Phase I-Phase II Methods of Feasible Directions, Mathematical Programming, Vol. 17, pp. 61–73, 1979.

    Google Scholar 

  29. Richter, C., andSchönefeld, K.,Hybrid Methods in Nonlinear Programming, Lecture Notes on Control and Information Science, Springer-Verlag, Berlin, Germany, Vol. 84, pp. 745–750, 1986.

    Google Scholar 

  30. Best, M. J., Bräuninger, J., Ritter, K., andRobinson, S. M.,A Globally and Quadratically Convergent Algorithm for General Nonlinear Programming Problems, Computing, Vol. 26, pp. 141–153, 1981.

    Google Scholar 

  31. Psenicnyi, B. N., andSobolenko, L. A.,Uskorenije Shodimosti Methoda Linearizacii dlja Zadaci Uslovnoi Minimizacii, Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, Vol. 20, pp. 605–614, 1980.

    Google Scholar 

  32. Bräuninger, J.,A Globally Convergent Version of Robinson's Algorithm for General Nonlinear Programming Problems without Using Derivatives, Journal of Optimization Theory and Applications, Vol. 35, pp. 195–216, 1981.

    Google Scholar 

  33. Schönefeld, K.,A Hybrid Method for Linearly Constrained Optimization Problems, Optimization, Vol. 17, pp. 317–331, 1986.

    Google Scholar 

  34. Ishutkin, V. S., andSchönefeld, K.,On the Globalization of Wilson-Type Optimization Methods by Means of Generalized Reduced Gradient Methods, Computing, Vol. 37, pp. 151–169, 1986.

    Google Scholar 

  35. Kleinmichel, H.,Überlinear Konvergente Verfahren der Nichtlinearen Optimierung, Proceedings of the 10th IKM, Weimar, Germany, Wissenschaftliche Zeitschrift der HAB Weimar, Vol. 4, pp. 73–76, 1984.

    Google Scholar 

  36. Kleinmichel, H., andSchönefeld, K.,Newton-Type Methods for Nonlinearly Constrained Programming Problems—Algorithm and Theory, Optimization, Vol. 19, pp. 397–412, 1988.

    Google Scholar 

  37. Schönefeld, K.,Über Lokale Optimierungsverfahren und deren Kopplung mit Global Konvergenten Verfahren, Dissertation B, Technische Universität Dresden, 1988.

  38. Mangasarian, O. L.,Equivalence of the Complementarity Problem to a System of Nonlinear Equations, SIAM Journal on Applied Mathematics, Vol. 31, pp. 89–92, 1976.

    Google Scholar 

  39. Wierzbicki, A. P.,Note on the Equivalence of Kuhn-Tucker Complementarity Conditions to an Equation, Journal of Optimization Theory and Applications, Vol. 37, pp. 401–405, 1982.

    Google Scholar 

  40. Schönefeld, K.,A Superlinearly Convergent Method for Constrained Optimization, Proceedings of the 11th IKM, Weimar, Germany, 1987.

  41. Kojima, M.,Strongly Stable Stationary Solutions in Nonlinear Programs, Analysis and Computation of Fixed Points, Edited by S. M. Robinson, Academic Press, New York, New York, pp. 93–138, 1980.

    Google Scholar 

  42. Kojima, M., andHirabayashi, R.,Continuous Deformations of Nonlinear Programs, Mathematical Programming Study, Vol. 21, pp. 150–198, 1984.

    Google Scholar 

  43. Abadie, J.,Generalized Reduced Gradient and Global Newton Methods, Optimization and Related Fields, Edited by R. Conti, E. Di Giorgi, and F. Giannessi, Lecture Notes in Mathematics, Springer-Verlag, Berlin, Germany, Vol. 1190, pp. 1–20, 1986.

    Google Scholar 

  44. Kleinmichel, H., andSchönefeld, K.,Newton-Type Methods for Nonlinearly Constrained Programs, Proceedings of the 20th Jahrestagung “Mathematische Optimierung,” Humboldt-Universität zu Berlin, Seminarberichte, pp. 53–57, 1988.

  45. Schönefeld, K.,A Superlinearly and Globally Convergent Optimization Method Based on Exact Penalties and Newton-Type Methods, Preprints 07-24-87 and 07-25-87, Technische Universität Dresden, 1987.

  46. Polak, E., andTits, A. L.,On Globally Stabilized Quasi-Newton Methods for Inequality Constrained Optimization Problems, Proceedings of the 10th IFIP Conference on System Modelling and Optimization, Lecture Notes in Control and Information Science, Springer-Verlag, Berlin, Germany, Vol. 38, pp. 539–547, 1982.

    Google Scholar 

  47. Ishutkin, V. S., andKleinmichel, H.,Verfahren der Zulässigen Richtungen unter Benutzung Reduzierter Gradienten für Nichtlineare Optimierungsprobleme, Optimization, Vol. 16, pp. 373–390, 1985.

    Google Scholar 

  48. Schönefeld, K.,A Note on a Globalization of Wilson-Type Optimization Methods, Computing, Vol. 37, pp. 171–178, 1986.

    Google Scholar 

  49. Psenicnyi, B. N., andDanilin, J. M.,Numerische Methoden für Extremalaufgaben, Deutscher Verlag der Wissenschaften, Berlin, Germany, 1982.

    Google Scholar 

  50. Grossmann, C., andKleinmichel, H.,Verfahren der Nichtlinearen Optimierung, B. G. Teubner Verlagsgesellschaft, Leipzig, Germany, 1976.

    Google Scholar 

  51. Mangasarian, O. L.,Nonlinear Programming, McGraw-Hill, New York, New York, 1969.

    Google Scholar 

  52. Richter, C.,Optimierungsverfahren und BASIC-Programme, Akademie-Verlag, Berlin, Germany, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by O. L. Mangasarian

The authors thank the anonymous referees for their useful suggestions.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kleinmichel, H., Richter, C. & Schönefeld, K. On a class of hybrid methods for smooth constrained optimization. J Optim Theory Appl 73, 465–499 (1992). https://doi.org/10.1007/BF00940052

Download citation

  • Issue Date:

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

Key Words

Navigation