A class of nonmonotone trust region algorithms for constrained optimizations (Q1906603): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Ji-ye Han / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Joseph Frédéric Bonnans / rank | |||
Normal rank |
Revision as of 11:59, 14 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A class of nonmonotone trust region algorithms for constrained optimizations |
scientific article |
Statements
A class of nonmonotone trust region algorithms for constrained optimizations (English)
0 references
27 February 1997
0 references
The authors consider the problem of minimizing a smooth function \(f\) over a closed convex set \(\Omega\). They state a trust region algorithm that includes a variant of the nonmonotone line search idea. It is stated without proof that under reasonable assumptions, at least one limit-point of the sequence generated by the algorithm satisfies the first-order optimality system.
0 references
smooth function
0 references
trust region algorithm
0 references
nonmonotone line search
0 references