Basically, I am implementing the level method on a non-smooth convex optimization problem with dimension=3000 :

However, at late stage of the algorithm, the algorithm spends too much time in calculating the linear programming and quadratic programming (basically takes up to a minute) while function evaluation only takes up to less than 1 second.... I am wondering what would be the state of art approach on this issue? Thank you:D

asked 11 Mar '15, 16:46

Chivalry's gravatar image

accept rate: 0%

edited 11 Mar '15, 17:54

(11 Mar '15, 23:19) 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



Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text]( "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



Asked: 11 Mar '15, 16:46

Seen: 1,069 times

Last updated: 11 Mar '15, 23:19

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