A globally convergent BFGS method with nonmonotone line search for non-convex minimization (Q1026434): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cam.2008.10.065 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2136317623 / rank | |||
Normal rank | |||
Revision as of 01:25, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A globally convergent BFGS method with nonmonotone line search for non-convex minimization |
scientific article |
Statements
A globally convergent BFGS method with nonmonotone line search for non-convex minimization (English)
0 references
25 June 2009
0 references
A modified nonmonotone BFGS (Broyden-Fletcher-Goldfarb-Shanno) method is developed for solving unconstrained optimization problems. In the proposed method, the function value at each iteration allows for an occasional increase. The method can converge to a local optimal point without a convex assumption on the objective functions. The global convergence is established under certain conditions. Some numerical experimental results are presented to compare its performance with the monotone BFGS method.
0 references
non-convex minimization
0 references
secant equation
0 references
BFGS method
0 references
nonmonotone line search
0 references
global convergence
0 references
numerical examples
0 references
Broyden-Fletcher-Goldfarb-Shanno method
0 references
unconstrained optimization
0 references
