Global Optimization Of Quadratic Programs

Global Optimization of Quadratic Programs is a mathematical optimization framework that belongs to the class of deterministic methods for solving non-convex quadratic programming problems, distinguished by its focus on identifying globally optimal solutions rather than local optima through rigorous bounding, branching, or reformulation techniques.

111

Publications

5K

Citations

211

Authors

139

Institutions

Publications per year

2017–2026

18

Authors

211

  1. PM
    Pãnos M. Pardalos

    University of Florida, United States

    9 publications · 738 citations

    9

    h-index

  2. VJ
    V. Jeyakumar

    UNSW Sydney, Australia

    6 publications · 262 citations

    6

    h-index

  3. HA
    Hoai An Le Thi

    Institut National des Sciences Appliquées Rouen Normandie, France

    5 publications · 254 citations

    5

    h-index

  4. JB
    J. B. Rosen

    University of Minnesota, United States

    5 publications · 333 citations

    5

    h-index

  5. IM
    Immanuel M. Bomze

    University of Vienna, Austria

    4 publications · 87 citations

    4

    h-index

1–5 of 211

Venues

  1. Journal of Global Optimization

    8 publications · 244 citations

    8

    h-index

  2. SIAM Journal on Optimization

    8 publications · 482 citations

    8

    h-index

  3. Mathematical Programming

    8 publications · 490 citations

    8

    h-index

  4. Optimization

    6 publications · 201 citations

    6

    h-index

  5. 4

    h-index

1–5