A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
From MaRDI portal
Recommendations
- A three-term conjugate gradient method with sufficient descent property
- A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
- A new three-term conjugate gradient method with descent direction for unconstrained optimization
- Some descent three-term conjugate gradient methods and their global convergence
- Some three-term conjugate gradient methods for solving unconstrained optimization problems
Cited in
(only showing first 100 items - show all)- On three-term conjugate gradient algorithms for unconstrained optimization
- A new three-term conjugate gradient algorithm for unconstrained optimization
- An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition
- An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix
- Two modified three-term type conjugate gradient methods and their global convergence for unconstrained optimization
- A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence
- Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search
- Conjugate gradient methods using value of objective function for unconstrained optimization
- A scaled three-term conjugate gradient method for large-scale unconstrained optimization problem
- A spectral three-term Hestenes-Stiefel conjugate gradient method
- Two descent Dai-Yuan conjugate gradient methods for systems of monotone nonlinear equations
- Descent three-term DY-type conjugate gradient methods for constrained monotone equations with application
- A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration
- A three-term conjugate gradient method with accelerated subspace quadratic optimization
- Adaptive three-term family of conjugate residual methods for system of monotone nonlinear equations
- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
- A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization
- A new family of hybrid three-term conjugate gradient methods with applications in image restoration
- A modified nonlinear Polak-Ribière-Polyak conjugate gradient method with sufficient descent property
- Global convergence via descent modified three-term conjugate gradient projection algorithm with applications to signal recovery
- PRP-like algorithm for monotone operator equations
- An adaptive three-term conjugate gradient method with sufficient descent condition and conjugacy condition
- A practical PR+ conjugate gradient method only using gradient
- Modified three-term conjugate gradient method and its applications
- Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization
- Some three-term conjugate gradient methods with the new direction structure
- A class of globally convergent three-term Dai-Liao conjugate gradient methods
- A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition
- A scaled three-term conjugate gradient method for unconstrained optimization
- A new modified three-term conjugate gradient method with sufficient descent property and its global convergence
- A smoothing conjugate gradient method for solving systems of nonsmooth equations
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
- A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
- A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition
- A scaled conjugate gradient method with moving asymptotes for unconstrained optimization problems
- A memory gradient method based on the nonmonotone technique
- A hybrid Riemannian conjugate gradient method for nonconvex optimization problems
- A class of three-term derivative-free methods for large-scale nonlinear monotone system of equations and applications to image restoration problems
- Three-term preconditioned conjugate gradient method and trust region subproblem
- A sufficient descent three-term conjugate gradient method via symmetric rank-one update for large-scale optimization
- Optimization for Inconsistent Split Feasibility Problems
- A three-term method for unconstrained optimization
- A modified THREECG conjugate gradient method with sufficient descent condition and adaptive conjugacy condition
- A three-term conjugate gradient method with nonmonotone line search for unconstrained optimization
- Comment on ``A new three-term conjugate gradient method for unconstrained problem
- New conjugate gradient-like methods for unconstrained optimization
- New three-term conjugate gradient method with guaranteed global convergence
- A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints
- Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition
- A modified nonmonotone hestenes-Stiefel type conjugate gradient methods for large-scale unconstrained problems
- Three-term conjugate gradient methods based on secant conditions for unconstrained optimization
- Spectral three-term conjugate descent method for solving nonlinear monotone equations with convex constraints
- An extended three-term conjugate gradient method with sufficient descent property
- scientific article; zbMATH DE number 1371602 (Why is no real title available?)
- Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
- Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization
- An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization
- Descent three-term conjugate gradient methods based on secant conditions for unconstrained optimization
- An efficient adaptive three-term extension of the Hestenes-Stiefel conjugate gradient method
- Three-term modified LS conjugate gradient method with its global convergence
- Two modified three-term conjugate gradient methods with sufficient descent property
- A nonmonotone hybrid method of conjugate gradient and Lanczos-type for solving nonlinear systems
- Global convergence of two kinds of three-term conjugate gradient methods without line search
- A forced descent three-term conjugate gradient method
- A New Adaptive Subspace Minimization Three-Term Conjugate Gradient Algorithm for Unconstrained Optimization
- Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence
- A spectral three-term conjugate gradient method with sufficient descent property
- A new three-term conjugate gradient method with descent direction for unconstrained optimization
- Global convergence of a new sufficient descent spectral three-term conjugate gradient class for large-scale optimization
- A descent family of three-term conjugate gradient methods with global convergence for general functions
- An efficient hybrid conjugate gradient method with sufficient descent property for unconstrained optimization
- Some three-term conjugate gradient methods for solving unconstrained optimization problems
- A three-term conjugate gradient method with sufficient descent property
- Some new three-term Hestenes-Stiefel conjugate gradient methods with affine combination
- A modified Hestenes-Stiefel conjugate gradient method with an optimal property
- Some descent three-term conjugate gradient methods and their global convergence
- The convergence rate of a three-term HS method with restart strategy for unconstrained optimization problems
- On the convergence properties of the unmodified PRP method with a non-descent line search
- A modified conjugate gradient method based on a modified secant equation
- A one-parameter class of three-term conjugate gradient methods with an adaptive parameter choice
- A truncated three-term conjugate gradient method with complexity guarantees with applications to nonconvex regression problem
- A modified four-term extension of the Dai-Liao conjugate gradient method
- A three-term conjugate gradient algorithm with restart procedure to solve image restoration problems
- A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems
- A three-term conjugate gradient method with a random parameter for large-scale unconstrained optimization and its application in regression model
- A class of new three-term descent conjugate gradient algorithms for large-scale unconstrained optimization and applications to image restoration problems
- Memoryless quasi-Newton methods based on the spectral-scaling Broyden family for Riemannian optimization
- Solving Unconstrained Optimization Problems with Some Three-term Conjugate Gradient Methods
- A Five-Parameter Class of Derivative-Free Spectral Conjugate Gradient Methods for Systems of Large-Scale Nonlinear Monotone Equations
- Global convergence of three-term conjugate gradient methods on general functions under a new inexact line search strategy
- A new hybrid CGPM-based algorithm for constrained nonlinear monotone equations with applications
- A conjugate gradient projection method with restart procedure for solving constraint equations and image restorations
- A family of spectral conjugate gradient methods with strong convergence and its applications in image restoration and machine learning
- A new accelerated algorithm for solving variational inequalities over the solution of multiple set split common fixed point problem
- A new approximate descent derivative-free algorithm for large-scale nonlinear symmetric equations
- A new structured spectral conjugate gradient method for nonlinear least squares problems
- Globally linearly convergent nonlinear conjugate gradients without Wolfe line search
- A family of limited memory three term conjugate gradient methods
- A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations
- New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction
This page was built for publication: A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3004981)
