A new modified scaled conjugate gradient method for large-scale unconstrained optimization with non-convex objective function

DOI10.1080/10556788.2018.1457152zbMath1422.90023OpenAlexW2797084906WikidataQ130037490 ScholiaQ130037490MaRDI QIDQ5379462

Ali Reza Ashrafi, Zahra Khoshgam

Publication date: 12 June 2019

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2018.1457152

zbMATH Keywords

conjugate gradient methodsecant equationlarge scale unconstrained optimization problemsmemoryless BFGS method

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26)

Related Items (3)

An accelerated descent CG algorithm with clustering the eigenvalues for large-scale nonconvex unconstrained optimization and its application in image restoration problems ⋮ Descent Perry conjugate gradient methods for systems of monotone nonlinear equations ⋮ Enhanced Dai-Liao conjugate gradient methods for systems of monotone nonlinear equations

Uses Software

• CUTEr
• SCALCG

Cites Work

• Unnamed Item
• Unnamed Item
• Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
• Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization
• A note on the global convergence theorem of the scaled conjugate gradient algorithms proposed by Andrei
• A modified scaled conjugate gradient method with global convergence for nonconvex functions
• Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization
• New quasi-Newton methods via higher order tensor models
• A modified Perry's conjugate gradient method-based derivative-free method for solving large-scale nonlinear monotone equations
• A modified quasi-Newton method for structured optimization with partial information on the Hessian
• A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
• Two new conjugate gradient methods based on modified secant equations
• The superlinear convergence of a modified BFGS-type method for unconstrained optimization
• Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
• A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization
• Scaled conjugate gradient algorithms for unconstrained optimization
• New quasi-Newton methods for unconstrained optimization problems
• Optimization theory and methods. Nonlinear programming
• A nonlinear conjugate gradient method based on the MBFGS secant condition
• A scaled nonlinear conjugate gradient algorithm for unconstrained optimization
• Conjugate Gradient Methods with Inexact Searches
• Convergence Properties of Nonlinear Conjugate Gradient Methods
• Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
• CUTEr and SifDec
• A modified BFGS method and its global convergence in nonconvex minimization
• A spectral conjugate gradient method for unconstrained optimization
• Benchmarking optimization software with performance profiles.

This page was built for publication: A new modified scaled conjugate gradient method for large-scale unconstrained optimization with non-convex objective function