A restarting approach on symmetric rank one update for unconstrained optimization

QR Code

A restarting approach on symmetric rank one update for unconstrained optimization

Two basic disadvantages of the symmetric rank one (SR1) update are that the SR1 update may not preserve positive definiteness when starting with a positive definite approximation and the SR1 update can be undefined. A simple remedy to these problems is to restart the update with the initial approxim...

Full description

Bibliographic Details
Main Authors:	Leong, Wah June, Abu Hassan, Malik
Format:	Article
Published:	Springer 2009
Online Access:	http://psasir.upm.edu.my/id/eprint/12810/

Similar Items

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

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

Convergence of a positive definite symmetric rank one method with restart
by: Leong, Wah June, et al.
Published: (2009)

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

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

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

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

Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization
by: Hong, Seng Sim, et al.
Published: (2021)

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

Implementation of Symmetric Rank-One Methods for Unconstrained Optimization
by: Khiyaban, Farzin Modarres
Published: (2010)

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

Symmetric rank-one method and its modifications for unconstrained optimization
by: Moyi, Aliyu Usman
Published: (2014)

Sufficient descent three term conjugate gradient method via symmetric rank-one update for large-scale optimization
by: Moyi, Aliyu Usman, et al.
Published: (2016)

Limited memory methods with improved symmetric rank-one updates and its applications on nonlinear image restoration
by: Khiyabani, Farzin Modarres, et al.
Published: (2014)

Scaling symmetric rank one update for unconstrained optimization
by: Abu Hassan, Malik, et al.
Published: (2002)

Scaling symmetric rank one update for unconstrained optimization
by: Abu Hassan, Malik, et al.
Published: (2003)

Improved Hessian approximations with modified secant equations for symmetric rank-one method
by: Modarres, Farzin, et al.
Published: (2011)

Convergence of symmetric rank-one method based on modified Quasi-Newton equation
by: Khiyabani, Farzin Modarres, et al.
Published: (2010)

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

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

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

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

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

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)

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

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

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

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

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

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

Towards large scale unconstrained optimization
by: Abu Hassan, Malik
Published: (2007)

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
by: Ibrahim, Mohd Asrul Hery, et al.
Published: (2013)

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

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 class of diagonally preconditioned limited memory BFGS method for large scale unconstrained optimization
by: Leong, Wah June, et al.
Published: (2009)

A new gradient method via least change secant update
by: Leong, Wah June, et al.
Published: (2011)

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