What is the state of art c++ solvers for non-smooth (piecewise linear) convex optimizations (based on bundle method)? I know that piecewise linear objective can be converted to LP combined with constraint generation but the LP system requires exponentially many constraints and constraint generation algorithm still turns out to be exponential... Thank you very much.

asked 29 Nov '14, 01:49

Chivalry's gravatar image

Chivalry
229117
accept rate: 0%

(01 Dec '14, 09:14) Austin Buchanan
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:

×46
×40
×20
×3

Asked: 29 Nov '14, 01:49

Seen: 465 times

Last updated: 01 Dec '14, 09:14

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