Sequential Quadratic Programming

Sequential Quadratic Programming is a numerical optimization method that iteratively solves nonlinear programming problems by approximating the objective function with a quadratic model and the constraints with linearizations, thereby solving a sequence of quadratic programming subproblems to converge to a local optimum.

1.2K

Publications

71.1K

Citations

2.9K

Authors

956

Institutions

Publications per year

2017–2026

331

Authors

2.9K

  1. MA
    Muhammad Asif Zahoor Raja

    COMSATS University Islamabad, Pakistan

    30 publications · 1.5K citations

    24

    h-index

  2. ZS
    Zulqurnain Sabir

    Hazara University, Pakistan

    18 publications · 943 citations

    18

    h-index

  3. MD
    Moritz Diehl

    KU Leuven, Belgium

    17 publications · 732 citations

    16

    h-index

  4. PE
    Philip E. Gill

    University of California San Diego, United States

    11 publications · 6.1K citations

    11

    h-index

  5. WM
    Walter Murray

    Stanford University, United States

    12 publications · 5.5K citations

    11

    h-index

1–5 of 2.9K

Venues

  1. SIAM Journal on Optimization

    53 publications · 7.2K citations

    37

    h-index

  2. IEEE Transactions on Power Systems

    20 publications · 2.4K citations

    20

    h-index

  3. Engineering Optimization

    19 publications · 660 citations

    18

    h-index

  4. 12

    h-index

  5. Industrial & Engineering Chemistry Research

    14 publications · 465 citations

    12

    h-index

1–5