Pages that link to "Item:Q4943611"

The following pages link to A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property (Q4943611):

Displaying 50 items.

• A modified Perry conjugate gradient method and its global convergence (Q2355321) (← links)
• Multivariate spectral DY-type projection method for convex constrained nonlinear monotone equations (Q2358488) (← links)
• Forward-backward quasi-Newton methods for nonsmooth optimization problems (Q2364124) (← links)
• A scaled three-term conjugate gradient method for unconstrained optimization (Q2374196) (← links)
• A globally convergent hybrid conjugate gradient method and its numerical behaviors (Q2375413) (← links)
• A conjugate gradient type method for the nonnegative constraints optimization problems (Q2375742) (← links)
• MGOPT with gradient projection method for solving bilinear elliptic optimal control problems (Q2380805) (← links)
• A new version of the Liu-Storey conjugate gradient method (Q2381321) (← 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)
• A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization (Q2413500) (← links)
• A new modified three-term conjugate gradient method with sufficient descent property and its global convergence (Q2421741) (← links)
• Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search (Q2433993) (← links)
• A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization (Q2436686) (← links)
• A smoothing conjugate gradient method for solving systems of nonsmooth equations (Q2453242) (← links)
• Convergence of supermemory gradient method (Q2454990) (← links)
• A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization (Q2469707) (← links)
• Memory gradient method with Goldstein line search (Q2469911) (← links)
• On the method of shortest residuals for unconstrained optimization (Q2471088) (← links)
• A new class of projection and contraction methods for solving variational inequality problems (Q2475884) (← links)
• Another hybrid conjugate gradient algorithm for unconstrained optimization (Q2481406) (← links)
• Formulation and numerical solution of finite-level quantum optimal control problems (Q2483345) (← links)
• Two descent hybrid conjugate gradient methods for optimization (Q2483351) (← links)
• New line search methods for unconstrained optimization (Q2510603) (← links)
• Some sufficient descent conjugate gradient methods and their global convergence (Q2514055) (← 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 new family of conjugate gradient methods (Q2519734) (← 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)
• Contrast enhanced tomographic reconstruction of vascular blood flow with first order and second order adjoint methods (Q2633404) (← links)
• Analysis of the impact of nonlinear heat transfer laws on temperature distribution in irradiated biological tissues: Mathematical models and optimal controls (Q2642953) (← links)
• A generalized hybrid CGPM-based algorithm for solving large-scale convex constrained equations with applications to image restoration (Q2656084) (← links)
• A recalling-enhanced recurrent neural network: conjugate gradient learning algorithm and its convergence analysis (Q2660959) (← links)
• Signal recovery with convex constrained nonlinear monotone equations through conjugate gradient hybrid approach (Q2664762) (← links)
• A decent three term conjugate gradient method with global convergence properties for large scale unconstrained optimization problems (Q2671105) (← 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)
• Composing scalable nonlinear algebraic solvers (Q2808260) (← links)
• A sufficient descent Liu–Storey conjugate gradient method and its global convergence (Q2808326) (← links)
• Linear convergence of descent methods for the unconstrained minimization of restricted strongly convex functions (Q2821800) (← links)
• A back propagation through time-like min-max optimal control algorithm for nonlinear systems (Q2847236) (← links)
• Quantum optimal control using the adjoint method (Q2852190) (← links)
• A Modified Hestenes-Stiefel Conjugate Gradient Algorithm for Large-Scale Optimization (Q2854330) (← links)
• A hybrid conjugate gradient method based on a quadratic relaxation of the Dai–Yuan hybrid conjugate gradient parameter (Q2868907) (← links)
• Sufficient descent conjugate gradient methods for large-scale optimization problems (Q2885559) (← links)
• New three-term conjugate gradient method with guaranteed global convergence (Q2935391) (← links)
• New conjugate gradient method for unconstrained optimization (Q2954367) (← links)
• A New Adaptive Conjugate Gradient Algorithm for Large-Scale Unconstrained Optimization (Q2957702) (← links)