Pages that link to "Item:Q3004981"
From MaRDI portal
The following pages link to A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization (Q3004981):
Displayed 50 items.
- On three-term conjugate gradient algorithms for unconstrained optimization (Q120733) (← links)
- A new three-term conjugate gradient algorithm for unconstrained optimization (Q120735) (← links)
- Comment on ``A new three-term conjugate gradient method for unconstrained problem'' (Q285045) (← links)
- A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints (Q295355) (← links)
- Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization (Q438775) (← links)
- Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization (Q442712) (← links)
- An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization (Q457047) (← links)
- A nonmonotone hybrid method of conjugate gradient and Lanczos-type for solving nonlinear systems (Q489124) (← links)
- Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence (Q499680) (← links)
- New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction (Q668710) (← links)
- On the solution of the eigenvalue assignment problem for discrete-time systems (Q670447) (← links)
- Some three-term conjugate gradient methods with the inexact line search condition (Q723556) (← links)
- A nonmonotone supermemory gradient algorithm for unconstrained optimization (Q741395) (← links)
- A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations (Q824565) (← links)
- An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition (Q1626534) (← links)
- A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence (Q1722876) (← links)
- Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search (Q1757395) (← links)
- Conjugate gradient methods using value of objective function for unconstrained optimization (Q1758034) (← links)
- A scaled three-term conjugate gradient method for large-scale unconstrained optimization problem (Q2009756) (← links)
- A spectral three-term Hestenes-Stiefel conjugate gradient method (Q2040607) (← links)
- Two descent Dai-Yuan conjugate gradient methods for systems of monotone nonlinear equations (Q2063152) (← links)
- Descent three-term DY-type conjugate gradient methods for constrained monotone equations with application (Q2065023) (← links)
- A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration (Q2068018) (← links)
- A three-term conjugate gradient method with accelerated subspace quadratic optimization (Q2089194) (← links)
- Adaptive three-term family of conjugate residual methods for system of monotone nonlinear equations (Q2107668) (← links)
- A new family of hybrid three-term conjugate gradient methods with applications in image restoration (Q2163451) (← links)
- A modified nonlinear Polak-Ribière-Polyak conjugate gradient method with sufficient descent property (Q2201566) (← links)
- Global convergence via descent modified three-term conjugate gradient projection algorithm with applications to signal recovery (Q2211072) (← links)
- PRP-like algorithm for monotone operator equations (Q2231600) (← links)
- An adaptive three-term conjugate gradient method with sufficient descent condition and conjugacy condition (Q2240113) (← links)
- A practical PR+ conjugate gradient method only using gradient (Q2250230) (← links)
- Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization (Q2299208) (← links)
- Some three-term conjugate gradient methods with the new direction structure (Q2301307) (← links)
- A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition (Q2346398) (← links)
- A new modified three-term conjugate gradient method with sufficient descent property and its global convergence (Q2421741) (← links)
- A smoothing conjugate gradient method for solving systems of nonsmooth equations (Q2453242) (← links)
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping (Q2515036) (← links)
- A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization (Q2515066) (← links)
- A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition (Q2515111) (← links)
- A scaled conjugate gradient method with moving asymptotes for unconstrained optimization problems (Q2628168) (← links)
- A memory gradient method based on the nonmonotone technique (Q2628189) (← links)
- A hybrid Riemannian conjugate gradient method for nonconvex optimization problems (Q2700130) (← links)
- A class of three-term derivative-free methods for large-scale nonlinear monotone system of equations and applications to image restoration problems (Q2700161) (← links)
- A sufficient descent three-term conjugate gradient method via symmetric rank-one update for large-scale optimization (Q2790872) (← links)
- Optimization for Inconsistent Split Feasibility Problems (Q2805985) (← links)
- New conjugate gradient-like methods for unconstrained optimization (Q2926084) (← links)
- Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition (Q2969958) (← links)
- A Modified Nonmonotone Hestenes–Stiefel Type Conjugate Gradient Methods for Large-Scale Unconstrained Problems (Q2987782) (← links)
- (Q3384266) (← links)
- An efficient adaptive three-term extension of the Hestenes–Stiefel conjugate gradient method (Q4631766) (← links)