Unconstrained Optimization
Unconstrained Optimization is a branch of mathematical optimization that studies the minimization or maximization of an objective function over a domain of decision variables without any explicit constraints restricting those variables.
1.3K
Publications
114.7K
Citations
2K
Authors
874
Institutions
Publications per year
2017–2026
315
1.3K
Function minimization by conjugate gradients
R. Fletcher · The Computer Journal · 1964 · 4.9K citations · Full text
1–5 of 1.3K
2K
26
h-index
National Institute for Research and Development in Informatics - ICI Bucharest, Romania
31 publications · 2.1K citations
25
h-index
16
h-index
15
h-index
15
h-index
1–5 of 2K
874
National Institute for Research and Development in Informatics - ICI Bucharest
Bucharest, Romania
23 h-index
26 publications
1.5K citations

Chinese Academy of Sciences
Beijing, China
20 h-index
43 publications
3.5K citations
Guangxi University
Nanning, China
19 h-index
79 publications
3.3K citations

University of Namur
Namur, Belgium
18 h-index
27 publications
2.4K citations

Sapienza University of Rome
Rome, Italy
15 h-index
26 publications
1.1K citations

Xidian University
Xi'an, China
14 h-index
38 publications
926 citations
Academy of Mathematics and Systems Science
Beijing, China
14 h-index
25 publications
2.3K citations
King Mongkut's University of Technology Thonburi
Bangkok, Thailand
14 h-index
38 publications
1.1K citations
1–8 of 874
87 publications · 21.1K citations
49
h-index
56 publications · 3.5K citations
30
h-index
41 publications · 5K citations
29
h-index
64 publications · 2.2K citations
26
h-index
38 publications · 1.5K citations
25
h-index
1–5