Optimization Online


A Subspace Limited Memory BFGS Algorithm For Box Constrained Optimization

Wei Zengxin(zxwei***at***gxu.edu.cn)
Wu Yanlin(wyl-kk***at***163.com)
Yuan Gonglin(glyuan***at***gxu.edu.cn)

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 )


Download: [Postscript]

Entry Submitted: 08/25/2008
Entry Accepted: 08/26/2008
Entry Last Modified: 08/25/2008

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society