The following pages link to Algorithm 851 (Q3549169):
Displaying 50 items.
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems (Q2329657) (← 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 three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method (Q2338474) (← links)
- Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update (Q2359995) (← links)
- A globally convergent hybrid conjugate gradient method and its numerical behaviors (Q2375413) (← links)
- A descent extension of the Polak-Ribière-Polyak conjugate gradient method (Q2400710) (← links)
- Optimal control of convective FitzHugh-Nagumo equation (Q2403739) (← links)
- A descent Dai-Liao conjugate gradient method for nonlinear equations (Q2414704) (← links)
- An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization (Q2420801) (← 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)
- A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization (Q2441364) (← links)
- Adjoint-based optimization of PDEs in moving domains (Q2478540) (← links)
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization (Q2479826) (← links)
- Self-adaptive inexact proximal point methods (Q2479838) (← links)
- Some sufficient descent conjugate gradient methods and their global convergence (Q2514055) (← links)
- The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices (Q2514763) (← links)
- A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization (Q2515066) (← links)
- A new family of conjugate gradient methods (Q2519734) (← links)
- A class of descent four-term extension of the Dai-Liao conjugate gradient method based on the scaled memoryless BFGS update (Q2628174) (← links)
- Sufficient and necessary conditions of near-optimal controls for a diffusion dengue model with Lévy noise (Q2672973) (← links)
- A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem (Q2688917) (← links)
- A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula (Q2691372) (← links)
- A sufficient descent Liu–Storey conjugate gradient method and its global convergence (Q2808326) (← links)
- A descent hybrid modification of the Polak-Ribière-Polyak conjugate gradient method (Q2826665) (← links)
- Rate of Convergence of a Restarted CG-DESCENT Method (Q2841919) (← links)
- A Modified Hestenes-Stiefel Conjugate Gradient Algorithm for Large-Scale Optimization (Q2854330) (← links)
- New conjugate gradient-like methods for unconstrained optimization (Q2926084) (← links)
- A Modified Non-Monotone BFGS Method for Non-Convex Unconstrained Optimization (Q2931168) (← links)
- A New Adaptive Conjugate Gradient Algorithm for Large-Scale Unconstrained Optimization (Q2957702) (← links)
- A novel energy-based approach for merging finite elements (Q3017981) (← links)
- Two optimal Dai–Liao conjugate gradient methods (Q3453402) (← links)
- An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems (Q3453426) (← links)
- A hybridization of the Hestenes–Stiefel and Dai–Yuan conjugate gradient methods based on a least-squares approach (Q3458811) (← links)
- Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization (Q3539795) (← links)
- An adaptive nonmonotone trust region algorithm (Q4622885) (← links)
- A modified Hestense–Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method (Q4638925) (← links)
- A modified conjugate gradient algorithm with backtracking line search technique for large-scale nonlinear equations (Q4641557) (← links)
- INITIAL IMPROVEMENT OF THE HYBRID ACCELERATED GRADIENT DESCENT PROCESS (Q4684274) (← links)
- Erratum to: Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization (Q4924112) (← links)
- MATRIX ANALYSES ON THE DAI–LIAO CONJUGATE GRADIENT METHOD (Q4966642) (← links)
- On the control through leadership of the Hegselmann–Krause opinion formation model (Q4982236) (← links)
- Riemannian Multigrid Line Search for Low-Rank Problems (Q4997383) (← links)
- A Perry-type derivative-free algorithm for solving nonlinear system of equations and minimizing ℓ<sub>1</sub>regularized problem (Q4999755) (← links)
- A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization (Q5028578) (← links)
- The Hager–Zhang conjugate gradient algorithm for large-scale nonlinear equations (Q5031714) (← links)
- Optimal vaccination strategy for a mean-field stochastic susceptible-infected-vaccinated system (Q5057712) (← links)
- An efficient hybrid conjugate gradient method for unconstrained optimization (Q5058378) (← links)
- A modified Hager-Zhang conjugate gradient method with optimal choices for solving monotone nonlinear equations (Q5063454) (← links)
- Improving the Dai-Liao parameter choices using a fixed point equation (Q5080095) (← links)
