Pages that link to "Item:Q4888264"
From MaRDI portal
The following pages link to Global convergece of the bfgs algorithm with nonmonotone linesearch<sup>∗</sup><sup>∗</sup>this work is supported by national natural science foundation$ef: (Q4888264):
Displayed 16 items.
- Modified nonmonotone Armijo line search for descent method (Q535246) (← links)
- Nonmonotone adaptive trust region method (Q621656) (← links)
- Nonmonotone second-order Wolfe's line search method for unconstrained optimization problems (Q623198) (← links)
- Global convergence of nonmonotone descent methods for unconstrained optimization problems (Q697549) (← links)
- A class of nonmonotone conjugate gradient methods for nonconvex functions (Q698383) (← links)
- Convergence analysis of a modified BFGS method on convex minimizations (Q711385) (← links)
- The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions (Q928232) (← links)
- The global and superlinear convergence of a new nonmonotone MBFGS algorithm on convex objective functions (Q939545) (← links)
- Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization (Q953368) (← links)
- A globally convergent BFGS method with nonmonotone line search for non-convex minimization (Q1026434) (← links)
- A class of nonmonotone conjugate gradient methods for unconstrained optimization (Q1293956) (← links)
- Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization (Q1411546) (← links)
- Global convergence of the Broyden's class of quasi-Newton methods with nonmonotone linesearch (Q1873573) (← links)
- Nonmonotone trust region method for solving optimization problems (Q1886565) (← links)
- A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values (Q2475129) (← links)
- A new nonmonotone line search technique for unconstrained optimization (Q5900212) (← links)