The CG-BFGS method for unconstrained optimization problems

QR Code

The CG-BFGS method for unconstrained optimization problems

In this paper we present a new search direction known as the CG-BFGS method, which uses the search direction of the conjugate gradient method approach in the quasi-Newton methods. The new algorithm is compared with the quasi-Newton methods in terms of the number of iterations and CPU-time. The Broyd...

Full description

Bibliographic Details
Main Authors:	Ibrahim, Mohd Asrul Hery, Mamat, Mustafa, Leong, Wah June, Mohammad Sofi, Azfi Zaidi
Format:	Conference or Workshop Item
Language:	English
Published:	AIP Publishing LLC 2013
Online Access:	http://psasir.upm.edu.my/id/eprint/36856/ http://psasir.upm.edu.my/id/eprint/36856/1/The%20CG-BFGS%20method%20for%20unconstrained%20optimization%20problems.pdf

Similar Items

The hybrid BFGS-CG method in solving unconstrained optimization problems
by: Ibrahim, Mohd Asrul Hery, et al.
Published: (2014)

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

The CG-BFGS method for unconstrained optimization problems

New hybrid BFGS-CG method for solving unconstrained optimization

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)

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

Hybrid DFP-CG method for solving unconstrained optimization problems

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

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

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

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

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)

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)

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)

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)

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 Switching Criterion in Hybrid Quasi-Newton BFGS - Steepest Descent Direction
by: Abu Hassan, Malik, et al.
Published: (1999)

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)

A symmetric rank-one method based on extra updating techniques for unconstrained optimization.
by: Modarres, Farzin, et al.
Published: (2011)

Diagonal preconditioned conjugate gradient algorithm for unconstrained optimization
by: Ng, Choong Boon, et al.
Published: (2014)

A restarting approach on symmetric rank one update for unconstrained optimization
by: Leong, Wah June, et al.
Published: (2009)

On the Modifications of a Broyden's Single Parameter Rank-Two Quasi-Newton Method for Unconstrained Minimization
by: Leong, Wah June
Published: (1999)

Memoryless quasi-Newton-type methods via some weak secant relations for large-scale unconstrained optimization
by: Lim, Keat Hee, et al.
Published: (2024)

Multi-steps symmetric rank-one update for unconstrained optimization
by: Modarres, Farzin, et al.
Published: (2009)

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

Multi-step spectral gradient methods with modified weak secant relation for large scale unconstrained optimization
by: Hong, Seng Sim, et al.
Published: (2018)