Abstract In this paper we define two classes of algorithms for the solution of constrained problems. The first class is based on a continuously differentiable exact penalty function, with the additional inclusion of a barrier term. The second class is based on a similar modification performed on a continuously differentiable exact augmented Lagrangian function. In connection with these functions, an automatic adjustment rule for the penalty parameter is described, which ensures global convergence, and Newton-type schemes are proposed which ensure an ultimate superlinear convergence rate.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Globally convergent exact penalty algorithms for constrained optimization


    Beteiligte:
    Pillo, G. (Autor:in) / Grippo, L. (Autor:in) / Lucidi, S. (Autor:in)


    Erscheinungsdatum :

    1986-01-01


    Format / Umfang :

    10 pages





    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Globally Convergent Autocalibration

    Benedetti, A. / Busti, A. / Farenzena, M. et al. | British Library Conference Proceedings | 2003


    Globally convergent autocalibration

    Benedetti, / Busti, / Farenzena, et al. | IEEE | 2003