Pages that link to "Item:Q354989"
From MaRDI portal
The following pages link to A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems (Q354989):
Displaying 13 items.
- Maximum likelihood gradient-based iterative estimation algorithm for a class of input nonlinear controlled autoregressive ARMA systems (Q493928) (← links)
- A modified hybrid conjugate gradient method for unconstrained optimization (Q2034936) (← links)
- Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization (Q2073942) (← links)
- Real-time pricing method for smart grid based on social welfare maximization model (Q2097501) (← links)
- An efficient conjugate gradient-based algorithm for unconstrained optimization and its projection extension to large-scale constrained nonlinear equations with applications in signal recovery and image denoising problems (Q2104056) (← links)
- Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors (Q2163582) (← links)
- A novel method of dynamic force identification and its application (Q2298083) (← links)
- A hybrid conjugate gradient method with descent property for unconstrained optimization (Q2337555) (← links)
- Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization (Q2345746) (← links)
- A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition (Q2346398) (← links)
- A New Formula on the Conjugate Gradient Method for Removing Impulse Noise Images (Q5883397) (← links)
- A truncated three-term conjugate gradient method with complexity guarantees with applications to nonconvex regression problem (Q6086842) (← links)
- A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems (Q6099495) (← links)