Pages that link to "Item:Q1366426"

The following pages link to A globally convergent version of the Polak-Ribière conjugate gradient method (Q1366426):

Displaying 44 items.

• A class of line search-type methods for nonsmooth convex regularized minimization (Q2098339) (← links)
• Globally convergent diagonal Polak-Ribière-Polyak like algorithm for nonlinear equations (Q2098790) (← links)
• The modified PRP conjugate gradient algorithm under a non-descent line search and its application in the Muskingum model and image restoration problems (Q2099954) (← links)
• A modified HZ conjugate gradient algorithm without gradient Lipschitz continuous condition for non convex functions (Q2103175) (← links)
• A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection (Q2133373) (← links)
• A hybrid conjugate gradient based approach for solving unconstrained optimization and motion control problems (Q2146720) (← links)
• Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization (Q2167421) (← links)
• A derivative-free conjugate residual method using secant condition for general large-scale nonlinear equations (Q2173330) (← links)
• Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions (Q2189404) (← links)
• On the extension of the Hager-Zhang conjugate gradient method for vector optimization (Q2191796) (← links)
• The projection technique for two open problems of unconstrained optimization problems (Q2194129) (← links)
• Modified three-term Liu-Storey conjugate gradient method for solving unconstrained optimization problems and image restoration problems (Q2209686) (← links)
• A practical PR+ conjugate gradient method only using gradient (Q2250230) (← links)
• A sufficient descent nonlinear conjugate gradient method for solving \(\mathcal{M} \)-tensor equations (Q2297154) (← links)
• The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems (Q2301414) (← links)
• The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions (Q2315883) (← links)
• A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method (Q2338474) (← links)
• Three modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property (Q2340983) (← links)
• The proof of the sufficient descent condition of the Wei-Yao-Liu conjugate gradient method under the strong Wolfe-Powell line search (Q2383633) (← links)
• Global convergence of a modified conjugate gradient method (Q2405656) (← links)
• Preconditioned nonlinear conjugate gradient methods based on a modified secant equation (Q2422866) (← links)
• A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions (Q2424224) (← links)
• Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search (Q2433993) (← links)
• Further studies on the Wei-Yao-Liu nonlinear conjugate gradient method (Q2451353) (← links)
• Convergence of supermemory gradient method (Q2454990) (← links)
• Memory gradient method with Goldstein line search (Q2469911) (← links)
• On memory gradient method with trust region for unconstrained optimization (Q2492798) (← links)
• Some sufficient descent conjugate gradient methods and their global convergence (Q2514055) (← links)
• A new family of conjugate gradient methods (Q2519734) (← links)
• Convergence of descent method without line search (Q2570691) (← links)
• A new super-memory gradient method with curve search rule (Q2571993) (← links)
• AADIS: an atomistic analyzer for dislocation character and distribution (Q2698758) (← links)
• A three-parameter family of nonlinear conjugate gradient methods (Q2719070) (← links)
• Global convergence of Polak-Ribière conjugate gradient method (Q2724941) (← links)
• Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems (Q3055065) (← links)
• A spectral KRMI conjugate gradient method under the strong-Wolfe line search (Q4989293) (← links)
• (Q5096719) (← links)
• A spectral conjugate gradient method for nonlinear inverse problems (Q5240400) (← links)
• Convergence conditions, line search algorithms and trust region implementations for the Polak–Ribière conjugate gradient method (Q5312756) (← links)
• A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression (Q6114952) (← links)
• A hybrid conjugate gradient algorithm for nonconvex functions and its applications in image restoration problems (Q6151003) (← links)
• A hybrid HS-LS conjugate gradient algorithm for unconstrained optimization with applications in motion control and image recovery (Q6175200) (← links)
• Globally convergent conjugate gradient algorithms without the Lipschitz condition for nonconvex optimization (Q6175333) (← links)
• An adaptive projection BFGS method for nonconvex unconstrained optimization problems (Q6202792) (← links)