Constrained Optimization
Constrained Optimization is a class of mathematical optimization problems in which an objective function is optimized with respect to decision variables that are required to satisfy a prescribed set of equality and/or inequality constraints.
17.9K
Publications
1.2M
Citations
24.2K
Authors
4.4K
Institutions
Publications per year
2017–2026
3.7K
Variants
Constrained Optimization Problems
17.9K
A Simplex Method for Function Minimization
J. A. Nelder, R. Mead · The Computer Journal · 1965 · 28.9K citations
A Limited Memory Algorithm for Bound Constrained Optimization
Richard H. Byrd, Peihuang Lu, Jorge Nocedal et al. · SIAM Journal on Scientific Computing · 1995 · 6.2K citations
1–5 of 17.9K
24.2K
35
h-index
32
h-index
31
h-index
30
h-index
30
h-index
1–5 of 24.2K
4.4K
Stanford University
Stanford, United States
66 h-index
301 publications
36.5K citations
Massachusetts Institute of Technology
Cambridge, United States
61 h-index
312 publications
26.7K citations

Centre National de la Recherche Scientifique
Paris, France
60 h-index
525 publications
30.5K citations
Carnegie Mellon University
Pittsburgh, United States
59 h-index
288 publications
23.6K citations
Georgia Institute of Technology
Atlanta, United States
55 h-index
303 publications
23.6K citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
53 h-index
193 publications
15.4K citations
National University of Singapore
Singapore, Singapore
53 h-index
253 publications
17.3K citations
University of California, Berkeley
Berkeley, United States
53 h-index
274 publications
19.5K citations
1–8 of 4.4K
621 publications · 56K citations
120
h-index
677 publications · 65.5K citations
111
h-index
236 publications · 22.9K citations
81
h-index
688 publications · 32.1K citations
79
h-index
390 publications · 25.5K citations
78
h-index
1–5