Skip to main content
SpringerLink
Log in

A unified approach to nonlinear programming algorithms basing on sequential unconstrained minimizations

  • Mathematical Programming: Algorithms
  • Conference paper
  • First Online:
Optimization Techniques

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 23))

  • 182 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dolecki, S; Kurcyusz, S.: On Φ-convexity in extremal problems. Technical report, Institute of automatic control, Warszawa, 1976.

    Google Scholar 

  2. Everett, H.D.: Generalized Lagrange multiplier method for solving problem of optimum allocation of resources. Operations Res. 11(1963), 399–417.

    Google Scholar 

  3. Fiacco, A.V.; McCormick, G.P.: Nonlinear programming: sequential unconstrained minimization techniques. Wiley, New York, 1968.

    Google Scholar 

  4. Gol'stejn, E.G.; Tret'jakov, N.V.: Modificirovannye funkcii Lagranža. Ekon. Mat. Metody 10(1974)3, 568–591.

    Google Scholar 

  5. Großmann, Ch.: Rates of convergence in methods of exterior centers. Math.OF Statist., Ser. Optimization 9(1978)3, 373–388.

    Google Scholar 

  6. Großmann,Ch.: Common properties of nonlinear programming algorithms basing on sequential unconstrained minimizations. (to appear in Proc. 7th summer school on nonlinear analysis, Berlin 1979).

    Google Scholar 

  7. Großmann, Ch.; Kaplan, A.A.: Strafmethoden und modifizierte La — grangefunktionen in der nichtlinearen Optimierung. Teubner-Text, Leipzig, 1979.

    Google Scholar 

  8. Mangasarian, O.L.: Unconstrained Lagrangians in nonlinear programming. SIAM J. Control 13(1975)4, 772–791.

    Google Scholar 

  9. Neckermann, O.K.: Verallgemeinerte konjugierte Dualität und Penaltyverfahren. Dissertation, Würzburg, 1976.

    Google Scholar 

  10. Robinson, S.M.: Perturbed Kuhn-Tucker-points and rates of convergence for a class of nonlinear programming problems. Math. Programming 7(1974)1, 1–16.

    Google Scholar 

  11. Rockafellar, R.T.: Augmented Lagrange multiplier functions and duality in nonconvex programming. SIAM J. Control 12(1974)2, 268–285.

    Google Scholar 

  12. Roode, J.D.: Generalized Lagrange functions in mathematical programming. Dissertation, Rotterdam, 1968.

    Google Scholar 

  13. Seidler, K.-H.: Zur Dualisierung in der nichtlinearen Optimierung. Dissertation, TH Ilmenau, 1972.

    Google Scholar 

  14. Wierzbicki, A.P.; Kurcyusz, S.: Projection on a cone, penalty functionals and duality for problems with inequality constraints in Hilbert space. SIAM J. Control Optimization 15(1977), 25–56.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. TU Dresden, Sektion Mathematik, Mommsenstraße 13, DDR-8027, Dresden

    Ch. Großmann

Authors
  1. Ch. Großmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. Iracki K. Malanowski S. Walukiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag

About this paper

Cite this paper

Großmann, C. (1980). A unified approach to nonlinear programming algorithms basing on sequential unconstrained minimizations. In: Iracki, K., Malanowski, K., Walukiewicz, S. (eds) Optimization Techniques. Lecture Notes in Control and Information Sciences, vol 23. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0006588

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10081-2

  • Online ISBN: 978-3-540-38253-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation