Pages that link to "Item:Q295480"
From MaRDI portal
The following pages link to A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems (Q295480):
Displaying 11 items.
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations (Q255074) (← links)
- A modified proximal gradient method for a family of nonsmooth convex optimization problems (Q1697903) (← links)
- A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization (Q1985287) (← links)
- A modified PRP-type conjugate gradient projection algorithm for solving large-scale monotone nonlinear equations with convex constraint (Q2075960) (← links)
- A conjugate gradient sampling method for nonsmooth optimization (Q2174178) (← links)
- Fully complex conjugate gradient-based neural networks using Wirtinger calculus framework: deterministic convergence and its application (Q2183663) (← links)
- A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method (Q2338474) (← links)
- A spectral-type conjugate gradient method for nonsmooth convex minimization (Q2793060) (← links)
- Proximal algorithm meets a conjugate descent (Q2826257) (← links)
- A Modified PRP Conjugate Gradient Algorithm with Trust Region for Optimization Problems (Q3016307) (← links)
- A modified PRP conjugate gradient method for unconstrained optimization and nonlinear equations (Q6593442) (← links)