Convex Quadratic Programming

Convex Quadratic Programming is a type of mathematical optimization problem in which a convex quadratic function is minimized over a set of linear constraints, distinguishing it from non-convex variants by guaranteeing a globally optimal solution due to the convexity of the objective function and feasible region.

1K

Publications

75.9K

Citations

1.9K

Authors

725

Institutions

Publications per year

2017–2026

230

Variants

Convex Qp

Authors

1.9K

  1. HD
    Hoang Duong Tuan

    University of Technology Sydney, Australia

    16 publications · 947 citations

    14

    h-index

  2. JP
    Jong‐Shi Pang

    Johns Hopkins University, United States

    10 publications · 703 citations

    10

    h-index

  3. ZD
    Zdeněk Dostál

    VSB - Technical University of Ostrava, Czechia

    10 publications · 332 citations

    10

    h-index

  4. TT
    Tamás Terlaky

    Delft University of Technology, Netherlands

    11 publications · 402 citations

    10

    h-index

  5. DS
    Defeng Sun

    National University of Singapore, Singapore

    10 publications · 687 citations

    10

    h-index

1–5 of 1.9K

Venues

  1. Mathematical Programming

    82 publications · 7.2K citations

    45

    h-index

  2. SIAM Journal on Optimization

    70 publications · 5.4K citations

    35

    h-index

  3. IEEE Transactions on Automatic Control

    19 publications · 1.4K citations

    18

    h-index

  4. Journal of Optimization Theory and Applications

    28 publications · 1.6K citations

    18

    h-index

  5. Computational Optimization and Applications

    21 publications · 887 citations

    16

    h-index

1–5