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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:


    Publication date :

    1986-01-01


    Size :

    7 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    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