Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update

DOI10.1016/j.cam.2017.04.045zbMath1365.65158OpenAlexW2611264541MaRDI QIDQ2359995

Neculai Andrei

Publication date: 23 June 2017

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.2017.04.045

zbMATH Keywords

unconstrained optimizationFrobenius normconjugacy conditionsufficient descent conditionconjugate gradient algorithmsself-scaling memoryless BFGS update

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06)

Related Items

A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization, An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition, Two new conjugate gradient methods for unconstrained optimization, An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix, A note on the global convergence theorem of accelerated adaptive Perry conjugate gradient methods, A modified conjugate gradient method based on the self-scaling memoryless BFGS update, A Dai-Liao conjugate gradient method via modified secant equation for system of nonlinear equations, A class of accelerated conjugate-gradient-like methods based on a modified secant equation, An adaptive modified three-term conjugate gradient method with global convergence, A hybrid HS-LS conjugate gradient algorithm for unconstrained optimization with applications in motion control and image recovery, Descent Perry conjugate gradient methods for systems of monotone nonlinear equations, A globally convergent derivative-free projection method for nonlinear monotone equations with applications, An adaptive family of projection methods for constrained monotone nonlinear equations with applications, Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization, Enhanced Dai-Liao conjugate gradient methods for systems of monotone nonlinear equations, A subspace minimization conjugate gradient method based on conic model for unconstrained optimization, Adaptive three-term family of conjugate residual methods for system of monotone nonlinear equations, An efficient three-term conjugate gradient-based algorithm involving spectral quotient for solving convex constrained monotone nonlinear equations with applications

Uses Software

• CUTEr
• CONMIN
• MINPACK-2
• CG_DESCENT
• Algorithm 500
• SCALCG
• ACGSSV

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A modified scaling parameter for the memoryless BFGS updating formula
• A note on the global convergence theorem of the scaled conjugate gradient algorithms proposed by Andrei
• An adaptive conjugate gradient algorithm for large-scale unconstrained optimization
• On restart procedures for the conjugate gradient method
• Conjugate gradient methods using quasi-Newton updates with inexact line searches
• Acceleration of conjugate gradient algorithms for unconstrained optimization
• 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
• Scaled conjugate gradient algorithms for unconstrained optimization
• Optimization theory and methods. Nonlinear programming
• Concerning my paper on the boundary behavior of minimal surfaces
• Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
• Algorithm 851
• Globally convergent conjugate gradient algorithms
• Technical Note—A Modified Conjugate Gradient Algorithm
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Self-Scaling Variable Metric (SSVM) Algorithms
• Self-Scaling Variable Metric (SSVM) Algorithms
• Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]
• Optimal conditioning of self-scaling variable Metric algorithms
• Restart procedures for the conjugate gradient method
• Conjugate Gradient Methods with Inexact Searches
• On the Convergence of a New Conjugate Gradient Algorithm
• Convergence Properties of Nonlinear Conjugate Gradient Methods
• Eigenvalues versus singular values study in conjugate gradient algorithms for large-scale unconstrained optimization
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• CUTEr and SifDec
• Convergence Conditions for Ascent Methods
• Convergence Conditions for Ascent Methods. II: Some Corrections
• Methods of conjugate gradients for solving linear systems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• Benchmarking optimization software with performance profiles.