Pages that link to "Item:Q2142552"
From MaRDI portal
The following pages link to Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing (Q2142552):
Displaying 16 items.
- A new smoothing modified three-term conjugate gradient method for \(l_1\)-norm minimization problem (Q824554) (← links)
- Two classes of spectral conjugate gradient methods for unconstrained optimizations (Q2103158) (← links)
- Two modified conjugate gradient methods for unconstrained optimization with applications in image restoration problems (Q2103178) (← 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)
- A new family of hybrid three-term conjugate gradient methods with applications in image restoration (Q2163451) (← links)
- A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations (Q6047884) (← links)
- Two families of hybrid conjugate gradient methods with restart procedures and their applications (Q6078424) (← links)
- A three-term conjugate gradient algorithm with restart procedure to solve image restoration problems (Q6098978) (← links)
- A hybrid BB-type method for solving large scale unconstrained optimization (Q6138335) (← links)
- Global convergence of three-term conjugate gradient methods on general functions under a new inexact line search strategy (Q6495538) (← links)
- An accelerated conjugate gradient method with adaptive two-parameter with applications in image restoration (Q6543751) (← links)
- A new hybrid CGPM-based algorithm for constrained nonlinear monotone equations with applications (Q6578247) (← links)
- A family of accelerated hybrid conjugate gradient method for unconstrained optimization and image restoration (Q6586095) (← links)
- Developing a new conjugate gradient algorithm with the benefit of some desirable properties of the Newton algorithm for unconstrained optimization (Q6615082) (← links)
- A convex combination of improved Fletcher-Reeves and Rivaie-Mustafa-Ismail-Leong conjugate gradient methods for unconstrained optimization problems and applications (Q6655474) (← links)
- An efficient modified conjugate gradient algorithm under Wolfe conditions with applications in compressive sensing (Q6664837) (← links)
