A robust trust region method for general constrained optimization (Q706373)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2132317
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A robust trust region method for general constrained optimization |
scientific article; zbMATH DE number 2132317 |
Statements
A robust trust region method for general constrained optimization (English)
0 references
8 February 2005
0 references
A new trust region method is presented for solving general constrained optimization problems, where the trial step is obtained by solving two quadratic programming problems. The author proves that the method is globally convergent without regularity assumptions. Numerical examples show the efficiency of the algorithm.
0 references
constrained optimization
0 references
global convergence
0 references
trust region method
0 references
0.8812152743339539
0 references
0.8670578002929688
0 references
0.8666955828666687
0 references
0.8619565367698669
0 references
