Abstract A general algorithm for solving quadratic programming problems with an M-matrix as the Hessian and box constraints is presented. It constructs a sequence of points with monotonically increasing components. Its convergence is discussed. It is also shown that many existing algorithms (e.g. Pang's algorithm, Scarpini's algorithm) are the realisations of this general algorithm. An example of a new algorithm belonging to this class is presented.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Monotone sequences of feasible solutions for quadratic programming problems with M-matrices and box constraints


    Beteiligte:


    Erscheinungsdatum :

    1986-01-01


    Format / Umfang :

    7 pages





    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Well Solvable Cases of the Quadratic Assignment Problem with Monotone and Bimonotone Matrices

    Demidenko, V. M. / Finke, G. / Gordon, V. S. | British Library Online Contents | 2006



    OPTIMAL PROGRAMMING PROBLEMS WITH INEQUALITY CONSTRAINTS

    BRYSON, A. E. / DENHAM, W. F. / DREYFUS, S. E. | AIAA | 1963