A convergent secant method for constrained optimization (Q1335568)
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: A convergent secant method for constrained optimization |
scientific article; zbMATH DE number 650936
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A convergent secant method for constrained optimization |
scientific article; zbMATH DE number 650936 |
Statements
A convergent secant method for constrained optimization (English)
0 references
16 October 1994
0 references
The authors combine a secant method with a trust region strategy so that the resulting algorithm not only has a local two-step superlinear rate, but also globally converges to Karush-Kuhn-Tucker points. The condition for proving these convergence properties is weaker than that of some trust region methods which use reduced Hessian as a tool. A minor revision of this algorithm is shown to possess a one-step superlinear rate.
0 references
constrained optimization
0 references
projective matrix
0 references
secant method
0 references
algorithm
0 references
convergence
0 references
trust region methods
0 references
0 references
