Trust-Region Quadratic Programming is a constrained optimization method that belongs to the class of iterative numerical algorithms for solving nonlinear programming problems, distinguished by its use of a quadratic model of the objective function within a dynamically adjusted trust region to ensure convergence and stability.
136
Publications
16.3K
Citations
247
Authors
123
Institutions
Publications per year
2017–2026
17
Parents
Publications
136
Jorge J. Morè, D. C. Sorensen · SIAM Journal on Scientific and Statistical Computing · 1983 · 1.4K citations · Full text
1–5 of 136
Authors
247
- HW
7
h-index
- NI
6
h-index
- SA
5
h-index
- PL
5
h-index
- JN
5
h-index
1–5 of 247
Institutions
123
University of Waterloo
Waterloo, Canada
8 h-index
12 publications
612 citations
Universidade Estadual de Campinas (UNICAMP)
Campinas, Brazil
8 h-index
14 publications
695 citations
Chinese Academy of Sciences
Beijing, China
7 h-index
9 publications
547 citations
Carnegie Mellon University
Pittsburgh, United States
7 h-index
11 publications
699 citations
Rice University
Houston, United States
6 h-index
9 publications
2.9K citations
Rutherford Appleton Laboratory
Didcot, United Kingdom
6 h-index
7 publications
866 citations
Academy of Mathematics and Systems Science
Beijing, China
5 h-index
5 publications
454 citations
Massachusetts Institute of Technology
Cambridge, United States
4 h-index
7 publications
723 citations
1–8 of 123
Venues
- SIAM Journal on Optimization
32 publications · 7.5K citations
26
h-index
- Mathematical Programming
19 publications · 1.6K citations
17
h-index
- Optimization methods & software
10 publications · 651 citations
10
h-index
- Computational Optimization and Applications
5 publications · 188 citations
5
h-index
- Journal of Optimization Theory and Applications
3 publications · 80 citations
3
h-index
1–5