Pages that link to "Item:Q803046"
From MaRDI portal
The following pages link to On the convergence property of the DFP algorithm (Q803046):
Displaying 18 items.
- A new family of globally convergent conjugate gradient methods (Q333105) (← links)
- A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties (Q415335) (← links)
- The convergence of Broyden algorithms for LC gradient function (Q1582577) (← links)
- On the convergence of the DFP algorithm for unconstrained optimization when there are only two variables (Q1591483) (← links)
- A class of one parameter conjugate gradient methods (Q1664259) (← links)
- Convergence property of a class of variable metric methods. (Q1764533) (← links)
- The revised DFP algorithm without exact line search (Q1811670) (← links)
- Convergence of DFP algorithm (Q1908612) (← links)
- Further insight into the convergence of the Fletcher-Reeves method (Q1974184) (← links)
- A regularized limited memory BFGS method for nonconvex unconstrained minimization (Q2248965) (← links)
- A CLASS OF DFP ALGORITHMS WITH REVISED SEARCH DIRECTION (Q3148358) (← links)
- (Q3365124) (← links)
- (Q4254734) (← links)
- A new two-parameter family of nonlinear conjugate gradient methods (Q5248216) (← links)
- (Q5287741) (← links)
- On the Local and Superlinear Convergence of a Parameterized DFP Method (Q5409730) (← links)
- Superlinear convergence of the DFP algorithm without exact line search (Q5949537) (← links)
- Convergence of the DFP algorithm without exact line search (Q5959907) (← links)
