An adaptive conjugate gradient algorithm for large-scale unconstrained optimization
From MaRDI portal
Publication:495053
DOI10.1016/j.cam.2015.07.003zbMath1321.90124OpenAlexW1022154690MaRDI QIDQ495053
Publication date: 9 September 2015
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2015.07.003
unconstrained optimizationnumerical comparisonsadaptive conjugate gradient methodcondition number of a matrix
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)
Related Items
Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update ⋮ A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection ⋮ A new adaptive trust region algorithm for optimization problems ⋮ A diagonal quasi-Newton updating method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization ⋮ An improved Perry conjugate gradient method with adaptive parameter choice ⋮ Recursive least squares and multi-innovation stochastic gradient parameter estimation methods for signal modeling ⋮ A double-parameter scaling Broyden-Fletcher-Goldfarb-Shanno method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization ⋮ A method of two new augmented Lagrange multiplier versions for solving constrained problems ⋮ An efficient modified residual-based algorithm for large scale symmetric nonlinear equations by approximating successive iterated gradients ⋮ A Dai-Liao conjugate gradient method via modified secant equation for system of nonlinear equations ⋮ New conjugate gradient algorithms based on self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method ⋮ A family of the modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent and conjugacy conditions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A new family of conjugate gradient methods for unconstrained optimization ⋮ A descent hybrid modification of the Polak–Ribière–Polyak conjugate gradient method ⋮ 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 ⋮ An efficient three-term conjugate gradient-based algorithm involving spectral quotient for solving convex constrained monotone nonlinear equations with applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modified scaled conjugate gradient method with global convergence for nonconvex functions
- Block splittings for the conjugate gradient method
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- On the rate of convergence of the preconditioned conjugate gradient method
- Numerical study of a relaxed variational problem from optimal design
- On a problem of the theory of lubrication governed by a variational inequality
- Mathematical problems from combustion theory
- Optimization theory and methods. Nonlinear programming
- Concerning my paper on the boundary behavior of minimal surfaces
- Algorithm 851
- Technical Note—A Modified Conjugate Gradient Algorithm
- Some Superlinear Convergence Results for the Conjugate Gradient Method
- New convergence results and preconditioning strategies for the conjugate gradient method
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- New conjugacy conditions and related nonlinear conjugate gradient methods
