Using truncated conjugate gradient method in trust-region method with two subproblems and backtracking line search (Q5962397)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Using truncated conjugate gradient method in trust-region method with two subproblems and backtracking line search |
scientific article; zbMATH DE number 5789941
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using truncated conjugate gradient method in trust-region method with two subproblems and backtracking line search |
scientific article; zbMATH DE number 5789941 |
Statements
Using truncated conjugate gradient method in trust-region method with two subproblems and backtracking line search (English)
0 references
22 September 2010
0 references
The authors propose a trust-region method with two subproblems and backtracking line search for solving unconstrained optimization problems of the following form \(\min_{x\in\mathbb{R}^n}\,f(x)\). At every iteration, the authors use the truncated conjugate gradient method or ist variation to solve one of the two subproblems approximately. The authors show that the given method has the same convergence properties as the traditional trust-region method. Numerical results are given.
0 references
truncated conjugate gradient
0 references
trust-region
0 references
two subproblems
0 references
backtracking
0 references
convergence
0 references