MIT - Faster optimization

17,577
7,226
Optimization problems are everywhere in engineering: Balancing design tradeoffs is an optimization problem, as are scheduling and logistical planning. The theory — and sometimes the implementation — of control systems relies heavily on optimization, and so does machine learning, which has been the basis of most recent advances in artificial intelligence.

This week, at the IEEE Symposium on Foundations of Computer Science, a trio of present and past MIT graduate students won a best-student-paper award for a new “cutting-plane” algorithm, a general-purpose algorithm for solving optimization problems. The algorithm improves on the running time of its most efficient predecessor, and the researchers offer some reason to think that they may have reached the theoretical limit.
http://news.mit.edu/2015/faster-optimization-algorithm-1023

PDF: http://arxiv.org/pdf/1508.04874v1.pdf
 
33,502
9,225
LOL!
scnr
Edit: was a reference to a post that got deleted.

Good to see more progress on optimization. There are so many crazy algorithms, e. g. for multiplication.
 
Last edited:
1,113
205
No mfb, this isn't about optimising algorithms, it's about an algorithm for optimisation!
 
33,502
9,225
New general-purpose optimization algorithm promises order-of-magnitude speedups on some problems.
(fromt the link below the quote)
=> it can be used to speed up finding solutions to problems.
 

Related Threads for: MIT - Faster optimization

  • Last Post
Replies
10
Views
3K
  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
1
Views
718
  • Last Post
Replies
4
Views
2K
  • Last Post
Replies
2
Views
2K
  • Last Post
Replies
5
Views
2K
  • Last Post
Replies
4
Views
1K
  • Last Post
Replies
1
Views
1K

Hot Threads

Recent Insights

Top