Abstract To construct robust and efficient optimization methods it is advantageous to combine a globally convergent algorithm and a locally superlinearly convergent one. Many of the proposed hybrid methods can be regarded as realizations of a general principle. For this class of methods (examples included) a general convergence result is presented.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Hybrid methods in nonlinear programming


    Beteiligte:
    Richter, C. (Autor:in) / Schönefeld, K. (Autor:in)


    Erscheinungsdatum :

    01.01.1986


    Format / Umfang :

    6 pages





    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Unconstrained methods in nonlinear programming

    Mangasarian, O. L. | TIBKAT | 1976


    Nonlinear Programming Methods for Worst-Case Pilot Input Determination

    Skoogh, Daniel / Berefelt, Fredrik | Springer Verlag | 2012




    Introduction to Nonlinear Programming

    Böhme, Thomas J. / Frank, Benjamin | Springer Verlag | 2017