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
1.2K
Fast model-based estimation of ancestry in unrelated individuals
David H. Alexander, John Novembre, Kenneth Lange · Genome Research · 2009 · 10.6K citations · Full text
Sequential Quadratic Programming
Paul T. Boggs, Jon W. Tolle · Acta Numerica · 1995 · 1.8K citations
1–5 of 1.2K
2.9K
24
h-index
18
h-index
16
h-index
11
h-index
11
h-index
1–5 of 2.9K
956
COMSATS University Islamabad
Islamabad, Pakistan
21 h-index
44 publications
2.2K citations

Hazara University
Baffa, Pakistan
18 h-index
34 publications
1.7K citations
University of Michigan
Ann Arbor, United States
15 h-index
42 publications
1.8K citations
National Yunlin University of Science and Technology
Douliu, Taiwan
14 h-index
18 publications
752 citations

Harbin Institute of Technology
Harbin, China
13 h-index
46 publications
1.1K citations
Stanford University
Stanford, United States
13 h-index
28 publications
4.6K citations
KU Leuven
Leuven, Belgium
12 h-index
28 publications
720 citations

Shanghai Jiao Tong University
Shanghai, China
12 h-index
30 publications
745 citations
1–8 of 956
53 publications · 7.2K citations
37
h-index
20 publications · 2.4K citations
20
h-index
19 publications · 660 citations
18
h-index
12 publications · 455 citations
12
h-index
14 publications · 465 citations
12
h-index
1–5