Pages that link to "Item:Q5317554"

The following pages link to A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search (Q5317554):

Displaying 50 items.

• A note on the spectral gradient projection method for nonlinear monotone equations with applications (Q2178576) (← links)
• Further comment on another hybrid conjugate gradient algorithm for unconstrained optimization by Andrei (Q2181673) (← links)
• A globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization (Q2184373) (← links)
• Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions (Q2189404) (← links)
• A class of accelerated conjugate-gradient-like methods based on a modified secant equation (Q2190281) (← links)
• New conjugate gradient algorithms based on self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method (Q2190791) (← links)
• A double parameter self-scaling memoryless BFGS method for unconstrained optimization (Q2190850) (← 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)
• A Barzilai-Borwein gradient projection method for sparse signal and blurred image restoration (Q2198630) (← links)
• A modified nonlinear Polak-Ribière-Polyak conjugate gradient method with sufficient descent property (Q2201566) (← links)
• A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization (Q2204182) (← links)
• Global convergence via descent modified three-term conjugate gradient projection algorithm with applications to signal recovery (Q2211072) (← links)
• A derivative-free Liu-Storey method for solving large-scale nonlinear systems of equations (Q2214799) (← links)
• A survey of gradient methods for solving nonlinear optimization (Q2220680) (← links)
• Diagonal quasi-Newton methods via least change updating principle with weighted Frobenius norm (Q2225525) (← links)
• A novel value for the parameter in the Dai-Liao-type conjugate gradient method (Q2228067) (← links)
• A class of accelerated subspace minimization conjugate gradient methods (Q2231338) (← links)
• PRP-like algorithm for monotone operator equations (Q2231600) (← links)
• A second-order gradient method for convex minimization (Q2236579) (← links)
• An adaptive three-term conjugate gradient method with sufficient descent condition and conjugacy condition (Q2240113) (← links)
• An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction (Q2244998) (← links)
• A minimum action method for small random perturbations of two-dimensional parallel shear flows (Q2249365) (← links)
• A practical PR+ conjugate gradient method only using gradient (Q2250230) (← links)
• A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs (Q2252688) (← links)
• A nonmonotone trust region method based on simple quadratic models (Q2253065) (← links)
• A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing (Q2257217) (← links)
• A new nonlinear conjugate gradient method with guaranteed global convergence (Q2263078) (← links)
• Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization (Q2267641) (← links)
• Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search (Q2290291) (← links)
• Two modified DY conjugate gradient methods for unconstrained optimization problems (Q2293925) (← links)
• Optimization of dynamic mechanical response of a composite plate using multi-field coupling with thermal constraints (Q2295308) (← links)
• An efficient Dai-Liao type conjugate gradient method by reformulating the CG parameter in the search direction equation (Q2297152) (← links)
• Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization (Q2299208) (← links)
• An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization (Q2301132) (← links)
• Some three-term conjugate gradient methods with the new direction structure (Q2301307) (← links)
• A class of globally convergent three-term Dai-Liao conjugate gradient methods (Q2301403) (← links)
• A conjugate gradient algorithm and its applications in image restoration (Q2301430) (← links)
• A smoothing iterative method for the finite minimax problem (Q2306388) (← links)
• An efficient conjugate gradient trust-region approach for systems of nonlinear equation (Q2313481) (← links)
• The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions (Q2315883) (← links)
• A modified spectral conjugate gradient method with global convergence (Q2317848) (← links)
• A subspace minimization conjugate gradient method based on conic model for unconstrained optimization (Q2322338) (← links)
• A new conjugate gradient method with an efficient memory structure (Q2322448) (← links)
• Scaled nonlinear conjugate gradient methods for nonlinear least squares problems (Q2322819) (← links)
• A derivative-free iterative method for nonlinear monotone equations with convex constraints (Q2322831) (← links)
• An optimal parameter choice for the Dai-Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix (Q2336064) (← links)
• A hybrid conjugate gradient method with descent property for unconstrained optimization (Q2337555) (← links)
• A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method (Q2338474) (← links)
• A nonmonotone hybrid conjugate gradient method for unconstrained optimization (Q2340982) (← links)