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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Hybrid methods in nonlinear programming


    Contributors:


    Publication date :

    1986-01-01


    Size :

    6 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    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




    Hybrid Methods for Nonlinear Least Squares

    Ma, X. / Xu, C. | British Library Online Contents | 1997