A new hybrid algorithm for convex nonlinear unconstrained optimization

DOI10.1155/2019/8728196zbMath1442.90180OpenAlexW2933380457MaRDI QIDQ2337034

Abbas Y. Al-Bayati, Huda I. Ahmed, Eman T. Hamed

Publication date: 19 November 2019

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2019/8728196

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (3)

A method of two new augmented Lagrange multiplier versions for solving constrained problems ⋮ Optimal homotopy asymptotic method-least square for solving nonlinear fractional-order gradient-based dynamic system from an optimization problem ⋮ A modified bat algorithm with conjugate gradient method for global optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization
• Efficient generalized conjugate gradient algorithms. I: Theory
• Global convergence properties of nonlinear conjugate gradient methods with modified secant condition
• Optimization theory and methods. Nonlinear programming
• THE SCALING OF HYBRID METHOD IN SOLVING UNCONSTRAINED OPTIMIZATION METHOD
• Technical Note—A Modified Conjugate Gradient Algorithm
• Restart procedures for the conjugate gradient method
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• Function minimization by conjugate gradients
• 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.

This page was built for publication: A new hybrid algorithm for convex nonlinear unconstrained optimization