The hybrid BFGS-CG method in solving unconstrained optimization problems

QR Code

The hybrid BFGS-CG method in solving unconstrained optimization problems

In solving large scale problems, the quasi-Newton method is known as the most efficient method in solving unconstrained optimization problems. Hence, a new hybrid method, known as the BFGS-CG method, has been created based on these properties, combining the search direction between conjugate gradien...

Full description

Bibliographic Details
Main Authors:	Ibrahim, Mohd Asrul Hery, Mamat, Mustafa, Leong, Wah June
Format:	Article
Language:	English
Published:	Hindawi Publishing Corporation 2014
Online Access:	http://psasir.upm.edu.my/id/eprint/25129/ http://psasir.upm.edu.my/id/eprint/25129/1/25129.pdf

Similar Items

The CG-BFGS method for unconstrained optimization problems
by: Ibrahim, Mohd Asrul Hery, et al.
Published: (2013)

New hybrid BFGS-CG method for solving unconstrained optimization

The CG-BFGS method for unconstrained optimization problems

The algorithms of Broyden-CG for unconstrained optimization problems
by: Ibrahim, Mohd Asrul Hery, et al.
Published: (2014)

Hybrid DFP-CG method for solving unconstrained optimization problems

BFGS method: a new search direction
by: Mohd. Asrul Hery Ibrahim,, et al.
Published: (2014)

BFGS method: a new search direction
by: Ibrahim, Mohd Asrul Hery, et al.
Published: (2014)

2018_A Hybrid BFGS-ZMRI Method for Solving Unconstrained Optimization Problems and Its Applications

Scaled memoryless BFGS preconditioned steepest descent method for very large-scale unconstrained optimization
by: Leong, Wah June, et al.
Published: (2009)

A class of diagonally preconditioned limited memory BFGS method for large scale unconstrained optimization
by: Leong, Wah June, et al.
Published: (2009)

The algorithms of Broyden-CG for unconstrained optimization problems

A Hybrid of Quasi-Newton Method with CG Method for Unconstrained Optimization

New BFGS method for unconstrained optimization problem based on modified Armijo line search
by: Wan, Zhong, et al.
Published: (2012)

A class of diagonal preconditioners for limited memory BFGS method.
by: Leong, Wah June, et al.
Published: (2013)

The scaling of hybrid method in solving unconstrained optimization method

2019_New Hybrid Quasi-Newton Methods For Solving Unconstrained Optimization Problems

Modified Quasi-Newton Methods For Large-Scale Unconstrained Optimization
by: Leong, Wah June
Published: (2003)

Efficient ODE-based methods for unconstrained optimization
by: Yap, Chui Ying, et al.
Published: (2018)

A Switching Criterion in Hybrid Quasi-Newton BFGS - Steepest Descent Direction
by: Abu Hassan, Malik, et al.
Published: (1999)

Convergence and stability of line search methods for unconstrained optimization.
by: Leong, Wah June, et al.
Published: (2013)

Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization
by: Farid, Mahboubeh, et al.
Published: (2013)

Structured symmetric rank-one method for unconstrained optimization
by: Modarres, Farzin, et al.
Published: (2011)

Solving unconstrained minimization problems with a new hybrid conjugate gradient method

A scaled three-term conjugate gradient method for unconstrained optimization
by: Arzuka, Ibrahim, et al.
Published: (2016)

Scaled memoryless symmetric rank one method for large-scale unconstrained optimization
by: Leong, Wah June, et al.
Published: (2008)

Gradient method with multiple damping for large-scale unconstrained optimization
by: Sim, Hong Seng, et al.
Published: (2019)

Scaling strategies for symmetric rank-one method in solving unconstrained optimization problems

2019_Enhancing Spectral Conjugate Gradient Methods For Solving Unconstrained Optimization Problems

Preconditioning on subspace quasi-Newton method for large scale unconstrained optimization
by: Sim, Hong Seng, et al.
Published: (2013)

A new diagonal gradient-type method for large scale unconstrained optimization
by: Farid, Mahboubeh, et al.
Published: (2013)

A derivative-free optimization method for solving classification problem
by: Shabanzadeh, Parvaneh, et al.
Published: (2010)

2020_New Modification of Conjugate Gradient Method and Its Hybridization to Solve Large-Scale Unconstrained Optimization Problems

Quasi-Newton methods based on ordinary differential equation approach for unconstrained nonlinear optimization
by: Khiyabani, Farzin Modarres, et al.
Published: (2014)

A three-term conjugate gradient method with nonmonotone line search for unconstrained optimization
by: Moyi, Aliyu Usman, et al.
Published: (2016)

Positive-definite memoryless symmetric rank one method for large-scale unconstrained optimization
by: Leong, Wah June, et al.
Published: (2011)

A new modified conjugate gradient method under the strong Wolfe line search for solving unconstrained optimization problems
by: Ishak, M. I., et al.
Published: (2022)

Memoryless modified symmetric rank-one method for large-scale unconstrained optimization
by: Modarres, Farzin, et al.
Published: (2009)

A monotone gradient method via weak secant equation for unconstrained optimization
by: Leong, Wah June, et al.
Published: (2010)

Convergence and Stability of Line Search Methods for Unconstrained Optimization
by: Leong, Wah, et al.
Published: (2013)

A new two-step gradient-type method for large-scale unconstrained optimization
by: Farid, Mahboubeh, et al.
Published: (2010)