The following pages link to (Q5636694):
Displaying 26 items.
- Another three-term conjugate gradient method close to the memoryless BFGS for large-scale unconstrained optimization problems (Q821530) (← links)
- A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method (Q1634798) (← links)
- An efficient modified AZPRP conjugate gradient method for large-scale unconstrained optimization problem (Q2036061) (← links)
- A new descent spectral Polak-Ribière-Polyak method based on the memoryless BFGS update (Q2052328) (← links)
- A new accelerated conjugate gradient method for large-scale unconstrained optimization (Q2068094) (← links)
- Two classes of spectral conjugate gradient methods for unconstrained optimizations (Q2103158) (← links)
- An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction (Q2244998) (← links)
- A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions (Q2424224) (← links)
- Applying the Powell's Symmetrical Technique to Conjugate Gradient Methods with the Generalized Conjugacy Condition (Q2829590) (← links)
- Sufficient descent conjugate gradient methods for large-scale optimization problems (Q2885559) (← links)
- Constrained optimal control of switched systems based on modified BFGS algorithm and filled function method (Q2935389) (← links)
- New three-term conjugate gradient method with guaranteed global convergence (Q2935391) (← links)
- Packing identical spheres into a cylinder (Q3002688) (← links)
- A CLASS OF DFP ALGORITHMS WITH REVISED SEARCH DIRECTION (Q3148358) (← links)
- A nonlinear conjugate gradient method based on the MBFGS secant condition (Q3423590) (← links)
- Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization (Q3539795) (← links)
- (Q4133407) (← links)
- A NOTE ON THE CONVERGENCE OF THE DFP ALGORITHM ON QUADRATIC UNIFORMLY CONVEX FUNCTIONS (Q4548048) (← links)
- On a dual method for a specially structured linear programming problem with application to stochastic programming (Q4709734) (← links)
- Modified Hestenes-Steifel conjugate gradient coefficient for unconstrained optimization (Q5199047) (← links)
- An accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization (Q5200551) (← links)
- Descent Property and Global Convergence of a New Search Direction Method for Unconstrained Optimization (Q5251581) (← links)
- Global convergence of the DY conjugate gradient method with Armijo line search for unconstrained optimization problems (Q5436916) (← links)
- Some descent three-term conjugate gradient methods and their global convergence (Q5436928) (← links)
- A modified Polak–Ribi‘<i>e</i>re–Polyak descent method for unconstrained optimization (Q5746691) (← links)
- Hybrid conjugate gradient methods for unconstrained optimization (Q5758224) (← links)