I am trying to implement limited memory bundle method on piece-wise linear convex optimization problem (with dimension=5000) in c++, however, it seems limited memory bundle method code is not generally available. But the BFGS code (or quasi newton method) seems to be more available. Thus, I want to ask in practice, which method is better (in what way), comparing quasi-newton, limited memory bundle method, limited memory BFGS method.... Thank you.

asked 07 May '15, 14:32

Chivalry's gravatar image

Chivalry
229117
accept rate: 0%

Be the first one to answer this question!
toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here

By RSS:

Answers

Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text](http://url.com/ "Title")
  • image?![alt text](/path/img.jpg "Title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported

Tags:

×231
×21

Asked: 07 May '15, 14:32

Seen: 478 times

Last updated: 12 May '15, 12:48

OR-Exchange! Your site for questions, answers, and announcements about operations research.