A Subspace Limited Memory BFGS Algorithm For Box Constrained Optimization
Abstract: In this paper, a subspace limited BFGS algorithm is proposed for bound constrained optimization. The global convergence will be established under some suitable conditions. Numerical results show that this method is more competitive than the normal method does.
Keywords: box constrained optimization; limited memory BFGS method; global convergence.
Category 1: Nonlinear Optimization (Bound-constrained Optimization )
Entry Submitted: 08/25/2008
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|