The following pages link to (Q3539529):
Displayed 50 items.
- On three-term conjugate gradient algorithms for unconstrained optimization (Q120733) (← links)
- An efficient modification of the Hestenes-Stiefel nonlinear conjugate gradient method with restart property (Q267707) (← links)
- Efficient tridiagonal preconditioner for the matrix-free truncated Newton method (Q272460) (← links)
- Quasi-Newton methods based on ordinary differential equation approach for unconstrained nonlinear optimization (Q272601) (← links)
- New hybrid conjugate gradient method for unconstrained optimization (Q278565) (← links)
- Spectral method and its application to the conjugate gradient method (Q279183) (← links)
- Scaling damped limited-memory updates for unconstrained optimization (Q306311) (← links)
- Dynamic scaling on the limited memory BFGS method (Q319180) (← links)
- The inexact-Newton via GMRES subspace method without line search technique for solving symmetric nonlinear equations (Q321382) (← links)
- On the performance of a new symmetric rank-one method with restart for solving unconstrained optimization problems (Q356122) (← links)
- An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems (Q364742) (← links)
- Scaling on the spectral gradient method (Q368739) (← links)
- Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization (Q370023) (← links)
- A nonmonotone line search slackness technique for unconstrained optimization (Q378287) (← links)
- Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization (Q382920) (← links)
- A new class of nonlinear conjugate gradient coefficients with global convergence properties (Q387529) (← links)
- The convergence rate of a restart MFR conjugate gradient method with inexact line search (Q387662) (← links)
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians (Q403098) (← links)
- An efficient nonmonotone trust-region method for unconstrained optimization (Q411524) (← links)
- Two modifications of the method of the multiplicative parameters in descent gradient methods (Q440766) (← links)
- An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization (Q457047) (← links)
- A nonmonotone filter line search technique for the MBFGS method in unconstrained optimization (Q488947) (← links)
- A nonmonotone hybrid method of conjugate gradient and Lanczos-type for solving nonlinear systems (Q489124) (← links)
- Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence (Q499680) (← links)
- Conjugate gradient path method without line search technique for derivative-free unconstrained optimization (Q501963) (← links)
- A class of diagonal quasi-Newton methods for large-scale convex minimization (Q503542) (← links)
- A new trust-region method for solving systems of equalities and inequalities (Q520331) (← links)
- Global optimization test problems based on random field composition (Q523165) (← links)
- A new two-step gradient-type method for large-scale unconstrained optimization (Q604019) (← links)
- New quasi-Newton methods via higher order tensor models (Q629502) (← links)
- Improved Hessian approximation with modified secant equations for symmetric rank-one method (Q629505) (← links)
- \(n\)-step quadratic convergence of the MPRP method with a restart strategy (Q633952) (← links)
- An improved multi-step gradient-type method for large scale optimization (Q640533) (← links)
- A symmetric rank-one method based on extra updating techniques for unconstrained optimization (Q651495) (← links)
- Scalar correction method for solving large scale unconstrained minimization problems (Q658551) (← links)
- Global convergence of a modified Hestenes-Stiefel nonlinear conjugate gradient method with Armijo line search (Q662895) (← links)
- A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches (Q668235) (← links)
- Cross-Hill: a heuristic method for global optimization (Q669439) (← links)
- An accelerated nonmonotone trust region method with adaptive trust region for unconstrained optimization (Q683334) (← links)
- An adaptive scaled BFGS method for unconstrained optimization (Q684183) (← links)
- A hybrid ODE-based method for unconstrained optimization problems (Q694546) (← links)
- A filter-line-search method for unconstrained optimization (Q711526) (← links)
- Some three-term conjugate gradient methods with the inexact line search condition (Q723556) (← links)
- A nonmonotone supermemory gradient algorithm for unconstrained optimization (Q741395) (← links)
- A conjugate gradient method with sufficient descent property (Q747726) (← links)
- A modified bat algorithm with conjugate gradient method for global optimization (Q779965) (← links)
- Another three-term conjugate gradient method close to the memoryless BFGS for large-scale unconstrained optimization problems (Q821530) (← links)
- An adaptive trust region method based on simple conic models (Q894560) (← links)
- A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems (Q897051) (← links)
- An accelerated double step size model in unconstrained optimization (Q902839) (← links)