DSpace JSPUI
DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets
Learn More
Please use this identifier to cite or link to this item:
http://repository.iiitd.edu.in/xmlui/handle/123456789/693| Title: | Submodular function minimization |
| Authors: | Goswami, Shubham Arora, Chetan (Advisor) |
| Keywords: | Complexity Algorithms Convex optimization linear programming |
| Issue Date: | 17-Nov-2017 |
| Publisher: | IIIT-Delhi |
| Abstract: | Sum of submodular function minimization is a combinatorial optimization problem(NP-Hard), We begin with the Submodular function minimization and extending it to Sum of submodular function(SOS), there are different algorithms dealing with this problem the best in running time known is Min Norm Point Algorithm for Higher Order MRF-MAP Inference by (Ishant Shanu, Dr. Chetan Arora, Pagar Singla), The approach that is used in this report uses cutting Plane and other convex optimization Methods which are best known to deal with convex optimization problems and we use it for Submodular function minimization. |
| URI: | http://repository.iiitd.edu.in/xmlui/handle/123456789/693 |
| Appears in Collections: | Year-2018 |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Shubham Goswami_2014100.pdf Restricted Access | 320.38 kB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.