386. Split and conquer!
Invited abstract in session MA-1: Francisco Aragón Artacho, stream Keynotes.
Monday, 8:30-10:00Room: Great Hall
Authors (first author is the speaker)
| 1. | Francisco Javier Aragón Artacho
|
| Mathematics, University of Alicante |
Abstract
When an optimization problem is structured, it is normally advantageous to use this feature when designing algorithms to solve it. Following the divide-and-conquer paradigm, splitting algorithms iteratively solve simpler problems that are defined by separately using some parts of the original problem. In this talk, we will recall some classical methods and present some recent advances in this subject, such as splitting methods devised by graphs, algorithms in nonconvex settings, and even some heuristics. These methods have relevant real-world applications in different areas, including some problems in data science.
Keywords
- Analytics and Data Science
- Optimization Modeling
Status: accepted
Back to the list of papers