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 projection method for convex constrained monotone nonlinear equations with applications (Q2006525) (← links)
• A modified nonlinear conjugate gradient method with the Armijo line search and its application (Q2007123) (← links)
• A scaled three-term conjugate gradient method for large-scale unconstrained optimization problem (Q2009756) (← links)
• Some nonlinear conjugate gradient methods based on spectral scaling secant equations (Q2013630) (← links)
• A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods (Q2017614) (← links)
• An efficient modified AZPRP conjugate gradient method for large-scale unconstrained optimization problem (Q2036061) (← links)
• A spectral three-term Hestenes-Stiefel conjugate gradient method (Q2040607) (← links)
• New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization (Q2041515) (← links)
• Sufficient descent Riemannian conjugate gradient methods (Q2046556) (← links)
• A new descent spectral Polak-Ribière-Polyak method based on the memoryless BFGS update (Q2052328) (← links)
• Two nonmonotone trust region algorithms based on an improved Newton method (Q2053070) (← links)
• Unconstrained direct optimization of spacecraft trajectories using many embedded Lambert problems (Q2055351) (← links)
• Behavior of the combination of PRP and HZ methods for unconstrained optimization (Q2061360) (← links)
• Descent three-term DY-type conjugate gradient methods for constrained monotone equations with application (Q2065023) (← links)
• The global proof of the Polak-Ribière-Polak algorithm under the YWL inexact line search technique (Q2067951) (← links)
• A new accelerated conjugate gradient method for large-scale unconstrained optimization (Q2068094) (← links)
• Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications (Q2068628) (← links)
• Least-squares-based three-term conjugate gradient methods (Q2069298) (← links)
• The new spectral conjugate gradient method for large-scale unconstrained optimisation (Q2069403) (← links)
• On large-scale unconstrained optimization and arbitrary regularization (Q2070329) (← links)
• A dynamic extremum seeking scheme for three-player attack-defense with unknown gradient (Q2071211) (← links)
• Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization (Q2073942) (← links)
• Iterated dynamic thresholding search for packing equal circles into a circular container (Q2077968) (← links)
• Two improved nonlinear conjugate gradient methods with the strong Wolfe line search (Q2079812) (← links)
• Global convergence of a modified spectral three-term CG algorithm for nonconvex unconstrained optimization problems (Q2088792) (← links)
• A three-term conjugate gradient method with accelerated subspace quadratic optimization (Q2089194) (← links)
• Real-time pricing method for smart grid based on social welfare maximization model (Q2097501) (← links)
• Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems (Q2098802) (← links)
• Global convergence of Hager-Zhang type Riemannian conjugate gradient method (Q2101972) (← links)
• Two classes of spectral conjugate gradient methods for unconstrained optimizations (Q2103158) (← links)
• A modified HZ conjugate gradient algorithm without gradient Lipschitz continuous condition for non convex functions (Q2103175) (← 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)
• Adaptive three-term family of conjugate residual methods for system of monotone nonlinear equations (Q2107668) (← links)
• A Fokker-Planck feedback control framework for optimal personalized therapies in colon cancer-induced angiogenesis (Q2113523) (← links)
• Two efficient modifications of AZPRP conjugate gradient method with sufficient descent property (Q2129100) (← links)
• A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection (Q2133373) (← links)
• A study of Liu-Storey conjugate gradient methods for vector optimization (Q2139818) (← links)
• A new subspace minimization conjugate gradient method based on conic model for large-scale unconstrained optimization (Q2140823) (← links)
• A modified Dai-Liao conjugate gradient method for solving unconstrained optimization and image restoration problems (Q2142484) (← links)
• Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing (Q2142552) (← links)
• LMBOPT: a limited memory method for bound-constrained optimization (Q2146448) (← links)
• A hybrid conjugate gradient based approach for solving unconstrained optimization and motion control problems (Q2146720) (← links)
• New hybrid conjugate gradient method as a convex combination of LS and FR methods (Q2150719) (← links)
• Optimal scaling parameters for spectral conjugate gradient methods (Q2153393) (← links)
• Adaptive three-term PRP algorithms without gradient Lipschitz continuity condition for nonconvex functions (Q2163450) (← links)
• A new family of hybrid three-term conjugate gradient methods with applications in image restoration (Q2163451) (← links)
• An active set trust-region method for bound-constrained optimization (Q2169274) (← links)
• Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization (Q2171075) (← links)
• A new smoothing spectral conjugate gradient method for solving tensor complementarity problems (Q2171089) (← links)
• Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm (Q2176186) (← links)